Spatial-domain fitness landscape analysis for combinatorial optimization
From MaRDI portal
Publication:2200693
DOI10.1016/J.INS.2018.09.019zbMATH Open1443.90298OpenAlexW2890029885WikidataQ58934846 ScholiaQ58934846MaRDI QIDQ2200693FDOQ2200693
Authors: Hui Lu, Rongrong Zhou, Zongming Fei, Chongchong Guan 
Publication date: 22 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.09.019
Recommendations
- Trends on fitness landscape analysis in evolutionary computation and meta-heuristics
- Fitness landscape analysis and metaheuristics efficiency
- Fitness landscape analysis for the no-wait flow-shop scheduling problem
- How perturbation strength shapes the global structure of TSP fitness landscapes
- Evolutionary optimization and dynamic fitness landscapes
Cites Work
- Title not available (Why is that?)
- The Complexity of Flowshop and Jobshop Scheduling
- Measuring epistasis in fitness landscapes: the correlation of fitness effects of mutations
- Routing and scheduling in a flexible job shop by tabu search
- Neutrality in fitness landscapes.
- A discrete gravitational search algorithm for solving combinatorial optimization problems
- Analysis of the similarities and differences of job-based scheduling problems
- Nonstandard utilities for lexicographically decomposable orderings
- A novel artificial bee colony algorithm with an adaptive population size for numerical function optimization
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Unrelated parallel-machine scheduling problems with multiple rate-modifying activities
- Adaptive feasible and infeasible tabu search for weighted vertex coloring
Cited In (2)
This page was built for publication: Spatial-domain fitness landscape analysis for combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200693)
