Cyclic scheduling of multiple tours with multiple frequencies for a single vehicle

Birger Raa*, El Houssaine Aghezzaf, Wout Dullaert

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

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 languageEnglish
Pages (from-to)214-227
Number of pages14
JournalInternational Journal of Logistics Systems and Management
Volume5
Issue number3-4
DOIs
Publication statusPublished - 2009

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