Spatial-domain fitness landscape analysis for combinatorial optimization
From MaRDI portal
Publication:2200693
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
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- A discrete gravitational search algorithm for solving combinatorial optimization problems
- A novel artificial bee colony algorithm with an adaptive population size for numerical function optimization
- Adaptive feasible and infeasible tabu search for weighted vertex coloring
- Analysis of the similarities and differences of job-based scheduling problems
- Measuring epistasis in fitness landscapes: the correlation of fitness effects of mutations
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Neutrality in fitness landscapes.
- Nonstandard utilities for lexicographically decomposable orderings
- Routing and scheduling in a flexible job shop by tabu search
- The Complexity of Flowshop and Jobshop Scheduling
- Unrelated parallel-machine scheduling problems with multiple rate-modifying activities
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)