Application of Multiagent Technologies to Multiple Depot Vehicle Routing Problem with Time Windows
- Autores: Sazonov V.V.1, Skobelev P.O.2,3, Lada A.N.4, Mayorov I.V.4
-
Afiliações:
- Faculty of Computational Mathematics and Cybernetics
- Samara National Research University
- Institute for the Control of Complex Systems of Russian Academy of Sciences
- SEC Smart Solutions
- Edição: Volume 79, Nº 6 (2018)
- Páginas: 1139-1147
- Seção: Large Scale Systems Control
- URL: https://ogarev-online.ru/0005-1179/article/view/150944
- DOI: https://doi.org/10.1134/S0005117918060127
- ID: 150944
Citar
Resumo
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.
Sobre autores
V. Sazonov
Faculty of Computational Mathematics and Cybernetics
Autor responsável pela correspondência
Email: sazonov@smartsolutions-123.ru
Rússia, Moscow
P. Skobelev
Samara National Research University; Institute for the Control of Complex Systems of Russian Academy of Sciences
Email: sazonov@smartsolutions-123.ru
Rússia, Samara; Samara
A. Lada
SEC Smart Solutions
Email: sazonov@smartsolutions-123.ru
Rússia, Samara
I. Mayorov
SEC Smart Solutions
Email: sazonov@smartsolutions-123.ru
Rússia, Samara
Arquivos suplementares
