Optimization of capacitated vehicle routing problem using Producer-Scrounger Method

Akhand, M. A. H.; Jannat, Zahrul; Diba, Tanzima; Al-Mahmud,

doi:10.1109/wiecon-ece.2015.7443922

Cited by 2 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Existing studies checked different fixed starting angles. But such trial and check method is required to set for every individual problem [17]. Therefore, as an alternative, a heuristic method is investigated in this study which aim is to identify the appropriate cluster formation starting angle (Ɵs) for a given problem.…”

Section: A Clutering Using Adaptive Sweepmentioning

confidence: 99%

“…Problem with such rigid starting is identified that total clusters formation may exceeds total number of available vehicles for some instances. And, starting from different user-defined angles identified better clustering and hence achieved better CVRP solution [17]. In this study, a heuristic approach is developed to identify appropriate starting angle in Sweep clustering.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Akhand¹,

Peya²,

Murase³

2017

ijacsa

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: A Clutering Using Adaptive Sweepmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

Akhand¹,

Peya²,

Murase³

2017

ijacsa

Self Cite

View full text Add to dashboard Cite

show abstract

“…Because of such unbending beginning from 0 0 total number of clusters may surpasses total number of accessible vehicles for a few examples. Beginning from various angles subsequently accomplished better CVRP result 26…”

Section: Introductionmentioning

confidence: 96%

Capacitated Vehicle Routing Problem Solving through Adaptive Sweep Based Clustering plus Swarm Intelligence based Route Optimization

Peya

Akhand

Murase

2018

Orient. J. Comp. Sci. and Technol

Self Cite

View full text Add to dashboard Cite

Capacitated Vehicle Routing Problem (CVRP) is anoptimization task where customers are assigned to vehicles aiming that combined travel distances of all the vehicles as minimum as possible while serving customers. A popular way among various methods of CVRP is solving it in two phases: grouping or clustering customers into feasible routes of individual vehicles and then finding their optimal routes. Sweep is well studied clustering algorithm for grouping customers and different traveling salesman problem (TSP) solving methods are commonly used to generate optimal routes of individual vehicles. This study investigates effective CVRP solving method based on recently developed adaptive Sweep and prominent Swarm Intelligence (SI) based TSP optimization methods. The adaptive Sweep cluster is a heuristic based adaptive method to select appropriate cluster formation starting angle of Sweep. Three prominent SI based TSP optimization methods are investigated which are Ant Colony Optimization, Producer-Scrounger Method and Velocity Tentative Particle Swarm Optimization (VTPSO). Genetic Algorithm is also considered since it is the pioneer and well-known population based method. The experimental results on two suites of benchmark CVRPs identified the effectiveness of adaptive Sweep plus SI methods in solving CVRP. Finally, adaptive Sweep plus the VTPSO is found better than other tested methods in this study as well as several other prominent existing methods.

show abstract

Optimization of capacitated vehicle routing problem using Producer-Scrounger Method

Cited by 2 publications

References 12 publications

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

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

Capacitated Vehicle Routing Problem Solving through Adaptive Sweep Based Clustering plus Swarm Intelligence based Route Optimization

Contact Info

Product

Resources

About