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

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 propo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Automation and remote control 2018-06, Vol.79 (6), p.1139-1147
Hauptverfasser: Sazonov, V. V., Skobelev, P. O., Lada, A. N., Mayorov, I. V.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
CAE) and Design
Calculus of Variations and Optimal Control
Optimization
Computer-Aided Engineering (CAD
Control
Delaunay triangulation
Large Scale Systems Control
Mathematics
Mathematics and Statistics
Mechanical Engineering
Mechatronics
Motor vehicle fleets
Multiagent systems
Negotiations
Robotics
Route planning
Routing
Systems Theory
Vehicle routing
Windows (intervals)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0005-1179
1608-3032
DOI:10.1134/S0005117918060127