Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Journal of Computational Physics
Parallel savings based heuristics for the delivery problem
Operations Research
Solving airline crew scheduling problems by branch-and-cut
Management Science
Journal of Computational Physics
Cyclic transfer algorithms for multivehicle routing and scheduling problems
Operations Research
A tabu search heuristic for the vehicle routing problem
Management Science
Computers and Operations Research
The vehicle routing problem
Branch-and-bound algorithms for the capacitated VRP
The vehicle routing problem
Branch-and-cut algorithms for the capacitated VRP
The vehicle routing problem
Classical heuristics for the capacitated VRP
The vehicle routing problem
Metaheuristics for the capacitated VRP
The vehicle routing problem
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
INFORMS Journal on Computing
D-Ants: savings based ants divide and conquer the vehicle routing problem
Computers and Operations Research
A new branch-and-cut algorithm for the capacitated vehicle routing problem
Mathematical Programming: Series A and B
Very large-scale vehicle routing: new test problems, algorithms, and results
Computers and Operations Research
Solving the vehicle routing problem with adaptive memory programming methodology
Computers and Operations Research
Creating very large scale neighborhoods out of smaller ones by compounding moves
Journal of Heuristics
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Mathematical Programming: Series A and B
A general heuristic for vehicle routing problems
Computers and Operations Research
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Computers and Operations Research
Active-guided evolution strategies for large-scale capacitated vehicle routing problems
Computers and Operations Research
Active guided evolution strategies for large-scale vehicle routing problems with time windows
Computers and Operations Research
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Mathematical Programming: Series A and B
Edge assembly crossover for the capacitated vehicle routing problem
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Heuristic and exact algorithms for a min-max selective vehicle routing problem
Computers and Operations Research
Survey: matheuristics for rich vehicle routing problems
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Fleet estimation for defence logistics using a multi-objective learning classifier system
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Solving variants of the vehicle routing problem with a simple parallel iterated Tabu search
INOC'11 Proceedings of the 5th international conference on Network optimization
Optimal path planning for surveillance with temporal-logic constraints*
International Journal of Robotics Research
A parallel iterated tabu search heuristic for vehicle routing problems
Computers and Operations Research
A study on the effect of the asymmetry on real capacitated vehicle routing problems
Computers and Operations Research
Research on vehicle routing problem with stochastic demand based on multi-objective method
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
The inventory-routing problem with transshipment
Computers and Operations Research
The vehicle routing problem with backhauls: a multi-objective evolutionary approach
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
Operations Research
The Pallet-Packing Vehicle Routing Problem
Transportation Science
An event-driven optimization framework for dynamic vehicle routing
Decision Support Systems
The Pickup and Delivery Problem with Cross-Docking
Computers and Operations Research
Approximation Algorithms for Capacitated Location Routing
Transportation Science
A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem
Transportation Science
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
A cooperative parallel metaheuristic for the capacitated vehicle routing problem
Computers and Operations Research
International Journal of Robotics Research
A sequential GRASP for the therapist routing and scheduling problem
Journal of Scheduling
Optimal joint replenishment, delivery and inventory management policies for perishable products
Computers and Operations Research
| Hi-index | 0.00 |
The Vehicle Routing Problem (VRP) was introduced 50 years ago by Dantzig and Ramser under the title “The Truck Dispatching Problem.” The study of the VRP has given rise to major developments in the fields of exact algorithms and heuristics. In particular, highly sophisticated exact mathematical programming decomposition algorithms and powerful metaheuristics for the VRP have been put forward in recent years. The purpose of this article is to provide a brief account of this development.