The capacitated lane reservation problem in transportation network

Yunfei Fang, Said Mammar, Feng Chu, Ada Che

科研成果: 书/报告/会议事项章节会议稿件同行评审

2 引用 (Scopus)

摘要

This paper investigates a capacitated lane reservation problem in a transportation network. The problem is to decide the task paths and select lanes to be reserved in a capacitated network to ensure that each commodity can be transported from its source to destination within a given travel time, meanwhile the lane's capacity is not violated. Its objective is to minimize the total impact of all reserved lanes on other normal lanes. To solve this problem, two integer linear programming models are formulated. The complexity of the problem is proved to be NP-hard. Then an algorithm based on a cut-and-solve idea is proposed to obtain optimal solutions. To evaluate the performance of our proposed algorithm, numerical experiments of randomly generated instances are conducted. Computational results show our algorithm significantly outperforms a well-known optimization software package CPLEX.

源语言英语
主期刊名2011 4th International Conference on Logistics, LOGISTIQUA'2011
439-444
页数6
DOI
出版状态已出版 - 2011
活动2011 4th International Conference on Logistics, LOGISTIQUA'2011 - Hammamet, 突尼斯
期限: 31 5月 20113 6月 2011

出版系列

姓名2011 4th International Conference on Logistics, LOGISTIQUA'2011

会议

会议2011 4th International Conference on Logistics, LOGISTIQUA'2011
国家/地区突尼斯
Hammamet
时期31/05/113/06/11

指纹

探究 'The capacitated lane reservation problem in transportation network' 的科研主题。它们共同构成独一无二的指纹。

引用此