Creating very large scale neighborhoods out of smaller ones by compounding moves
From MaRDI portal
Publication:2491337
Recommendations
- A survey of very large-scale neighborhood search techniques
- Variable neighborhood search
- Constraint-based very large-scale neighborhood search
- VLSN search algorithms for partitioning problems using matching neighbourhoods
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Cites work
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- A subpath ejection method for the vehicle routing problem
- A survey of very large-scale neighborhood search techniques
- A Tabu Search Heuristic for the Vehicle Routing Problem
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 3950398 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 1054962 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1082107 (Why is no real title available?)
- scientific article; zbMATH DE number 1452993 (Why is no real title available?)
- scientific article; zbMATH DE number 956786 (Why is no real title available?)
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
- Network flows. Theory, algorithms, and applications.
- On the capacitated vehicle routing problem
- Parallel iterative search methods for vehicle routing problems
- Probabilistic diversification and intensification in local search for vehicle routing
- Routing problems: A bibliography
- The granular tabu search and its application to the vehicle-routing problem
- The vehicle routing problem
Cited in
(18)- Knowledge-guided local search for the vehicle routing problem
- Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
- The close-open mixed vehicle routing problem
- More neighbors, more efficiency
- Finding the maximum multi improvement on neighborhood exploration
- Path relinking for the vehicle routing problem
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands
- An investigation on compound neighborhoods for VRPTW
- VLSN search algorithms for partitioning problems using matching neighbourhoods
- Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems
- Matching based very large-scale neighborhoods for parallel machine scheduling
- Constraint-based very large-scale neighborhood search
- DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
- Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems
- Contemporary approaches in matheuristics an updated survey
- A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
This page was built for publication: Creating very large scale neighborhoods out of smaller ones by compounding moves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491337)
