Metaheuristics for the vehicle routing problem with loading constraints
- 12 March 2007
- Vol. 49 (4), 294-307
- https://doi.org/10.1002/net.20179
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing ProblemMathematical Programming, 2005
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow FormulationOperations Research, 2004
- A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling ProblemsJournal of Combinatorial Optimization, 2004
- A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing ProblemJournal of Heuristics, 2004
- New heuristics for one-dimensional bin-packingComputers & Operations Research, 2002
- A tabu search heuristic for periodic and multi-depot vehicle routing problemsNetworks, 1997
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- Optimal Scheduling of Tasks on Identical Parallel ProcessorsINFORMS Journal on Computing, 1995
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964
- A Method for Solving Traveling-Salesman ProblemsOperations Research, 1958