Comparison of metaheuristic approaches for parcel delivery problem Online publication date: Mon, 03-Jun-2024
by Shamine Moganathan; Siti Noor Asyikin Mohd Razali; Nabeel Naeem Hassan Almaalei; Kavikumar Jacob
International Journal of Logistics Systems and Management (IJLSM), Vol. 48, No. 1, 2024
Abstract: Ever since the coronavirus disease-2019 (COVID-19) outbreak, people plump for e-shopping, and it causes the delivery company to receive bulks to be delivered to customers. The complication arises when the delivery man needs to transport parcels to a vast number of houses in a trip. Due to this, they seek the shortest path in the trip to minimise the delivery cost and also the time. Hence, this study aims to scrutinise the shortest path, including runtime because the delivery problem has been categorised as an NP-hard problem. Thus, we proposed two metaheuristic techniques to be compared in this study which are ant-colony optimisation (ACO) and genetic algorithm (GA). In a nutshell, the results show that the GA technique performs better than the ACO technique in terms of distance, price, and runtime for moderate data size, which is less than 50 locations, as there were some enhancements on the methods used.
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 International Journal of Logistics Systems and Management (IJLSM):
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