Landscapes, operators and heuristic search
From MaRDI portal
Publication:1290162
DOI10.1023/A:1018983524911zbMATH Open0921.90095OpenAlexW1534688999MaRDI QIDQ1290162FDOQ1290162
Publication date: 10 June 1999
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018983524911
Recommendations
Cited In (33)
- Backbone analysis and algorithm design for the quadratic assignment problem
- How to escape local optima in black box optimisation: when non-elitism outperforms elitism
- A hybrid and adaptive evolutionary approach for multitask optimization of post-disaster traveling salesman and repairman problems
- Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
- Title not available (Why is that?)
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers
- New insights on neutral binary representations for evolutionary optimization
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
- Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem
- On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification
- A review of metrics on permutations for search landscape analysis
- Title not available (Why is that?)
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- Why operator-induced neighborhoods are a bad idea
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
- Stochastic local search and parameters recommendation: a case study on flowshop problems
- Breakout local search for maximum clique problems
- A metaheuristic for the delivery man problem with time windows
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Title not available (Why is that?)
- Predatory search algorithm with restriction of solution distance
- Measuring instance difficulty for combinatorial optimization problems
- On operators and search space topology in multi-objective flow shop scheduling
- HC\_AB: a new heuristic clustering algorithm based on approximate backbone
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- Variable neighborhood search for integrated timetable based design of railway infrastructure
- Seeking global edges for traveling salesman problem in multi-start search
- Iterated local search for the quadratic assignment problem
- Some aspects of scatter search in the flow-shop problem
- Fitness landscape analysis for the no-wait flow-shop scheduling problem
- Efficiency of local search with multiple local optima
- Local search-based hybrid algorithms for finding Golomb rulers
- Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
This page was built for publication: Landscapes, operators and heuristic search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290162)
