Capacitated Vehicle Routing Problem Solving using Adaptive Sweep and Velocity Tentative PSO

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

 The macroeconomic effect of the information and communication technology in Hungary

  It was not until the beginning of the 1990s that the effects of information and communication technology on economic growth as well as on the profitability of enterprises raised the interest of researchers. A...

Authenticating Sensitive Speech-Recitation in Distance-Learning Applications using Real-Time Audio Watermarking

Thispaper focuses on audio-watermarking authentication and integrity-protection within the context of the speech-data transmitted over the Internet in a real-time learning environment.The Arabic Quran recitation through...

Web Accessibility Challenges

Despite the importance of web accessibility in recent years, websites remain partially or completely inaccessible to certain sectors of the population. This is due to several reasons, including web developers’ little or...

Amharic based Knowledge-Based System for Diagnosis and Treatment of Chronic Kidney Disease using Machine Learning

Chronic kidney disease is an important challenge for health systems around the world and consuming a huge proportion of health care finances. Around 85% of the world populations live in developing country of the world, w...

 Eye Detection Based-on Color and Shape Features

 This paper presents an eye detection technique based-on color and shape features. The approach consists of three steps: a rough eye localization using projection technique, a white color thresholding to extract whi...

Download PDF file
  • EP ID EP258417
  • DOI 10.14569/IJACSA.2017.081237
  • Views 132
  • Downloads 0

How To Cite

M. A. H. Akhand, Zahrul Jannat Peya, Kazuyuki Murase (2017). Capacitated Vehicle Routing Problem Solving using Adaptive Sweep and Velocity Tentative PSO. International Journal of Advanced Computer Science & Applications, 8(12), 288-295. https://europub.co.uk/articles/-A-258417