Efficient clustering-based constructive heuristics for capacitated vehicle routing

Ankan Bose and Dipak Laha

International Journal of Mathematics in Operational Research, 2024, vol. 27, issue 4, 458-478

Abstract: In this paper, we address the capacitated vehicle routing problem, a generalised variant of vehicle routing problems, in which the routes are assigned to a fleet of vehicles to serve customers meeting their demands in order to optimise certain criterion. Here, we aim to minimise total length of the routes. Although a plethora of research on vehicle routing appeared in the literature over many decades, a few good construction heuristics exist, namely, the heuristics of Clark and Wright (1964), Segerstedt (2014, 2018), which are used for minimising the total length of routes in the capacitated vehicle routing problem. In this paper, we have modified the heuristics of Segerstedt (2014, 2018) using K-means++ clustering in conjunction with a route merging procedure to enhance the solution quality for this problem. The computational results reveal that the modified approaches significantly improve their performance while not affecting their time-complexity.

Keywords: vehicle routing; K-means clustering; K-means++ clustering; heuristics; optimisation. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=138465 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:27:y:2024:i:4:p:458-478

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().