A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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. Thedoi:10.1109/socpar.2013.7054163 dblp:conf/socpar/KromerASBK13 fatcat:3mftg36wxzegzbd5qn3wwytfpe