Worst improvement based iterated local search

DOI10.1007/978-3-319-77449-7_4MaRDI QIDQ5233123zbMATH OpenOpenAlexFDO

Authors Sara Tari, Matthieu Basseur, Adrien Goëffon

Publication date 16 September 2019

Published in Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-77449-7_4

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• First vs. best improvement: an empirical study
• scientific article; zbMATH DE number 2050711
• Mechanisms for local search
• Iterated local search for the quadratic assignment problem
• Hill Climbing with Multiple Local Optima

Cited in

(1)

• Expansion-based hill-climbing

This page was built for publication: Worst improvement based iterated local search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233123)