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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
