Application of Multiagent Technologies to Multiple Depot Vehicle Routing Problem with Time Windows

Аннотация

In this paper, a multiagent approach to the Multiple Depot Vehicle Routing Problem with Time Windows (MDVRPTW) is presented. A multiagent system of interacting trucks, depots and orders is considered. For limiting the intensity of negotiations, a Delaunay triangulation-based scene structure is proposed. As demonstrated below, the solutions obtained by the new algorithm vary by 10–30% from the well-known best counterparts; however, the speed of calculations is considerably higher, and hence the new algorithm can be applied in real-time systems.