Abstract
This paper presents a novel solution approach for planning cyclic distribution from a single depot to multiple customers with constant, deterministic demand rates. The objective is to minimize the total cost rate consisting of fleet costs, distribution costs from the depot to the customers and inventory holding costs at the customers. A solution is built in two phases: designing routes and composing the fleet. When designing vehicle routes in the first phase, the route cycle times are chosen such that the distribution and inventory holding costs are minimized. When assigning routes to vehicles in the second phase, the routes remain unchanged, but their cycle times can be adjusted to minimize the required number of vehicles. The building blocks of this two-phase solution approach are embedded in a metaheuristic framework. Computational experiments show that the resulting solution framework outperforms existing solution approaches.
Original language | English |
---|---|
Pages (from-to) | 404-411 |
Number of pages | 8 |
Journal | European Journal of Operational Research |
Volume | 256 |
Issue number | 2 |
Early online date | 11 Jun 2016 |
DOIs | |
Publication status | Published - 16 Jan 2017 |
Keywords
- Cyclic planning
- Delivery scheduling
- Distribution logistics
- Inventory routing
- Periodic routing