求解基于专用道设置的动态交通规划问题的启发式算法

摘要

Under lane reservation strategy, it gives rise to a new dynamic transportation problem. In large sportive events, it needs to send special people from sportive villages to stadiums in a strict time window. This problem is originated form the transportation demand for 2010 Guangzhou Asian Games. It requires to minimize the total weighted cost of reserved lanes and guarantee that athletes should be sent from sportive villages to stadiums within 30 minites. Because of the complexity of the problem, three heuristics are proposed to solve the problem modelled by linear integer programming. Computational results show that average gap between solutions obtained by the proposed heuristics and that by a software package Lingo 8.0 is less than 1. 89% . Meanwhile, the average computational time with the heuristic is much less than that with Lingo 8.0.%基于专用道设置的策略,该文提出了一个新的动态交通规划问题.大型运动会要求主办方在规定时间内将指定人员从运动员村运送到指定地点.该问题便是源自2010年广州亚运会的交通需求.其要求在保证30分钟内将运动员从运动员村运送到指定场馆的条件下,最小化设置专用通道的总成本.由于该问题的规模较大,本文提出了三种启发式算法用以求解已提出的线性整数规划模型.计算结果表明,通过该文提出的启发式算法得到的解与相对应的采用数学规划软件Lingo8.0得到的解之间的平均误差均小于1.89%.同时,启发式算法的计算时间远小于Lingo8.0所需的计算时间.