Standard

Stable Cooperation in Dynamic Vehicle Routing Problems. / Zakharov, V.V.; Shchegryaev, A.N.

в: Automation and Remote Control, Том 76, № 5, 2015, стр. 935-943.

Результаты исследований: Научные публикации в периодических изданияхстатьяРецензирование

Harvard

Zakharov, VV & Shchegryaev, AN 2015, 'Stable Cooperation in Dynamic Vehicle Routing Problems', Automation and Remote Control, Том. 76, № 5, стр. 935-943. https://doi.org/10.1134/S0005117915050173

APA

Zakharov, V. V., & Shchegryaev, A. N. (2015). Stable Cooperation in Dynamic Vehicle Routing Problems. Automation and Remote Control, 76(5), 935-943. https://doi.org/10.1134/S0005117915050173

Vancouver

Zakharov VV, Shchegryaev AN. Stable Cooperation in Dynamic Vehicle Routing Problems. Automation and Remote Control. 2015;76(5):935-943. https://doi.org/10.1134/S0005117915050173

Author

Zakharov, V.V. ; Shchegryaev, A.N. / Stable Cooperation in Dynamic Vehicle Routing Problems. в: Automation and Remote Control. 2015 ; Том 76, № 5. стр. 935-943.

BibTeX

@article{9d6e8eaa96eb488a8abf80a8ffbc3796,
title = "Stable Cooperation in Dynamic Vehicle Routing Problems",
abstract = "In the paper we treat the problem of minimizing and sharing joint transportation cost in multi-agent vehicle routing problem (VRP) on large-scale networks. A new approach for calculation subadditive characteristic function in multi-period TU-cooperative vehicle routing game (CVRG)has been developed. The main result of this paper is the method of constructing the characteristic function of cooperative routing game of freight carriers, which guarantees its subadditive property. A new algorithm is proposed for solving this problem, which is called direct coalition induction algorithm (DCIA). Cost sharing method proposed in the paper allows to obtain sharing distribution procedure which provides strong dynamic stability of cooperative agreement based on the concept of Sub-Core and time consistency of any cost allocation from Sub-Core in multi-period CVRG. В статье исследуется проблема минимизации и распределения затрат в задаче маршрутизации транспортных средств (VRP) в условиях кооперации перевозчиков на сети",
keywords = "Кооперативные игры, динамическая устойчивость, характеристическая функция, ядро",
author = "V.V. Zakharov and A.N. Shchegryaev",
year = "2015",
doi = "10.1134/S0005117915050173",
language = "English",
volume = "76",
pages = "935--943",
journal = "Automation and Remote Control",
issn = "0005-1179",
publisher = "МАИК {"}Наука/Интерпериодика{"}",
number = "5",

}

RIS

TY - JOUR

T1 - Stable Cooperation in Dynamic Vehicle Routing Problems

AU - Zakharov, V.V.

AU - Shchegryaev, A.N.

PY - 2015

Y1 - 2015

N2 - In the paper we treat the problem of minimizing and sharing joint transportation cost in multi-agent vehicle routing problem (VRP) on large-scale networks. A new approach for calculation subadditive characteristic function in multi-period TU-cooperative vehicle routing game (CVRG)has been developed. The main result of this paper is the method of constructing the characteristic function of cooperative routing game of freight carriers, which guarantees its subadditive property. A new algorithm is proposed for solving this problem, which is called direct coalition induction algorithm (DCIA). Cost sharing method proposed in the paper allows to obtain sharing distribution procedure which provides strong dynamic stability of cooperative agreement based on the concept of Sub-Core and time consistency of any cost allocation from Sub-Core in multi-period CVRG. В статье исследуется проблема минимизации и распределения затрат в задаче маршрутизации транспортных средств (VRP) в условиях кооперации перевозчиков на сети

AB - In the paper we treat the problem of minimizing and sharing joint transportation cost in multi-agent vehicle routing problem (VRP) on large-scale networks. A new approach for calculation subadditive characteristic function in multi-period TU-cooperative vehicle routing game (CVRG)has been developed. The main result of this paper is the method of constructing the characteristic function of cooperative routing game of freight carriers, which guarantees its subadditive property. A new algorithm is proposed for solving this problem, which is called direct coalition induction algorithm (DCIA). Cost sharing method proposed in the paper allows to obtain sharing distribution procedure which provides strong dynamic stability of cooperative agreement based on the concept of Sub-Core and time consistency of any cost allocation from Sub-Core in multi-period CVRG. В статье исследуется проблема минимизации и распределения затрат в задаче маршрутизации транспортных средств (VRP) в условиях кооперации перевозчиков на сети

KW - Кооперативные игры

KW - динамическая устойчивость

KW - характеристическая функция

KW - ядро

U2 - 10.1134/S0005117915050173

DO - 10.1134/S0005117915050173

M3 - Article

VL - 76

SP - 935

EP - 943

JO - Automation and Remote Control

JF - Automation and Remote Control

SN - 0005-1179

IS - 5

ER -

ID: 3929104