Abstract: The Capacitated Vehicle Routing Problem (CVRP) is an optimization problem owing to find minimal travel distances to serve customers with homogeneous fleet of vehicles. Clustering customers and then assign individual vehicles is a widely-studied way, called cluster first and route second (CFRS) method, for solving CVRP. Cluster formation is important between two phases of CFRS for better CVRP solution. Sweep (SW) clustering is the pioneer one in CFRS method which solely depends on customers’ polar angle: sort the customers according to polar angle; and a cluster starts with customer having smallest polar angle and completes it considering others according to polar angle. On the other hand, Sweep Nearest (SN) algorithm, an extension of Sweep, also considers smallest polar angle customer to initialize a cluster but inserts other customer(s) based on the nearest neighbor approach. This study investigates a different way of clustering based on nearest neighbor approach. The proposed Distance based Sweep Nearest (DSN) method starts clustering from the farthest customer point and continues for a cluster based on nearest neighbor concept. The proposed method does not rely on polar angle of the customers like SW and SN. To identify the effectiveness of the proposed approach, SW, SN and DSN have been implemented in this study for solving benchmark CVRPs. For route optimization of individual vehicles, Genetic Algorithm, Ant Colony Optimization and Particle Swarm Optimization are considered for clusters formation with SW, SN and DSN. The experimental results identified that proposed DSN outperformed SN and SW in most of the cases and DSN with PSO was the best suited method for CVRP.

Zahrul Jannat Peya, M. A. H. Akhand, Tanzima Sultana and M. M. Hafizur Rahman, “Distance based Sweep Nearest Algorithm to Solve Capacitated Vehicle Routing Problem” International Journal of Advanced Computer Science and Applications(IJACSA), 10(10), 2019. http://dx.doi.org/10.14569/IJACSA.2019.0101036

@article{Peya2019,
title = {Distance based Sweep Nearest Algorithm to Solve Capacitated Vehicle Routing Problem},
journal = {International Journal of Advanced Computer Science and Applications}
doi = {10.14569/IJACSA.2019.0101036},
url = {http://dx.doi.org/10.14569/IJACSA.2019.0101036},
year = {2019},
publisher = {The Science and Information Organization},
volume = {10},
number = {10},
author = {Zahrul Jannat Peya and M. A. H. Akhand and Tanzima Sultana and M. M. Hafizur Rahman},
}