Solution approaches for multi-workday vehicle routing problem with manual unloading

Tarit Rattanamanee, Suebsak Nanthavanij and Aussadavut Dumrongsiri

International Journal of Industrial and Systems Engineering, 2021, vol. 39, issue 3, 340-360

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.

Keywords: vehicle routing problem; VRP; multi-workday planning; physical workload balancing; worker-vehicle pre-assignment. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=119697 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:39:y:2021:i:3:p:340-360

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().