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 125
- Downloads 0
SIT: A Lightweight Encryption Algorithm for Secure Internet of Things
The Internet of Things (IoT) being a promising technology of the future is expected to connect billions of devices. The increased number of communication is expected to generate mountains of data and the security of data...
Using Project-based Learning in a Hybrid e-Learning System Model
After conducting the historical review and estab-lishing the state of the art, the authors of this paper focus on the incorporation of Project Based Learning (PBL), in an adaptive e-Learning environment, a novel and emer...
Nonlinear Condition Tolerancing Using Monte Carlo Simulation
To ensure accuracy and performance of the products, designers tend to hug the tolerances. While, manufacturers prefer to increase them in order to reduce costs and ensure competition. The analysis and synthesis of tolera...
Complex Shear Modulus Estimation using Integration of LMS/AHI Algorithm
Elasticity and viscosity of tissues are two important parameters that can be used to investigate the structure of tissues, especially detecting tumors. By using a force excitation, the shear wave speed is acquired to ext...
Good Quasi-Cyclic Codes from Circulant Matrices Concatenation using a Heuristic Method
In this paper we present a method to search q circulant matrices; the concatenation of these circulant matrices with circulant identity matrix generates quasi-cyclic codes with high various code rate q/(q+1) (q an intege...