HEURISTIC PROCEDURE FOR MULTI-WORKDAY VEHICLE ROUTING PROBLEM WITH PRE-ASSIGNED WORKERS AND MANUAL UNLOADING

Authors

  • Tarit Rattanamanee King Mongkut’s University of Technology North Bangkok
  • Suebsak Nanthavanij Thammasat University
  • Aussadavut Dumrongsiri Thammasat University

DOI:

https://doi.org/10.23055/ijietap.2020.27.3.6207

Keywords:

Heuristic procedure, physical workload, vehicle routing problem, multi-workday delivery period

Abstract

This paper deals with the multi-workday vehicle routing problem (MW-VRP) where delivery workers are pre-assigned to vehicles. At customer locations, workers must manually unload goods from vehicles. For each worker, the daily accumulated physical workload depends on the number of customers served by the vehicle and load demands at those customers. The MW-VRP is intended to determine daily delivery routes for a given set of vehicles over the multi-workday delivery period such that the maximum average percent residual energy (PRE) among all workers is minimized. A heuristic procedure is developed to firstly determine delivery routes for vehicles. Next, a greedy exchange algorithm is used to decrease the maximum average PRE among workers and total travel distance of vehicles. The results from the given numerical example show that the heuristic procedure is able to generate the routing solution with the same maximum average PRE as that from the optimal solution, but with a slightly greater total travel distance (11.57%).

Author Biographies

Tarit Rattanamanee, King Mongkut’s University of Technology North Bangkok

Tarit Rattamanee is a lecturer of Logistics Engineering, Faculty of Engineering, King Mongkut’s University of Technology North Bangkok, Thailand. He received his Ph.D. in engineering and technology from Sirindhorn International Institute of Technology, Thammasat University, Thailand. He received his B.Eng. and M.S. in industrial engineering from King Mongkut’s University of Technology North Bangkok, Thailand. His current research areas are vehicle routing problem and workforce scheduling.

Suebsak Nanthavanij, Thammasat University

Suebsak Nanthavanij is an associate professor of engineering management at School of Management Technology, Sirindhorn International Institute of Technology, Thammasat University, Thailand. He received his Ph.D. in industrial engineering from the University of Texas at Arlington, USA. His research interests include industrial ergonomics, workforce scheduling, and vehicle routing problem.

Aussadavut Dumrongsiri, Thammasat University

Aussadavut Dumrongsiri is an associate professor of engineering management at School of Management Technology, Sirindhorn International Institute of Technology, Thammasat University, Thailand. He received his Ph.D. in operations management from the University of Washington, Seattle, USA. His research interests include supply chain management, inventory management, and vehicle routing problem.

Published

2020-12-19

How to Cite

Rattanamanee, T., Nanthavanij, S., & Dumrongsiri, A. (2020). HEURISTIC PROCEDURE FOR MULTI-WORKDAY VEHICLE ROUTING PROBLEM WITH PRE-ASSIGNED WORKERS AND MANUAL UNLOADING. International Journal of Industrial Engineering: Theory, Applications and Practice, 27(3). https://doi.org/10.23055/ijietap.2020.27.3.6207

Issue

Section

Logistics and Material Handling

Most read articles by the same author(s)