Skip to main content
SpringerLink
Log in

Solving the time-dependent multi-trip vehicle routing problem with time windows and an improved travel speed model by a hybrid solution algorithm

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

In this study, we explore a time-dependent multi-trip vehicle routing problem (TDMTVRP) with an improved travel speed model. This problem is set in a scenario that (a) a set of customers with fixed demands and service time windows have to be served in a sequence of service trips which originate and terminate at a distribution centre, (b) the service trips will be assigned to a fleet of vehicles with fixed capacities and maximum allowable working durations each day, (c) each vehicle can perform more than one service trip, and (d) the link travel times varies with vehicle travel speeds which results from congestion effects during different time of day in urban areas. The aim of the TDMTVRP model is to find an optimal strategy to minimize the vehicle utilized times and their total scheduling time. A continuous piecewise linear function is first introduced to represent the variation and transition of vehicle travel speeds with the time of the day instead of the traditional staircase travel speed function. Then a hybrid solution algorithm is developed by using the nearest-neighbour heuristic to obtain an initial solution and Tabu search heuristic to search the optimal solution. Finally, an experimental case study is used to verify the feasibility of the proposed model and algorithm. The experimental results indicate that compared with the CVRPTW (capacitated vehicle routing problem with time windows) model, the TDMTVRP model proposed in this study can both decrease the vehicle utilized times dramatically and shorten the vehicle travel distances slightly in dealing with the vehicle routing problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Crevier, B., Cordeau, J.F., Laporte, G.: The multi-depot vehicle routing problem with inter-depot routes. Eur. J. Oper. Res. 176(2), 756–773 (2007)

    Article  MathSciNet  Google Scholar 

  2. Taillard, É.D., Laporte, G., Gendreau, M.: Vehicle routeing with multiple use of vehicles. J. Oper. Res. Soc. 47(8), 1065–1070 (1996)

    Article  Google Scholar 

  3. Ichoua, S., Gendreau, M., Potvin, J.Y.: Vehicle dispatching with time-dependent travel times. Eur. J. Oper. Res. 144(2), 379–396 (2003)

    Article  Google Scholar 

  4. Donati, A.V., Montemanni, R., Casagrande, N., et al.: Time dependent vehicle routing problem with a multi ant colony system. Eur. J. Oper. Res. 185(3), 1174–1191 (2008)

    Article  MathSciNet  Google Scholar 

  5. Salhi, S., Petch, R.J.: A GA based heuristic for the vehicle routing problem with multiple trips. J. Math. Model. Algorithms 6(4), 591–613 (2007)

    Article  MathSciNet  Google Scholar 

  6. Baldacci, R., Christofides, N., Mingozzi, A.: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Program 115(2), 351–385 (2008)

    Article  MathSciNet  Google Scholar 

  7. Baldacci, R., Mingozzi, A., Roberti, R.: New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5), 1269–1283 (2011)

    Article  MathSciNet  Google Scholar 

  8. Liu, S., Huang, W., Ma, H.: An effective genetic algorithm for the fleet size and mix vehicle routing problems. Transp. Res. Part E 45(3), 434–445 (2009)

    Article  Google Scholar 

  9. Chen, X., Li, J.: Enhanced vehicle routing algorithm with time windows based on heuristic algorithm. J. Comput. Inf. Syst. 7(11), 3886–3892 (2011)

    Google Scholar 

  10. Tavakkoli-Moghaddam, R., Gazanfari, M., Alinaghian, M., et al.: A new mathematical model for a competitive vehicle routing problem with time windows solved by simulated annealing. J. Manuf. Syst. 30(2), 83–92 (2011)

    Article  Google Scholar 

  11. Garcia-Najera, A., Bullinaria, J.A.: An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 38(1), 287–300 (2011)

    Article  MathSciNet  Google Scholar 

  12. Gan, X., Wang, Y., Li, S., et al.: Vehicle routing problem with time windows and simultaneous delivery and pick-up service based on MCPSO. Math. Prob. Eng. (2012). https://doi.org/10.1155/2012/104279

    Article  MathSciNet  MATH  Google Scholar 

  13. Pop, P.C., Kara, I., Marc, A.H.: New mathematical models of the generalized vehicle routing problem and extensions. Appl. Math. Model. 36(1), 97–107 (2012)

    Article  MathSciNet  Google Scholar 

  14. Li, H., Lu, Y., Zhang, J., et al.: Solving the tractor and semi-trailer routing problem based on a heuristic approach. Math. Prob. Eng. (2012). https://doi.org/10.1155/2012/182584

    Article  MathSciNet  MATH  Google Scholar 

  15. Moon, I.K., Lee, J.H., Seong, J.: Vehicle routing problem with time windows considering overtime and outsourcing vehicles. Expert Syst. Appl. 39(18), 13202–13213 (2012)

    Article  Google Scholar 

  16. Zhang, J., Wang, W., Zhao, Y., et al.: Multiobjective quantum evolutionary algorithm for the vehicle routing problem with customer satisfaction. Math. Prob. Eng. (2012). https://doi.org/10.1155/2012/879614

    Article  MathSciNet  MATH  Google Scholar 

  17. Lang, M., Wang, Y., Zhou, X.: A two-stage algorithm for a dynamic multi-trip vehicle scheduling problem. WASE Int. Conf. Inf. Eng. 2010, 188–191 (2010)

    Google Scholar 

Download references

Acknowledgements

This study was supported by the Shandong Provincial Natural Science Foundation of China under Grant No. ZR2017BG010, the Shandong Provincial Social Science Planning of China under Grant No. 16DGLJ06, and the Shandong Provincial Higher Educational Science and Technology Program of China under Grant No. J17KA189. The authors would also like to thank Dr. Cyril B. Lucas from the United Kingdom, author of the book Atomic and Molecular Beams: Production and Collimation, for helping us edit and polish the language of this paper.

Author information

Authors and Affiliations

  1. School of Management Science and Engineering, Shandong University of Finance and Economics, Jinan, 250014, China

    Yan Sun

  2. Transportation and Economics Research Institute, China Academy of Railway Sciences, Beijing, 100081, China

    Danzhu Wang

  3. School of Traffic and Transportation, Beijing Jiaotong University, Beijing, 100044, China

    Maoxiang Lang

  4. School of Sustainable Engineering and the Built Environment, Arizona State University, Tempe, AZ, 85281, USA

    Xuesong Zhou

Authors
  1. Yan Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Danzhu Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maoxiang Lang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xuesong Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maoxiang Lang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sun, Y., Wang, D., Lang, M. et al. Solving the time-dependent multi-trip vehicle routing problem with time windows and an improved travel speed model by a hybrid solution algorithm. Cluster Comput 22 (Suppl 6), 15459–15470 (2019). https://doi.org/10.1007/s10586-018-2637-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-018-2637-6

Keywords

Search

Navigation