...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Transportation Research Part B: Methodological >Fair cost allocation for ridesharing services - modeling, mathematical programming and an algorithm to find the nucleolus
【24h】

Fair cost allocation for ridesharing services - modeling, mathematical programming and an algorithm to find the nucleolus

机译：公平成本分配用于骑士服务 - 建模，数学规划和寻找核仁的算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper addresses one of the most challenging issues in designing an efficient and sustainable ridesharing service: ridesharing market design. We formulate it as a fair cost allocation problem through the lens of the cooperative game theory. A special property of the cooperative ridesharing game is that its characteristic function values are calculated by solving an optimization problem. Several concepts of fairness are investigated and special attention is paid to a solution concept named nucleolus, which aims to minimize the maximum dissatisfaction in the system. Due to its computational intractability, we break the problem into a master-subproblem structure and two subproblems are developed to generate constraints for the master problem. We propose a coalition generation procedure to find the nucleolus and approximate nucleolus of the game. Experimental results showed that when the game has a non-empty core, in the approximate nucleolus scheme the coalitions are computed only when it is necessary and the approximate procedure produces the actual nucleolus. And when the game has an empty core, the approximate nucleolus is close to the actual one. Regardless of the emptiness of the game, our algorithm needs to generate only a small fraction (1.6%) of the total coalition constraints to compute the approximate nucleolus. The proposed model and results nicely fit systems operated by autonomous vehicles. (C) 2019 Elsevier Ltd. All rights reserved.
机译：本文涉及设计高效和可持续的乘资服务方面最具挑战性的问题之一：RideSharing市场设计。通过合作博弈论的镜头，将其作为公平成本分配问题。合作骑行游戏的特殊属性是通过解决优化问题来计算其特征函数值。调查了几种公平的概念，特别注意了名为核仁的解决方案概念，旨在最大限度地减少系统的最大不满意。由于其计算诡计性，我们将问题分解为主副产物结构，并且开发了两个子问题以生成主问题的约束。我们提出了一种联盟生成程序，找到了比赛的核仁和近似核心。实验结果表明，当游戏具有非空核心时，在近似核仁方案中，只有在必要时才计算联盟，并且近似程序产生实际的核仁。当游戏有空核心时，近似核仁接近实际。无论游戏的空虚如何，我们的算法都需要仅产生总联盟限制的小部分（1.6％）以计算近似核仁。所提出的模型和结果由自动车辆运营的恰好配合系统。 （c）2019 Elsevier Ltd.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号