On the differential evolution for vehicle routing problem

Pavel Kromer, Ajith Abraham, Vaclav Snasel, Eshetie Berhan, Daniel Kitaw
2013 2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)  
Vehicle Routing Problem (VRP) is a well known NP-hard optimization problem with a number of real world applications and a variety of different versions. Due to its complexity, large instances of VRP are hard to solve using exact methods. Instead, various heuristic and meta-heuristic algorithms were used to find feasible VRP solutions. This work proposes a Differential Evolution for VRP that simultaneously looks for an optimal set of routes and minimizes the number of vehicles needed. The
more » ... needed. The algorithm is used to solve Stochastic VRP with Real Simultaneous Pickup and Delivery based on realworld data obtained from Anbessa City Bus Service Enterprise (ACBSE), Addis Ababa, Ethiopia. Additionally, the algorithm is evaluated on several well known VRP instances.
doi:10.1109/socpar.2013.7054163 dblp:conf/socpar/KromerASBK13 fatcat:3mftg36wxzegzbd5qn3wwytfpe