Multi-trip vehicle routing and scheduling problems

Tsung-Sheng Chang*, Sian Da Wang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication40th International Conference on Computers and Industrial Engineering
Subtitle of host publicationSoft Computing Techniques for Advanced Manufacturing and Service Systems, CIE40 2010
DOIs
StatePublished - 1 Dec 2010
Event40th International Conference on Computers and Industrial Engineering, CIE40 2010 - Awaji, Japan
Duration: 25 Jul 201028 Jul 2010

Publication series

Name40th 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
CountryJapan
CityAwaji
Period25/07/1028/07/10

Keywords

  • Multiple trips
  • Time windows
  • Vehicle routing problems

Fingerprint Dive into the research topics of 'Multi-trip vehicle routing and scheduling problems'. Together they form a unique fingerprint.

  • Cite this

    Chang, T-S., & Wang, S. D. (2010). Multi-trip vehicle routing and scheduling problems. In 40th International Conference on Computers and Industrial Engineering: Soft Computing Techniques for Advanced Manufacturing and Service Systems, CIE40 2010 [5668326] (40th International Conference on Computers and Industrial Engineering: Soft Computing Techniques for Advanced Manufacturing and Service Systems, CIE40 2010). https://doi.org/10.1109/ICCIE.2010.5668326