SCHEDULING PERIODIC DELIVERIES TO MINIMIZE THE NUMBER OF VEHICLES

摘要：

Production harmonization requires coordination between production and deliveries. In this paper we address the problem of minimizing the number of vehicles needed to make periodic deliveries. It is assumed in the problem that each delivery takes one vehicle for a whole day. We present a mathematical formulation of the problem, propose a Path Relinking metaheuristic to solve it and demonstrate the effectiveness of our solution method through a computational study. We also discuss the relationship between periodic deliveries and just-in-time manufacturing, and their importance in lean supply chains.

关键词： Periodic deliveries vehicle minimization NP-Hard heuristics Path Relinking.

作者: M. Yavuz

作者单位: Harry F. Byrd, Jr. School of Business, Shenandoah University, Winchester, Virginia, U.S.A.

会议类型: 国际会议

会议名称: 第二十届国际生产研究大会

会议地点: 上海

会议语种:英文

页码: 1-4

在线出版日期: 2009-08-02（万方平台首次上网日期，不代表论文的发表时间）