Citation

Lim, Adrain Jun Hong and Wee, Yit Yin (2025) A Meta-heuristic Method for Cumulative Vehicle Routing Problem. In: 8th 2025 International Conference on New Media Studies, CONMEDIA 2025, 14 October 2025 - 17 October 2025, Malacca, Malaysia.

Text IEEE Xplore Full-Text PDF_4.pdf - Published Version Restricted to Repository staff only Download (1MB)

Abstract

Vehicle routing problems (VRPs) have long been a key area of research in logistics, but their relevance has grown considerably in the post-COVID-19 era due to the increasing demand for efficient and cost-effective delivery services. Among the various extensions of the classical capacitated VRP, the Cumulative Vehicle Routing Problem (Cum-VRP) introduces cumulative constraints that substantially increase the problem’s complexity. Tackling such challenges necessitates advanced optimisation methods capable of producing high-quality solutions within practical computational times. Although heuristic techniques are frequently employed, they often become impractical for large-scale instances. In this study, the Artificial Bee Colony (ABC) algorithm is enhanced through the incorporation of local search strategies and neighbourhood operators to address the Cum-VRP effectively. Comparative experiments against the Variable Neighbourhood Search (VNS) algorithm demonstrate the superiority of the proposed ABC approach, delivering improvements in solution quality, computational efficiency, and feasibility.

Item Type:	Conference or Workshop Item (Paper)
Uncontrolled Keywords:	Cumulative vehicle routing problem, metaheuristic method, artificial Bee Colony,
Subjects:	Q Science > QA Mathematics > QA71-90 Instruments and machines
Divisions:	Faculty of Computing and Informatics (FCI)
Depositing User:	Ms Rosnani Abd Wahab
Date Deposited:	20 Apr 2026 02:03
Last Modified:	20 Apr 2026 02:03
URII:	http://shdl.mmu.edu.my/id/eprint/15749

Downloads

Edit (login required)