Multi-trip vehicle routing and scheduling problems

Tsung-Sheng Chang*, Sian Da Wang

*此作品的通信作者

研究成果: Conference contribution同行評審

2 引文 斯高帕斯(Scopus)

摘要

This research is inspired by a variety of transportation industries' problem of letting vehicles make more than one trip each day to effectively use their resources. This study defines the problem as the multi-trip vehicle routing and scheduling problem (MTVRSP). The objectives of the MTVRSP are to minimize first the number of vehicles and then the total travel time by allowing vehicles to make multiple trips during a planning period, while satisfying not only the constraints to the basic vehicle routing problem but also delivery time windows. Despite its practical importance, there exist very few the MTVRSP-related studies in the literature. The MTVRSP is NP-hard; therefore, the objectives of this research are to first model the problem and then develop an efficient and effective heuristic solution algorithm to the problem. Empirical testing is used to evaluate the effectiveness of the solution algorithm.

原文English
主出版物標題40th International Conference on Computers and Industrial Engineering
主出版物子標題Soft Computing Techniques for Advanced Manufacturing and Service Systems, CIE40 2010
DOIs
出版狀態Published - 2010
事件40th International Conference on Computers and Industrial Engineering, CIE40 2010 - Awaji, Japan
持續時間: 25 7月 201028 7月 2010

出版系列

名字40th International Conference on Computers and Industrial Engineering: Soft Computing Techniques for Advanced Manufacturing and Service Systems, CIE40 2010

Conference

Conference40th International Conference on Computers and Industrial Engineering, CIE40 2010
國家/地區Japan
城市Awaji
期間25/07/1028/07/10

指紋

深入研究「Multi-trip vehicle routing and scheduling problems」主題。共同形成了獨特的指紋。

引用此