Multi-period cooperative vehicle routing games
Contributions to game theory and management, Tome 7 (2014), pp. 349-359.

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: VRP, vehicle routing problem, vehicle routing games, heuristics, multi-period cooperative games, dynamic stability, time consistency.
@article{CGTM_2014_7_a31,
     author = {Alexander Shchegryaev and Victor V. Zakharov},
     title = {Multi-period cooperative vehicle routing games},
     journal = {Contributions to game theory and management},
     pages = {349--359},
     publisher = {mathdoc},
     volume = {7},
     year = {2014},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CGTM_2014_7_a31/}
}
TY  - JOUR
AU  - Alexander Shchegryaev
AU  - Victor V. Zakharov
TI  - Multi-period cooperative vehicle routing games
JO  - Contributions to game theory and management
PY  - 2014
SP  - 349
EP  - 359
VL  - 7
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CGTM_2014_7_a31/
LA  - en
ID  - CGTM_2014_7_a31
ER  - 
%0 Journal Article
%A Alexander Shchegryaev
%A Victor V. Zakharov
%T Multi-period cooperative vehicle routing games
%J Contributions to game theory and management
%D 2014
%P 349-359
%V 7
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CGTM_2014_7_a31/
%G en
%F CGTM_2014_7_a31
Alexander Shchegryaev; Victor V. Zakharov. Multi-period cooperative vehicle routing games. Contributions to game theory and management, Tome 7 (2014), pp. 349-359. http://geodesic.mathdoc.fr/item/CGTM_2014_7_a31/

[1] Agarwal R., Ergun Ö., Houghtalen L., Ozener O. O., “Collaboration in Cargo Transportation”, Optimization and Logistics Challenges in the Enterprise, Springer Optimization and Its Applications, 30, 2009, 373–409 | DOI | Zbl

[2] Baldacci R., Mingozzi A., Roberti R., “Recent exact algorithms for solvingthe vehicle routing problem under capacity and time window constraints”, European Journal of Operational Research, 218 (2012), 1–6 | DOI | MR | Zbl

[3] Ergun Ö., Kuyzu G., Savelsbergh M. W. P., “Shipper collaboration”, Computers Operations Research, 34 (2007), 1551–1560 | DOI | Zbl

[4] Kallehauge B., “Formulations and exact algorithms for the vehicle routing problem with time windows”, Computers Operations Research, 35 (2008), 2307–2330 | DOI | MR | Zbl

[5] Krajewska M. A., Kopfer H., Laporte G., Ropke S., Zaccour G., “Horizontal cooperation among freight carriers: request allocation and profit sharing”, Journal of the Operational Research Society, 59 (2009), 1483–1491 | DOI

[6] Petrosyan L. A., Zenkevich N. A., “Principles of dynamic stability”, Mat. Teor. Igr Pril., 1:1 (2009), 106–123 (in Russian)

[7] Ropke S., Pisinger D., “An adaptive large neighbourhood search heuristic for the pickup and delivery problem with time windows”, Transportation Science, 40 (2006), 455–472 | DOI

[8] Zakharov V., O-Hun Kwon, “Selectors of the core and consistency properties”, Game Theory and Applications, 4 (1999), 237–250 | MR

[9] Zakharov V., Dementieva M., “Multistage cooperative games and problem of time-consistency”, International Game Theory Review, 6:1 (2004), 1–14 | DOI | MR