An Approximate Algorithm for the Lane Reservation Problem in Time Constrained Transportation

摘要：

This paper considers a new transportation problem: Lane Reservation Problem in Time Constrained Transportation.This kind of problem comes from large sportive events in a city or region where the travel time between sportive villages and stadium should fall in a strict time window.To guarantee the athlete transportation in time,the problem consists in temporarily creating special lanes on roads hi the transportation network while minimizing the traffic impact to the daily traffic.The corresponding objective is to minimize the total weighted cost of reserved lanes.In this paper,we construct a new integer linear programming model for the problem,which describes the problem more accurately.Because the complexity of the problem,we propose an efficient tabu search heuristic to obtain near optimal solutions and compare it with the solutions obtained by the heuristic proposed in

关键词： Tabu search Heuristic Lane reservation Time constrained transportation

作者: Yingfeng Wu Naiqi Wu

作者单位: Department of Industrial Engineering Guangdong University of Technology,GDUT Guangzhou,P.R.China Senior Member,IEEE Department of Industrial Engineering Guangdong University of Technology,GDUT Guan

会议类型: 国际会议

会议名称: The 2nd IEEE International Conference on Advanced Computer Control(第二届先进计算机控制国际会议 ICACC 2010)

会议地点: 沈阳

会议语种:英文

页码: 192-196

在线出版日期: 2010-03-27（万方平台首次上网日期，不代表论文的发表时间）