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)- Knowledge-guided local search for the vehicle routing problem
- Guided local search as a network planning algorithm that incorporates uncertain traffic demands
- 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
- scientific article; zbMATH DE number 7075933 (Why is no real title available?)
- 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
- Optimisation of transportation service network using \(\kappa\)-node large neighbourhood search
- Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization
- A vertex weighting-based double-tabu search algorithm for the classical p-center problem
- Algorithms for nesting with defects
- A powerful route minimization heuristic for the vehicle routing problem with time windows
- A progressive filtering heuristic for the location-routing problem and variants
- scientific article; zbMATH DE number 6783433 (Why is no real title available?)
- 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)
