Heuristic procedure for bi-capacitated multiple-trip vehicle routing problem Online publication date: Thu, 07-Apr-2022
by Tarit Rattanamanee; Suebsak Nanthavanij
European J. of Industrial Engineering (EJIE), Vol. 16, No. 3, 2022
Abstract: The multiple-trip vehicle routing problem with physical workload (MTVRP-WL) or bi-capacitated MTVRP is intended to find an optimal number of delivery trucks and their travel routes to serve a set of customers having constant load demands within a given time limit. Delivery workers who are pre-assigned to trucks must manually unload goods at customer locations. Both trucks and workers are heterogeneous in terms of the load capacity and working energy capacity, respectively. Initially, the random nearest neighbourhood search technique is employed to generate an initial feasible solution. Then, the solution is improved using two local search operators, namely, greedy swap and 2-opt. The improvement algorithms are repeated for a number of iterations until no further improvement is obtained. From a computation experiment, the heuristic procedure is found to be efficient since it can obtain near-optimal MTVRP solutions in reasonable computation time. [Submitted: 5 November 2020; Accepted: 7 April 2021]
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook