Vehicle routing problem plays an important part and always gives challenging task for researchers with multi-objective and constraints in the field of distribution and logistics, and in practical it is difficult to solve. In this paper, enhanced biologically inspired metaheuristic is proposed to solve capacitated vehicle routing problem (CVRP). CVRP is a class of NP-Hard combinatorial optimization problem where optimum delivery routes are scheduled for a fleet of vehicles to accommodate a set of customers in a transportation network from a single depot. The objective of the present research has focused on finding the minimum cost routes for the vehicle to serve the customers and to minimize distance and vehicles travelled using firefly technique, and also to analyze the effectiveness of the proposed technique Augerat et al. benchmark instances were used. Enhanced firefly technique attempts to progress the solution quality by using a Clarke and Wright savings algorithm and a local searchtechnique, and its performance has been compared with standard firefly and enhanced firefly algorithm.
An Improved Firefly Algorithm for Capacitated Vehicle Routing Optimization
2019-02-01
934594 byte
Conference paper
Electronic Resource
English
Optimized Model Simulation of a Capacitated Vehicle Routing problem based on Firefly Algorithm
BASE | 2018
|Improved Genetic Algorithm for Capacitated Vehicle Routing Problem
British Library Conference Proceedings | 2013
|Improved Genetic Algorithm for Capacitated Vehicle Routing Problem
British Library Conference Proceedings | 2013
|An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem
British Library Online Contents | 2003
|An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem
Online Contents | 2003
|