Capacitated Vehicle Routing Problem Solving using Adaptive Sweep and Velocity Tentative PSO
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2017, Vol 8, Issue 12
Abstract
Vehicle Routing Problem (VRP) has become an integral part in logistic operations which determines optimal routes for several vehicles to serve customers. The basic version of VRP is Capacitated VRP (CVRP) which considers equal capacities for all vehicles. The objective of CVRP is to minimize the total traveling distance of all vehicles to serve all the customers. Various methods are used to solve CVRP, among them the most popular way is splitting the task into two different phases: assigning customers under different vehicles and then finding optimal route of each vehicle. Sweep clustering algorithm is well studied for clustering nodes. On the other hand, route optimization is simply a traveling salesman problem (TSP) and a number of TSP optimization methods are applied for this purpose. In Sweep, cluster formation staring angle is identified as an element of CVRP performance. In this study, a heuristic approach is developed to identify appropriate starting angle in Sweep clustering. The proposed heuristic approach considers angle difference of consecutive nodes and distance between the nodes as well as distances from the depot. On the other hand, velocity tentative particle swarm optimization (VTPSO), the most recent TSP method, is considered for route optimization. Finally, proposed adaptive Sweep (i.e., Sweep with proposed heuristic) plus VTPSO is tested on a large number of benchmark CVRP problems and is revealed as an effective CVRP solving method while outcomes compared with other prominent methods.
Authors and Affiliations
M. A. H. Akhand, Zahrul Jannat Peya, Kazuyuki Murase
Keywords
Related Articles
- EP ID EP258417
- DOI 10.14569/IJACSA.2017.081237
- Views 116
- Downloads 0
Analysis and Research of Communication Interrupt Fault for Shanghai Metro Data Transmission System
A line of Shanghai metro has been put into use for nearly fifteen years. There are three times extended during this time. The existing line’s data transmission system was modified over the last decades and has adopted ma...
Scale and Resolution Invariant Spin Images for 3D Object Recognition
Until the last decades, researchers taught that teaching a computer how to recognize a bunny, for example, in a complex scene is almost impossible. Today, computer vision system do it with a high score of accuracy. To br...
A Quantum based Evolutionary Algorithm for Stock Index and Bitcoin Price Forecasting
Quantum computing has emerged as a new dimension with various applications in different fields like robotic, cryptography, uncertainty modeling etc. On the other hand, nature inspired techniques are playing vital role in...
Modified Graph-theoretic Clustering Algorithm for Mining International Linkages of Philippine Higher Education Institutions
Graph-theoretic clustering either uses limited neighborhood or construction of a minimum spanning tree to aid the clustering process. The latter is challenged by the need to identify and consequently eliminate inconsiste...
A Novel Student Clustering Model for the Learning Simplification in Educational Environments
Students’ clustering is considered to be a method of granting students many different ways of being able to learn by taking into account the student’s degree. The definition of clustering can be “a group of steps that di...