Solving the vehicle routing problem with multi-compartment vehicles for city logistics

Eshtehadi, Reza, Demir, Emrah ORCID: https://orcid.org/0000-0002-4726-2556 and Huang, Yuan ORCID: https://orcid.org/0000-0002-9994-4233 2020. Solving the vehicle routing problem with multi-compartment vehicles for city logistics. Computers and Operations Research 115 , 104859. 10.1016/j.cor.2019.104859

PDF - Accepted Post-Print Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (223kB)

Abstract

Logistics companies are under increasing pressure to overcome operational challenges and sustain profitable growth while dealing with the newest requirements of their customers. One of the remedies designed to cope with a higher number of shipments is to use multi-compartment city vans to ensure all forms of integration with deliveries. In the area of city logistics, the most common type of delivery involves storing inventory in a central warehouse and to deliver customers’ orders with multi-compartment vehicles. The problem under study is denoted as the vehicle routing problem with multi-compartment vehicles which are to operate from a single depot to visit customers within the chosen time period by minimizing major operational costs. We propose an enhanced adaptive large neighborhood search algorithm for the investigated routing problem. The computational results highlight the efficiency of the proposed algorithm in terms of both solution quality and solution time and also provide useful insights for city logistics.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Business (Including Economics)
Publisher:	Elsevier
ISSN:	0305-0548
Date of First Compliant Deposit:	4 December 2019
Date of Acceptance:	4 December 2019
Last Modified:	17 Nov 2024 19:00
URI:	https://orca.cardiff.ac.uk/id/eprint/127320

Citation Data

Cited 30 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item