Paper Info
Title
An Improved Firefly Algorithm for the Vehicle Routing Problem with Time Windows
Abstract
Vehicle Routing Problem is renowned distribution problem in supply chain management. Because of its complex nature, it is categorized as non-polynomial deterministic (NP) hard problem. In the past decades, many researchers had applied various optimization techniques to solve the problem. In this paper, modification to a recently developed metaheuristic called Firefly Algorithm for specialization of Vehicle Routing problem called Vehicle Routing Problem with Time Windows (VRPTW) is suggested. The adaptation and implementation of improved Firefly Algorithm to VRPTW is explained and corresponding numerical experiments to justify the adequacy of the strategy are provided. Experimental outcomes demonstrate that the proposed modification procedures are effective and can get near optimal results for the VRPTW.
Year
DOI
Venue
2018
10.1109/ICACCI.2018.8554555
2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI)
Keywords
Field
DocType
Vehicle routing problem,time windows,firefly algorithm,meta-heuristics
Vehicle routing problem,Mathematical optimization,Microsoft Windows,Computer science,Control engineering,Firefly algorithm,Supply chain management,Genetic algorithm,Metaheuristic
Conference
ISBN
Citations 
PageRank 
978-1-5386-5315-9
0
0.34
References 
Authors
9
2
Name
Order
Citations
PageRank
Divya Aggarwal100.34
Vijay Kumar222921.59