大型运动会专用道设置的交通规划模型

Integer Programming Model for Lane Reservation-Based Transportation Planning of Large Sportive Games

大型运动会要求主办方在规定时间内将指定人员从运动员村运送到指定比赛场馆。为满足运送时间的要求,通常采用设置专用通道的方法。在满足运送时间的条件下,需要最小化设置专用通道的总成本。提出一个新的交通问题:大型运动会专用道设置的动态交通规划问题。本文为该问题建立了能反映实际问题的数学规划模型。该模型是一个整数非线性规划模型。通过对非线性模型的线性化,可以得到一个整数线性规划模型,并通过数学规划软件求解该线性模型。以广州亚运会为例,详细介绍并分析了对于该问题的建模与求解过程。

In large sportive games, it needs to deliver special people from sportive villages to stadiums with strict time constraint. To make such constraint satisfied, often lane reservation strategy is applied. It needs to minimize costs resulting from lane reservation such that the time constraint is satisfied. This gives rise to a new transportation problem called transportation planning problem based on lane reservation. A mathematical programming model is developed for this problem. It is essentially an integer non-linear programming model. By linearization, an integer linear programming model is obtained such that it can be solved by standard software package. With 2010 Guangzhou Asian Games as example, it is shown how the problem can be modelled and solved.