A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- 1 September 2012
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 39 (9), 2248-2257
- https://doi.org/10.1016/j.cor.2011.11.008
Abstract
No abstract availableThis publication has 33 references indexed in Scilit:
- Metaheuristics for vehicle routing problems with three-dimensional loading constraintsEuropean Journal of Operational Research, 2010
- A unified exact method for solving different classes of vehicle routing problemsMathematical Programming, 2008
- A heuristic for the three-dimensional strip packing problemEuropean Journal of Operational Research, 2007
- An improved typology of cutting and packing problemsEuropean Journal of Operational Research, 2007
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraintsNetworks, 2007
- Recent advances in vehicle routing exact algorithms4OR, 2007
- What you should know about the vehicle routing problemNaval Research Logistics (NRL), 2007
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cutsMathematical Programming, 2007
- Algorithm 864ACM Transactions on Mathematical Software, 2007
- A simple and effective evolutionary algorithm for the vehicle routing problemComputers & Operations Research, 2004