TY - JOUR
T1 - Cyclic scheduling of multiple tours with multiple frequencies for a single vehicle
AU - Raa, Birger
AU - Aghezzaf, El Houssaine
AU - Dullaert, Wout
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
KW - Cyclic planning
KW - Multi-frequency multi-tours
KW - Scheduling
UR - http://www.scopus.com/inward/record.url?scp=58549111234&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=58549111234&partnerID=8YFLogxK
U2 - 10.1504/IJLSM.2009.022496
DO - 10.1504/IJLSM.2009.022496
M3 - Article
AN - SCOPUS:58549111234
SN - 1742-7967
VL - 5
SP - 214
EP - 227
JO - International Journal of Logistics Systems and Management
JF - International Journal of Logistics Systems and Management
IS - 3-4
ER -