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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Industrial and Systems Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
