Guided Local Search

DOI10.1007/0-306-48056-5_7MaRDI QIDQ4452896zbMATH OpenOpenAlexFDO

Authors Christos Voudouris, Edward Tsang

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)

Recommendations

• Guided local search joins the elite in discrete optimisation
• Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
• Guided local search and its application to the traveling salesman problem
• Applying an extended guided local search to the quadratic assignment problem
• Guided local search for solving SAT and weighted MAX-SAT problems

Cited in

(27)

• Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
• A progressive filtering heuristic for the location-routing problem and variants
• Applying an extended guided local search to the quadratic assignment problem
• Looking ahead with the pilot method
• A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem
• scientific article; zbMATH DE number 7075933 (Why is no real title available?)
• Mechanisms for local search
• Guided local search as a network planning algorithm that incorporates uncertain traffic demands
• Knowledge-guided local search for the vehicle routing problem
• Optimisation of transportation service network using \(\kappa\)-node large neighbourhood search
• Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization
• Algorithms for nesting with defects
• VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
• Guided local search joins the elite in discrete optimisation
• Classification of applied methods of combinatorial optimization
• Guided local search for solving SAT and weighted MAX-SAT problems
• Towards a practical engineering tool for rostering
• Guided local search for solving SAT and weighted MAX-SAT problems
• A powerful route minimization heuristic for the vehicle routing problem with time windows
• Local search for the undirected capacitated arc routing problem with profits
• Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
• scientific article; zbMATH DE number 6783433 (Why is no real title available?)
• What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
• Efficiently solving very large-scale routing problems
• From fitness landscapes evolution to automatic local search algorithm generation

This page was built for publication: Guided Local Search

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