Cooperative strong equilibrium in vehicle routing game
- 作者: Zenkevich N.A.1, Zyatchin A.V.1,2
-
隶属关系:
- Graduate School of Management, Department of Operations Management
- Deutsche Bahn and Russian Railways Center for International Logistics and Supply Chain Management
- 期: 卷 77, 编号 10 (2016)
- 页面: 1867-1881
- 栏目: Mathematical Game Theory and Applications
- URL: https://journals.rcsi.science/0005-1179/article/view/150465
- DOI: https://doi.org/10.1134/S0005117916100131
- ID: 150465
如何引用文章
详细
In this paper, a game-theoretic approach is considered for the vehicle routing problem with many distributors. Each customer is characterized by demand and wholesale price. Within such a statement, some customers are possibly not visited by a distributor in the optimal solution. This problem is called the vehicle routing game (VRG) in coordinated strategies. A procedure for determining a strong equilibrium in the VRG is proposed which is stable against coalitional deviations. According to the procedure, the optimization problem is solved iteratively for each distributor. The set of unvisited customers is reduced at each step. The existence of two classes of strong equilibria is proved. The concept of a cooperative strong equilibrium is presented. All results are illustrated by numerical examples.
作者简介
N. Zenkevich
Graduate School of Management, Department of Operations Management
编辑信件的主要联系方式.
Email: zenkevich@gsom.spbu.ru
俄罗斯联邦, St. Petersburg
A. Zyatchin
Graduate School of Management, Department of Operations Management; Deutsche Bahn and Russian Railways Center for International Logistics and Supply Chain Management
Email: zenkevich@gsom.spbu.ru
俄罗斯联邦, St. Petersburg; St. Petersburg
补充文件
