Cooperative strong equilibrium in vehicle routing game


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2016