A distributed routing concept for vehicle routing problems
First online: 04.11.2008
Cite this article as: Rekersbrink, H., Makuschewitz, T. & Scholz-Reiter, B. Logist. Res. (2009) 1: 45. doi:10.1007/s12159-008-0003-4
Traditional solution concepts for the vehicle routing problem (VRP) are pushed to their limits, when applied on dynamically changing vehicle routing scenarios—which are more close to reality than the static formulation. By contrast, the introduced distributed routing concept is designed to match packages and vehicles and to continuously make route decisions especially within a dynamic environment. In this autonomous control concept, each of these objects makes its own decisions. The developed algorithm was entitled Distributed Logistics Routing Protocol (DLRP). But in spite of the restricted suitability of the traditional VRP concepts for dynamic environments, they are still the benchmark for any VRP-similar task. Therefore, we first present a description of the developed DLRP. Then an adapted vehicle routing problem is defined, which both sides, static and dynamic concepts, can cope with. Finally, both concepts are compared using a tabu search algorithm as a well working instance of traditional VRP-concepts. For a quantitative comparison, four solutions are given for the same adapted problem: the optimal solution as a lower bound, the DLRP solution, a tabu search solution and a random-like solution as an upper bound.
Vehicle routing problem (VRP) Autonomous control Distributed logistics routing protocol (DLRP) Tabu search Optimisation Routing algorithm Transport logistic