Cyclic scheduling of multiple tours with multiple frequencies for a single vehicle Online publication date: Sat, 10-Jan-2009
by Birger Raa, El-Houssaine Aghezzaf, Wout Dullaert
International Journal of Logistics Systems and Management (IJLSM), Vol. 5, No. 3/4, 2009
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 [and] 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.
Online publication date: Sat, 10-Jan-2009
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Logistics Systems and Management (IJLSM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org