Abstract
The vehicle routing problem with cross-dock selection is a variant of the vehicle routing problem containing spatial and load synchronization constraints by which products are transferred and processed via at least one cross-dock. This paper presents a mathematical formulation of the problem and an adaptive large neighborhood search heuristic. Computational experiments on a set of benchmark instances demonstrate the efficiency of the proposed methodology.
Original language | English |
---|---|
Pages (from-to) | 254-266 |
Number of pages | 13 |
Journal | Computers and Operations Research |
Volume | 77 |
DOIs | |
Publication status | Published - 1 Jan 2017 |
Keywords
- Adaptive Large Neighborhood Search (ALNS)
- Cross-docking
- Vehicle routing
ASJC Scopus subject areas
- General Computer Science
- Modelling and Simulation
- Management Science and Operations Research