Abstract
This paper discusses a cyclic scheduling problem arising in cyclic inventory routing, in which a single vehicle has to make multiple tours with different frequencies. The objective is to find a minimal makespan schedule in which • the vehicle never travels more than 8 hours per day • all tours are repeated with constant intervals. A mathematical model and a best-fit insertion heuristic are presented for this problem. Computational experiments show that the heuristic finds the optimal solution for 79 out of 100 randomly generated test instances.
| Original language | English |
|---|---|
| Pages (from-to) | 214-227 |
| Number of pages | 14 |
| Journal | International Journal of Logistics Systems and Management |
| Volume | 5 |
| Issue number | 3-4 |
| DOIs | |
| Publication status | Published - 2009 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 7 Affordable and Clean Energy
Keywords
- Cyclic planning
- Multi-frequency multi-tours
- Scheduling
Fingerprint
Dive into the research topics of 'Cyclic scheduling of multiple tours with multiple frequencies for a single vehicle'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver