Guided Local Search

DOI10.1007/0-306-48056-5_7zbMath1102.90385OpenAlexW4251120073MaRDI QIDQ4452896

Edward P. K. Tsang, Christos Voudouris

Publication date: 7 March 2004

Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/0-306-48056-5_7

zbMATH Keywords

Tabu SearchGuided Local SearchMeta-HeuristicsConstraint SatisfactionHeuristic SearchPenalty-based Methods

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (19)

Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization ⋮ Classification of applied methods of combinatorial optimization ⋮ Fast local search and guided local search and their application to British Telecom's workforce scheduling problem ⋮ Optimisation of transportation service network using \(\kappa\)-node large neighbourhood search ⋮ A progressive filtering heuristic for the location-routing problem and variants ⋮ A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem ⋮ From fitness landscapes evolution to automatic local search algorithm generation ⋮ Algorithms for nesting with defects ⋮ Knowledge-guided local search for the vehicle routing problem ⋮ What makes a VRP solution good? The generation of problem-specific knowledge for heuristics ⋮ Efficiently solving very large-scale routing problems ⋮ Towards a practical engineering tool for rostering ⋮ Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art ⋮ Local search for the undirected capacitated arc routing problem with profits ⋮ VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH ⋮ A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization ⋮ A powerful route minimization heuristic for the vehicle routing problem with time windows ⋮ A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows ⋮ Looking ahead with the pilot method

This page was built for publication: Guided Local Search