Business Commons^™

Strategic Upgrades: A Vehicle Routing Overview And Implementation For Nokia Siemens Network, Lukas Kessler, Chris Davis, Farzad Moshfegh, Jerrod Thomas

Engineering and Technology Management Student Projects

The Traveling Salesman Problem (TSP) is combinatorial optimization problem that has real-world synonyms for many organizations and problem types. In this paper we discuss various implementations of the Vehicle Routing Problem (VRP), an extension of the traditional traveling salesman problem and explore a best-fit solution as well as a heuristically derived “good” solution. The best-fit solution utilizes a branch and bound technique but requires an exponential amount of computational resources to complete when applied to problems of marginal size. Some heuristic methodologies are elucidated to compare and contrast their benefits and drawbacks and an open source solution for capacitated vehicle …