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 131
- Downloads 0
A Tool Design of Cobit Roadmap Implementation
Over the last two decades, the role of information technology in organizations has changed from primarily a supportive and transactional function to being an essential prerequisite for strategic value generation. The org...
Secure Clustering in Vehicular Ad Hoc Networks
A vehicular Ad-hoc network is composed of moving cars as nodes without any infrastructure. Nodes self-organize to form a network over radio links. Security issues are commonly observed in vehicular ad hoc networks; like...
Adaptive Simulated Evolution based Approach for Cluster Optimization in Wireless Sensor Networks
Energy consumption minimization is crucial for the constrained sensors in wireless sensor networks (WSNs). Partitioning WSNs into optimal set of clusters is a promising technique utilized to minimize energy consumption a...
Detection and Prevention of SQL Injection Attack by Dynamic Analyzer and Testing Model
With the emergence and popularity of web application, threats related to web applications has increased to large extent. Among many other web applications threats Structured Query Language Injection Attack (SQLIA) is the...
Automatic Fuzzy-based Hybrid Approach for Segmentation and Centerline Extraction of Main Coronary Arteries
Coronary arteries segmentation and centerlines extraction is an important step in Coronary Artery Disease diagnosis. The main purpose of the fully automated presented approaches is helping the clinical non-invasive diagn...