Lane reservation problem with time-dependent travel times

Yunfei Fang, Feng Chu, Saïd Mammar, Ada Che

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

2 引用 (Scopus)

摘要

This paper presents an mixed integer nonlinear programming formulation for the lane reservation problem with time-dependent travel times. It aims to design time-guaranteed paths for some transportation tasks via lane reservation strategy, which is to optimally select and reserve some lanes for the use of the tasks with the objective of minimizing the total traffic impact caused by the reserved lanes. The considered problem is NP-hard. The original nonlinear model is transformed into an mixed integer linear program and a cut-and-solve based algorithm is proposed to obtain optimal solutions. Experimental tests on randomly generated instances show that the overall performance of the proposed algorithm outperforms a direct use of an optimization solver of CPLEX.

源语言英语
主期刊名Proceedings - INCOM'12, 14th IFAC Symposium on Information Control Problems in Manufacturing
出版商IFAC Secretariat
584-589
页数6
版本PART 1
ISBN(印刷版)9783902661982
DOI
出版状态已出版 - 2012
活动14th IFAC Symposium on Information Control Problems in Manufacturing, INCOM'12 - Bucharest, 罗马尼亚
期限: 23 5月 201225 5月 2012

出版系列

姓名IFAC Proceedings Volumes (IFAC-PapersOnline)
编号PART 1
14
ISSN(印刷版)1474-6670

会议

会议14th IFAC Symposium on Information Control Problems in Manufacturing, INCOM'12
国家/地区罗马尼亚
Bucharest
时期23/05/1225/05/12

指纹

探究 'Lane reservation problem with time-dependent travel times' 的科研主题。它们共同构成独一无二的指纹。

引用此