RUS  ENG
Full version
JOURNALS // Matematicheskaya Teoriya Igr i Ee Prilozheniya // Archive

Mat. Teor. Igr Pril., 2013 Volume 5, Issue 3, Pages 3–26 (Mi mgta112)

This article is cited in 1 paper

Cooperative strong equilibrium in a vehicle routing game

Nikolay A. Zenkevicha, Andrey V. Zyatchinab

a Graduate School of Management, Department of Operations Management, St. Petersburg University
b Deutsche Bahn Mobility Logistics AG (Deutsche Bahn) and JSC "Russian Railways" (RZD) Center for International Logistics and Supply Chain Management in SPbU Graduate School of Management

Abstract: In the paper game-theoretic approach is considered for the vehicle routing problem with many distributors. Any customer is characterized by demand and wholesale price. Under this scenario some customers could be unvisited by a distributor. Such a statement is called vehicle routing game, VRG, in coordinated strategies.
A procedure for determining strong equilibrium in the VRG is proposed. Such solution is stable against deviations of any coalition. In the procedure the optimization problem is solved iteratively for every distributor. On each step a set of customers is reduced.
Existence of two types of strong equilibrium is solved. Cooperative strong equilibrium is presented. All results are illustrated with numerical examples.

Keywords: combinatorial optimization, Nash equilibrium, strong equilibrium, cooperative strong equilibrium, transportation network, vehicle routing problem.

UDC: 518.9+517.9
BBK: 65.050.2


 English version:
Automation and Remote Control, 2016, 77:10, 1867–1881


© Steklov Math. Inst. of RAS, 2024