Work

A Hybrid K-Means, MST, and DFS Approach for Solving The Capacitated Routing Problem

Year: 2025

Type: article

Abstract: The Routing Problem (VRP) is a central challenge in logistics, where optimizing costs and adhering to operational constraints are critical ‎for efficient distribution networks. These challenges include minimizing distances traveled, reducing transportation costs, and limiting ‎computation times for real-time applications. This paper proposes a hybrid approach combining K-Means clustering, Minimum Spanning ‎Tree (MST), and Depth-First Search (DFS) to efficiently solve the Capacitated Routing Problem (CVRP). Using the Solomon datasets as a ‎benchmark, we evaluate the method’s performance. The results demonstrate a significant reduction in total distance traveled while ‎maintaining low computation times, making this approach competitive with traditional heuristics‎.

Source: International Journal of Basic and Applied Sciences

DOI: 10.14419/amjh9c26

Authors: Soro Wongniga Seydou, Diaby Moustapha, Goore Bi Tra

Institutions: Institut National Polytechnique Félix Houphouët-Boigny, École Supérieure Africaine des TIC

Topic: Vehicle Routing Optimization Methods

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

SDG: Industry, innovation and infrastructure

Open Access status: diamond

OpenAlex ID: W4417037277

FWCI:

Cites:

Cited by:

Related to: