Landscapes, operators and heuristic search
From MaRDI portal
Publication:1290162
DOI10.1023/A:1018983524911zbMath0921.90095OpenAlexW1534688999MaRDI QIDQ1290162
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
Related Items
New insights on neutral binary representations for evolutionary optimization ⋮ Variable neighborhood search for integrated timetable based design of railway infrastructure ⋮ Local search-based hybrid algorithms for finding Golomb rulers ⋮ Breakout local search for maximum clique problems ⋮ On operators and search space topology in multi-objective flow shop scheduling ⋮ Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial ⋮ A review of metrics on permutations for search landscape analysis ⋮ On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification ⋮ An opposition-based memetic algorithm for the maximum quasi-clique problem ⋮ Initialization of metaheuristics: comprehensive review, critical analysis, and research directions ⋮ Stochastic local search and parameters recommendation: a case study on flowshop problems ⋮ Discovering the suitability of optimisation algorithms by learning from evolved instances ⋮ HC\_AB: a new heuristic clustering algorithm based on approximate backbone ⋮ Memetic algorithms outperform evolutionary algorithms in multimodal optimisation ⋮ Seeking global edges for traveling salesman problem in multi-start search ⋮ Why operator-induced neighborhoods are a bad idea ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers ⋮ How to escape local optima in black box optimisation: when non-elitism outperforms elitism ⋮ Backbone analysis and algorithm design for the quadratic assignment problem ⋮ Fitness landscape analysis for the no-wait flow-shop scheduling problem ⋮ Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem ⋮ An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers ⋮ Predatory search algorithm with restriction of solution distance ⋮ Iterated local search for the quadratic assignment problem ⋮ A metaheuristic for the delivery man problem with time windows ⋮ Some aspects of scatter search in the flow-shop problem
