Expansion-based hill-climbing

DOI10.1016/j.ins.2023.119635OpenAlexW4386413867MaRDI QIDQ6074953

Sara Tari, Adrien Goëffon, Matthieu Basseur

Publication date: 19 October 2023

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2023.119635

zbMATH Keywords

combinatorial optimizationlocal searchhill-climbing algorithmfitness landscapeslandscape-aware heuristicsmaximum expansion

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
• Variable neighborhood search
• The late acceptance hill-climbing heuristic
• An analysis of why cuckoo search does not bring any novel ideas to optimization
• Benchmarks for basic scheduling problems
• The Complexity of Flowshop and Jobshop Scheduling
• Worst Improvement Based Iterated Local Search
• Metaheuristics—the metaphor exposed
• Neutrality in fitness landscapes.
• On the landscape ruggedness of the quadratic assignment problem

This page was built for publication: Expansion-based hill-climbing