基于禁忌搜索的公共自行车站点及车道选址优化

Research of optimal layout of public bike stations and bike lanes based on tabu search

为提高公共交通系统的吸引力,从公共自行车和公交车接驳的角度,提出以公交站点为中心的公共自行车选址及自行车道设置的网络构建问题。首先,建立以最大化满足用户需求量为优化目标的非线性优化模型,并与只考虑站点选址的传统模型进行比较分析;在分析问题基础上,构造基于问题特性的邻域结构和邻域解生成准则,并最终设计基于禁忌搜索的问题求解方法。通过MATLAB编程进行仿真实验测试大量算例,结果表明所设计算法能够高效地求解各类规模算例,并给出高质量的公共自行车网络构建近似最优方案;此外,敏感性分析实验为规划者制定决策方案提供参考依据。

To improve the attractiveness of public transportation system,optimal network layout of the public bike stations and bike lanes was studied from the point of view of transferring between buses and public bikes.In this paper,a nonlinear optimization model with the objective of maximizing the users’demand was formulated,and it was compared with the traditional location model.Based on the special designed neighborhood and its generation criterion,a tabu-search-based algorithm was proposed to solve the problem.Then simulation experiments by MATLAB program were conducted and the computational results show that the proposed algorithm efficiently solves different-sized instances and obtains high quality solutions for the network layout of public bicycle system.Furthermore,results of the sensitive experiments can provide useful information for planners’decision-making.