Facebook pixel tracking

The Science and Information (SAI) Organization publishes open-access peer-reviewed journals in computer science and artificial intelligence.

Contact Info
Website thesai.org
Follow Us
Contact Info
Follow Us
Research Article | Open Access |

Distance based Sweep Nearest Algorithm to Solve Capacitated Vehicle Routing Problem

Author 1: Zahrul Jannat Peya Author 2: M. A. H. Akhand Author 3: Tanzima Sultana Author 4: M. M. Hafizur Rahman
International Journal of Advanced Computer Science and Applications (IJACSA) · Vol. 10, No. 10 · Published 2019 · Cited by 10

DOI: https://doi.org/10.14569/IJACSA.2019.0101036

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.

Keywords

How to Cite this Article

Peya, Z. J., Akhand, M. A. H., Sultana, T., & Rahman, M. M. H. (2019). Distance based Sweep Nearest Algorithm to Solve Capacitated Vehicle Routing Problem. International Journal of Advanced Computer Science and Applications, 10(10). https://doi.org/10.14569/IJACSA.2019.0101036

Peya, Zahrul Jannat, et al.. "Distance based Sweep Nearest Algorithm to Solve Capacitated Vehicle Routing Problem." International Journal of Advanced Computer Science and Applications, vol. 10, no. 10, 2019, https://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},
  volume    = {10},
  number    = {10},
  year      = {2019},
  publisher = {The Science and Information Organization},
  author    = {Zahrul Jannat Peya and M. A. H. Akhand and Tanzima Sultana and M. M. Hafizur Rahman},
  doi       = {10.14569/IJACSA.2019.0101036},
  url       = {https://doi.org/10.14569/IJACSA.2019.0101036}
}

Open Access — licensed under a Creative Commons Attribution 4.0 International License. Unrestricted use, distribution, and reproduction in any medium, even commercially, as long as the original work is properly cited.