Cyclic scheduling of multiple tours with multiple frequencies for a single vehicle
暂无分享,去创建一个
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.
[1] Kamlesh Mathur,et al. Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems , 1997 .
[2] El-Houssaine Aghezzaf,et al. Designing distribution patterns for long-term inventory routing with constant demand rates , 2008 .
[3] Hendrik Van Landeghem,et al. Modeling inventory routing problems in supply chains of high consumption products , 2006, Eur. J. Oper. Res..