Multiple-Trip Vehicle Routing with Physical Workload

  • Tarit Rattanamanee
  • Suebsak Nanthavanij


This paper addresses the vehicle routing problem in which delivery vehicles can perform several trips within one workday. Initially, a mathematical model of the multiple-trip vehicle routing problem (MTVRP) is formulated. Its objective is to minimize a total cost that consists of the costs of vehicles, workforce, and transportation. The MTVRP assumes that vehicles and workers are heterogeneous, customer locations and demands are known, all vehicles must complete their trips within one workday, delivery workers are pre-assigned to vehicles, and all loads are unloaded from vehicles manually. For safety, a total physical workload endured by any worker must not exceed his/her working physical capacity. A numerical example is presented. The MTVRP solutions are determined using the ILOG CPLEX. The result shows that by allowing the vehicles to make several trips, the total cost can be reduced, and both vehicles and workers are better utilized. However, workers are required to work harder due to their longer working times.


Multiple-trip vehicle routing problem Optimization Logistics management Manual unloading Physical workload 


  1. 1.
    Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6, 80–91.CrossRefGoogle Scholar
  2. 2.
    Laporte, G., Gendreau, M., Potvin, J. Y., & Semet, F. (2000). Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research, 7, 285–300.CrossRefGoogle Scholar
  3. 3.
    Toth, P., & Vigo, D. (2002). SIAM Monographs on Discrete Mathematics and Applications. The vehicle routing problem. Philadelphia, PA.Google Scholar
  4. 4.
    Min, H. (1989). The multiple vehicle routing problem with simultaneous delivery and pickup. Transportation Research Part A: Policy and Practice, 23, 377–386.CrossRefGoogle Scholar
  5. 5.
    Tasan, A. S., & Gen, M. (2012). A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Computer and Industrial Engineering, 62, 755–761.CrossRefGoogle Scholar
  6. 6.
    El-Sherbeny, N. A. (2010). Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods. Journal of King Saud University Science, 22, 123–131.CrossRefGoogle Scholar
  7. 7.
    Hashimoto, H., Ibaraki, T., Imahori, S., & Yagiura, M. (2006). The vehicle routing problem with flexible time windows and traveling times. Discrete Applied Mathematics, 154, 2271–2290.CrossRefGoogle Scholar
  8. 8.
    Jiang, J., Ng, K. M., Poh, K. L., & Teo, K. M. (2014). Vehicle routing problem with a heterogeneous fleet and time windows. Expert Systems with Applications, 41(8), 3748–3760.CrossRefGoogle Scholar
  9. 9.
    Asawarungsaengkul, K., Rattanamanee, T., & Wuttipornpun, T. (2013). A multi-size compartment vehicle routing problem for multi-product distribution: Models and solution procedures. International Journal of Artificial Intelligence, 11(13A), 237–256.Google Scholar
  10. 10.
    Braekers, K., Ramaekers, K., & Nieuwenhuyse, I. V. (2016). The vehicle routing problem: State of the art classification and review. Computer and Industrial Engineering, 99, 300–313.CrossRefGoogle Scholar
  11. 11.
    Taillard, E. D., Laporte, G., & Gendreau, M. (1996). Vehicle routing with multiple use of vehicles. European Journal of Operational Research, 47, 1065–1070.CrossRefGoogle Scholar
  12. 12.
    Brandão, J., & Mercer, A. (1997). A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. European Journal of Operational Research, 100, 180–191.CrossRefGoogle Scholar
  13. 13.
    Olivera, A., & Viera, O. (2007). Adaptive memory programming for the vehicle routing problem with multiple trips. Computers & Operations Research, 34, 28–47.CrossRefGoogle Scholar
  14. 14.
    Campbell, A. M., & Savelsbergh, M. (2004). Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Science, 38, 369–378.CrossRefGoogle Scholar
  15. 15.
    Azi, N., Gendreau, M., & Potvin, J. V. (2007). An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. European Journal of Operational Research, 178, 755–766.CrossRefGoogle Scholar
  16. 16.
    Azi, N., Gendreau, M., & Potvin, J. V. (2010). An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. European Journal of Operational Research, 202, 756–763.CrossRefGoogle Scholar
  17. 17.
    Wassan, N., Wassan, N., Nagy, G., & Salhi, S. (2017). The multiple trip vehicle routing problem with backhauls: Formulation and a two-level variable neighbourhood search. Computers & Operations Research, 78, 454–467.CrossRefGoogle Scholar
  18. 18.
    Nanthavanij, S., & Chalidabhongse, J. (2007). Ergonomic scheduling of delivery crew for the vehicle routing problem with manual materials handling. In Proceedings of the 2nd International Conference on Operations and Supply Chain Management, CD-ROM.Google Scholar
  19. 19.
    Nanthavanij, S., Boonprasurt, P., Jaruphongsa, W., & Ammarapala, V. (2008). Vehicle routing problem with manual materials handling: Flexible Delivery crew—vehicle assignments. In Proceedings of the 9th Asia Pacific Industrial Engineering and Management Systems Conference, CD-ROM.Google Scholar
  20. 20.
    Asawarungsaengkul, K., & Nanthavanij, S. (2010). Optimal truck routing design for garbage collection with cost and physical workload consideration. In Proceedings of the 11th Asia Pacific Industrial Engineering & Management Systems Conference, CD-ROM.Google Scholar
  21. 21.
    Boonprasurt, P., & Nanthavanij, S. (2012). Optimal fleet size, delivery routes, and workforce assignments for the vehicle routing problem with manual materials handling. International Journal of Industrial Engineering—Theory, Applications and Practice, 19(6), 252–263.Google Scholar
  22. 22.
    Kroemer, K., Kroemer, H., & Kroemer-Elbert, K. (2001). Ergonomics: How to design for ease and efficiency (2nd ed.). Englewood Cliffs, NJ: Prentice Hall.Google Scholar
  23. 23.
    Astrand, I. (1960). Aerobic work capacity in men and women with special reference to age. Acta Physiologica Scandinavica, 49, 169.Google Scholar
  24. 24.
    Astrand, P. O., & Rodahl, K. (1986). Textbook of work physiology: Physiological bases of exercise (3rd ed.). New York: McGraw-Hill.Google Scholar
  25. 25.
    Rodahl, K. (1989). The physiology of work. London: Taylor and Francis.Google Scholar
  26. 26.
    American College of Sports. (1991). Medicine guidelines for exercise testing and prescription. London: Lea and Febiger.Google Scholar
  27. 27.
    Sigconolfi, S. F., Garber, C. E., Lasater, T. M., & Carleton, R. A. (1985). A simple valid step test for estimating maximal oxygen uptake in epidemiologic studies. American Journal of Epidemiology, 14, 209–223.Google Scholar
  28. 28.
    Tayyari, F. (1995). Estimation of maximum oxygen uptake: a convenient method for industry. In A. C. Bittner & P. C. Champney (Eds.), Advances in industrial ergonomics and safety (Vol. VII, pp. 169–172). London: Taylor and Francis.Google Scholar
  29. 29.
    Tayyari, F., & Smith, J. L. (1997). Occupational ergonomics: Principles and applications. London: Chapman and Hall.Google Scholar
  30. 30.
    Metabolic Solution, Inc. (2002).
  31. 31.
    National Institute for Occupational Safety and Health. (1981). Work practices guide for the design of manual handling task. Washington, DC.Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Department of Materials Handling and Logistics Engineering, Faculty of EngineeringKing Mongkut’s University of Technology North BangkokBangkokThailand
  2. 2.School of Management TechnologySirindhorn International Institute of Technology, Thammasat UniversityPathum ThaniThailand

Personalised recommendations