4.7 Article

Solutions to the request reassignment problem in collaborative carrier networks

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2009.12.006

关键词

Collaborative planning; Electronic exchange platform; Auction mechanism; Travelling salesman problem with; precedence constraints

向作者/读者索取更多资源

The paper considers an arrangement for exchanging transportation requests to facilitate collaboration among independent carriers. The goal is to maximize the total profit without decreasing the individual profit of the carriers. Two solution approaches are developed for this problem involving decentralized control and auction based exchange mechanisms. The results are compared with those obtained without collaboration and by a centralized control. They indicate that horizontal collaboration pays off even in highly competitive environments. (C) 2009 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据