A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE)
From MaRDI portal
Publication:5059314
DOI10.1080/0305215X.2019.1595611OpenAlexW2944413817WikidataQ115427476 ScholiaQ115427476MaRDI QIDQ5059314
Xuan He, Chuck Zhang, Houbin Song, Fuqing Zhao, Guoqiang Yang, Wei-Min Ma
Publication date: 23 December 2022
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2019.1595611
Cites Work
- Optimization by Simulated Annealing
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem
- Dynamic scaling on the limited memory BFGS method
- Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
- A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
- Adaptive differential evolution algorithm with novel mutation strategies in multiple sub-populations
- A ranking-based adaptive artificial bee colony algorithm for global numerical optimization
- Theoretical aspects of local search.
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- A limited memory BFGS-type method for large-scale unconstrained optimization
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
- Simulated annealing based artificial bee colony algorithm for global numerical optimization
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- Iterated local search for the quadratic assignment problem
- An iterated-local-search heuristic for the resource-constrained weighted earliness-tardiness project scheduling problem
- Numerical Optimization
- An iterated local search algorithm for the team orienteering problem with variable profits
This page was built for publication: A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE)
