Clustering-Based Intelligent Route Optimization Algorithm for Capacitated Vehicle Routing Problem

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Islam Md. Rafsan; Rahman Md. Azizur; Nazib Kazi Mohammad; Ali Lasker Ershad

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: International Journal of Industrial Engineering & Production Research Year:2025 | Volume:36 | Issue:3 Page(s): 169-185

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Clustering-Based Intelligent Route Optimization Algorithm for Capacitated Vehicle Routing Problem

Author(s)

Islam Md. Rafsan | Rahman Md. Azizur | Nazib Kazi Mohammad | Ali Lasker Ershad | Issue Writer Certificate

Keywords

Combinatorial Optimization

Capacitated Vehicle Routing Problem

Two-phase Algorithm

Clustering Algorithm

Simulated Annealing Algorithm

Abstract

The Capacitated Vehicle Routing Problem (CVRP) is a significant variant of the vehicle routing problem that incorporates constraints related to customer demand and vehicle capacity. Owing to its extensive applications in logistics and transportation, CVRP has attracted substantial research attention, with numerous algorithms proposed from the perspective of intelligent search. A common solution strategy involves two phases: first, assigning customers to different vehicles to form feasible routes, and second, optimizing these routes. This paper presents a two-phase CVRP solution framework through the clustering concept with intelligent search to improve route planning. In the first phase, a set of clustering methods - fuzzy c-means, k-means, and k-medoids - combined with a nearest neighbor heuristic search, are applied to generate feasible routes for each vehicle. In the second phase, these routes are iteratively optimized using the Simulated Annealing (SA) algorithm. The process yields three distinct solution pathways: fuzzy c-means with SA, k-means with SA, and k-medoids with SA. For performance evaluation, 46 benchmark CVRP datasets from a publicly available library are used. Simulation results demonstrate that k-means with SA performs the best, surpassing the other two approaches and outperforming other clustering-based two-phase state-of-the-art algorithms in terms of solution quality.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans