摘要
公交线网规划是城市交通规划的重要组成部分之一。针对公交线网规划问题,提出一种多目标的公交线网规划模型,以最小化乘客总出行时间和总换乘次数,最大化线网的需求密度为目标函数。利用禁忌搜索和模拟退火两种算法对模型进行求解,并利用Sioux-falls network对模型进行验证。结果表明:与前人的研究相比,本模型的结果直达率提高,换乘次数减少,公交的服务水平和吸引力提高;本研究的两种算法相比,模拟退火所得结果直达率更高,需求密度更大,并且此算法效率更高。说明本模型能够有效的适用于公交线网的规划。
Transit network planning is one of the important parts of urban traffic planning. A multi-objective programming model for public transit network was proposed to address the transit network planning problem. The objective function of the proposed model was to minimize the total travel time and the total numbers of transfers as well as to maximize the demand density of the network. Taboo search and simulated annealing algorithms were used to solve the proposed model. The proposed model and algorithms were tested by using the Sioux-falls network. The results show that compared with previous studies,the results of the proposed model have higher nonstop ratio,less transfer times,better service level and attractiveness of public transport. Compared with the taboo search algorithm,the simulated annealing results have higher nonstop ratio,larger demand density and higher efficiency. Therefore,the proposed model can be effectively applied to the planning of public transport network.
出处
《重庆交通大学学报（自然科学版）》
CAS
北大核心
2017年第12期102-109,共8页
Journal of Chongqing Jiaotong University(Natural Science)
基金
国家自然科学基金项目(41271181)
广东省科技计划项目(2015B010110005)
关键词
交通工程
城市交通
公交线网规划
禁忌搜索
模拟退火
公交网络
traffic engineering
urban traffic
transit network planning
taboo search
simulated annealing
transit network
