Metaheuristics for the capacitated VRP
The vehicle routing problem
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
D-Ants: savings based ants divide and conquer the vehicle routing problem
Computers and Operations Research
Solving the vehicle routing problem with adaptive memory programming methodology
Computers and Operations Research
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
Computers and Operations Research
Path relinking for the vehicle routing problem
Journal of Heuristics
Creating very large scale neighborhoods out of smaller ones by compounding moves
Journal of Heuristics
A simple filter-and-fan approach to the facility location problem
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Multi-criterion tabu programming for pareto-optimal task assignment in distributed computer systems
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
A new hybrid ant colony optimization algorithm for the vehicle routing problem
Pattern Recognition Letters
Some numerical experiments on multi-criterion tabu programming for finding Pareto-optimal solutions
WSEAS TRANSACTIONS on SYSTEMS
Stable solving of CVRPs using hyperheuristics
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem
Expert Systems with Applications: An International Journal
A hybrid particle swarm optimization algorithm for the vehicle routing problem
Engineering Applications of Artificial Intelligence
Computers and Operations Research
An evolutionary approach to the multidepot capacitated arc routing problem
IEEE Transactions on Evolutionary Computation
Fast ejection chain algorithms for vehicle routing with time windows
HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
Multiple Phase Neighborhood Search-GRASP for the Capacitated Vehicle Routing Problem
Expert Systems with Applications: An International Journal
Applying a hybrid ant colony system to the vehicle routing problem
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
A Flexible and Adaptive Hyper-heuristic Approach for (Dynamic) Capacitated Vehicle Routing Problems
Fundamenta Informaticae - Emergent Computing
A Time Predefined Variable Depth Search for Nurse Rostering
INFORMS Journal on Computing
Hi-index | 0.01 |
Generically, ejection chains are methods conceived to allow solution transformations to be efficiently carried out by modifying a variable number of their components at each step of a local search algorithm. We consider a subpath ejection chain method for the vehicle routing problem (VRP) under capacity and route length restrictions. The method undertakes the identification of a substructure named the flower reference structure which, besides coordinating moves during an ejection chain construction, allows the creation of neighborhood structures with interesting combinatorial characteristics. Specifically, we base the method on a fundamental property of creating alternating paths and cycles during an ejection chain construction. A new algorithm based on a Tabu search framework is proposed, and computational results on a set of academic and real-world problems indicate that the algorithm may be a good alternative to the best heuristic algorithms for the VRP.