Guided Local Search
DOI10.1007/0-306-48056-5_7zbMATH Open1102.90385OpenAlexW4251120073MaRDI QIDQ4452896FDOQ4452896
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
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
Tabu SearchGuided Local SearchMeta-HeuristicsConstraint SatisfactionHeuristic SearchPenalty-based Methods
Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (27)
- Guided local search as a network planning algorithm that incorporates uncertain traffic demands
- Knowledge-guided local search for the vehicle routing problem
- Towards a practical engineering tool for rostering
- Guided local search for solving SAT and weighted MAX-SAT problems
- Guided local search for solving SAT and weighted MAX-SAT problems
- What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
- Efficiently solving very large-scale routing problems
- Title not available (Why is that?)
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
- Mechanisms for local search
- Local search for the undirected capacitated arc routing problem with profits
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization
- A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem
- Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization
- Optimisation of transportation service network using \(\kappa\)-node large neighbourhood search
- Algorithms for nesting with defects
- A powerful route minimization heuristic for the vehicle routing problem with time windows
- Title not available (Why is that?)
- A progressive filtering heuristic for the location-routing problem and variants
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
- Classification of applied methods of combinatorial optimization
- From fitness landscapes evolution to automatic local search algorithm generation
- Looking ahead with the pilot method
- Guided local search joins the elite in discrete optimisation
- Applying an extended guided local search to the quadratic assignment problem
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)
