Core-based cost allocation in the cooperative traveling salesman problem
Core-based cost allocation in the cooperative traveling salesman problem
复制标题
DOI：
10.1016/j.ejor.2015.08.002
复制
发表时间：
2016-02-01
影响因子：
6.4
通讯作者：
Kozeletskyi, I.
中科院分区：
文献类型：
--
作者：
Kimms, A.;Kozeletskyi, I.
本文提出了一种旅行推销员横向合作的成本分配方案，该方案是先验实施的，并为联盟成员提供了预期成本。成本分配是使用核心概念来确定的。为了计算整个规划范围内特征函数的值，使用了具有发布日期和模拟的 TSP。所开发的核心计算算法基于数学编程技术，提供核心元素，或者在空核心的情况下提供最少核心元素。为了减少核心计算的计算工作量，实现了行生成过程。开发的计算研究测试了求解过程的计算性能。 (C) 2015 年由 Elsevier B.V. 出版
This paper presents a cost allocation scheme for a horizontal cooperation of traveling salesmen that is implemented a priori and provides expected costs for the coalition members. The cost allocation is determined using the core concept. To compute the value of the characteristic function over the whole planning horizon the TSP with release dates combined with simulation is used. The developed core computation algorithm, based on mathematical programming techniques, provides a core element or, in case of an empty core, a least-core element. To decrease the computational effort of core computation a row generation procedure is implemented. The developed computation study tests the computational performance of the solution procedure. (C) 2015 Published by Elsevier B.V.