Solution approaches for multi-workday vehicle routing problem with manual unloading
by Tarit Rattanamanee; Suebsak Nanthavanij; Aussadavut Dumrongsiri
International Journal of Industrial and Systems Engineering (IJISE), Vol. 39, No. 3, 2021

Abstract: The daily delivery routes and carried loads of vehicles are determined for a multi-workday planning period. Upon arrival at customer locations, workers, who are pre-assigned to vehicles, must perform manual unloading of goods. The multi-workday vehicle routing problem (MW-VRP) with manual unloading is solved using three solution approaches, namely, minimum-distance fixed-route, minimum-distance varying-route and workload-balanced varying-route. The total travel distances of vehicles and average percent residual energies among workers are determined and compared among the three approaches. The results show that the MW-VRP which considers the physical workloads that workers have to endure each workday throughout the planning period can help to distribute daily manual handling tasks more evenly among workers.

Online publication date: Thu, 16-Dec-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com