NDLI: A Novel Modified Tree-Seed Algorithm for High-Dimensional Optimization Problems

Content Provider	IET Digital Library
Author	Zhao, Shijie Gao, Leifu Tu, Jun Yu, Dongmei
Abstract	To efficiently handle high-dimensional continuous optimization problems, a Modified tree-seed algorithm(MTSA) is proposed by coupling a newly introduced control parameter named as Seed domain shrinkable coefficient(SDSC) and Local reinforcement strategy(LRS) based on gradient information of adjacentgeneration best trees. SDSC is dynamically decreased with iterations to adjust the produced domain of offspring seeds, for achieving the tradeoff between the global exploration and local exploitation. LRS strategy is to execute local exploitation process by employing gradient information of two best trees, for enhancing convergence efficiency and local optima avoidance with probabilities. The compared experimental results show the different effects of differenttype SDSC on MTSA, the faster convergence efficiency and the stronger robustness of the proposed MTSA.
Starting Page	337
Ending Page	343
Page Count	7
ISSN	10224653
Volume Number	29
e-ISSN	20755597
Issue Number	Issue 2, Mar (2020)
Alternate Webpage(s)	https://digital-library.theiet.org/content/journals/cje/29/2
Alternate Webpage(s)	https://digital-library.theiet.org/content/journals/10.1049/cje.2020.01.012
Journal	Chinese Journal of Electronics
Publisher Date	2020-03-01
Access Restriction	Open
Rights Holder	© Chinese Institute of Electronics
Subject Keyword	Adjacent-generation Best Trees Combinatorial Mathematics Control Parameter Convergence Convergence Efficiency Global Exploration Gradient Information Gradient Method High-dimensional Continuous Optimization Problem High-dimensional Optimization Problem Iterative Method Local Exploitation Process Local Optima Avoidance Local Reinforcement Strategy LRS Strategy Mathematics MTSA Novel Modified Tree-seed Algorithm Offspring Seed Optimisation Optimisation Technique Probabilities Probability SDSC Seed Domain Shrinkable Coefficient Statistics Trees
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Performing linear convergence for distributed constrained optimisation over time-varying directed unbalanced networks

Optimisation of offshore wind farm collection systems-based on modified genetic algorithm

Selectivity Estimation for String Predicates Based on Modified Pruned Count-Suffix Tree

Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization

A new smoothing modified three-term conjugate gradient method for (l_{1})-norm minimization problem

Improved artificial bee colony algorithm with opposition-based learning

Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm

Guided Hybrid Modified Simulated Annealing Algorithm for Solving Constrained Global Optimization Problems

Ant colony optimisation algorithm for multiobjective subset selection problems

A Novel Modified Tree-Seed Algorithm for High-Dimensional Optimization Problems

Similar Documents

Performing linear convergence for distributed constrained optimisation over time-varying directed unbalanced networks

Optimisation of offshore wind farm collection systems-based on modified genetic algorithm

Selectivity Estimation for String Predicates Based on Modified Pruned Count-Suffix Tree

Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization

A new smoothing modified three-term conjugate gradient method for (l_{1})-norm minimization problem

Improved artificial bee colony algorithm with opposition-based learning

Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm

Guided Hybrid Modified Simulated Annealing Algorithm for Solving Constrained Global Optimization Problems

Ant colony optimisation algorithm for multiobjective subset selection problems

A Novel Modified Tree-Seed Algorithm for High-Dimensional Optimization Problems