Geodesic
Stable cooperation in dynamic VRP
Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 4 (2012) no. 2, pp. 39-56 
Victor V. Zakharov; Alexander N. Shchegryaev. Stable cooperation in dynamic VRP. Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 4 (2012) no. 2, pp. 39-56. http://geodesic.mathdoc.fr/item/MGTA_2012_4_2_a2/
@article{MGTA_2012_4_2_a2,
     author = {Victor V. Zakharov and Alexander N. Shchegryaev},
     title = {Stable cooperation in dynamic {VRP}},
     journal = {Matemati\v{c}eska\^a teori\^a igr i e\"e prilo\v{z}eni\^a},
     pages = {39--56},
     year = {2012},
     volume = {4},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MGTA_2012_4_2_a2/}
}
TY  - JOUR
AU  - Victor V. Zakharov
AU  - Alexander N. Shchegryaev
TI  - Stable cooperation in dynamic VRP
JO  - Matematičeskaâ teoriâ igr i eë priloženiâ
PY  - 2012
SP  - 39
EP  - 56
VL  - 4
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MGTA_2012_4_2_a2/
LA  - ru
ID  - MGTA_2012_4_2_a2
ER  - 
%0 Journal Article
%A Victor V. Zakharov
%A Alexander N. Shchegryaev
%T Stable cooperation in dynamic VRP
%J Matematičeskaâ teoriâ igr i eë priloženiâ
%D 2012
%P 39-56
%V 4
%N 2
%U http://geodesic.mathdoc.fr/item/MGTA_2012_4_2_a2/
%G ru
%F MGTA_2012_4_2_a2

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

In the paper the problem of carriers transportation cost in the cooperative vehicle routing problem (VRP) on large-scale networks is treated. A heuristic method for calculation subadditive characteristic function in the TU-cooperative dynamic VRP game is proposed. The algorithm is updated for the dynamic cooperative VRP game. Shapley value and the subcore concept is used to form an optimal solution. A cost distribution procedure which provides strong time consistency of the subcore and the dynamic stability of cooperation agreement is developed and demonstrated.

[1] Petrosyan L. A., Zenkevich N. A., “Printsipy ustoichivoi kooperatsii”, MTIiP, 1:1 (2009), 106–123

[2] Baldacci R., Mingozzi A., Roberti R., “Recent exact algorithms for solving the 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 (2008), 1483–1491 | DOI | Zbl

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

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

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