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


Citar

Texto integral

Acesso aberto Acesso aberto
Acesso é fechado Acesso está concedido
Acesso é fechado Somente assinantes

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

Arquivos suplementares
Ação
1. JATS XML

Declaração de direitos autorais © Pleiades Publishing, Ltd., 2018