 Heuristic procedure for bi-capacitated multiple-trip vehicle routing problemTarit Rattanamanee and Suebsak Nanthavanij European Journal of Industrial Engineering, 2022, vol. 16, issue 3, 294-316 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] Keywords: multiple-trip vehicle routing problem; bi-capacitated problem; heuristic algorithm; local search; physical workload; intra-city logistics. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:16:y:2022:i:3:p:294-316 Access Statistics for this article More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.