An Accessibility Driven Evolutionary Transit Network Design Approach in the Multi-agent Simulation Environment

An Accessibility Driven Evolutionary Transit Network Design Approach in the Multi-agent Simulation Environment
复制标题

DOI:
10.1016/j.procs.2018.08.255
复制
发表时间:
2018
期刊:
Procedia Computer Science
影响因子:
--
通讯作者:
Timofey Volotskiy;J. Smirnov;Dominik Ziemke;Ihab Kaddoura
Timofey Volotskiy;J. Smirnov;Dominik Ziemke;Ihab Kaddoura
中科院分区:
其他
文献类型:
--
作者:
Timofey Volotskiy;J. Smirnov;Dominik Ziemke;Ihab Kaddoura

文献摘要

相似文献

这项工作探讨了在公共交通网络设计优化过程中使用的可达性测量作为输入的可行性。针对现有的公交网络优化的并行进化方法,将社会效益以可达性改善的形式内在化,提出了多智能体仿真环境(MATSim)的扩展,并在一定数量的场景下进行了测试。新算法衡量微观层面上不同类型的景点或活动的可达性的不平等,并计算补贴,然后将其引入系统中,作为辅助运营商为低可达性区域提供服务的激励。该算法还通过在新补贴路线启动期间从可能的终点站进行加权绘制,为运营商提供低可达性区域所在位置的指导。测试结果表明,本文提出的算法能够持续改善贫困地区的可达性,构建可持续的补贴路线,而利润导向的辅助出行算法则无法找到1.
This work explores the feasibility of using the accessibility measurements as an input in the public transit network design optimisation process. An existing paratransit-inspired evolutionary approach to the transit network optimization is extended to internalize the social benefits in the form of the accessibility improvements.The extension for the multi-agent simulation environment (MATSim) is proposed and tested within the number of scenarios. The novel algorithm measures inequalities in the accessibility of different types of attractions or activities on the microscopic level and calculates the subsidy, which is then introduced in the system as an incentive for paratransit operators to serve the low-accessibility zones. The algorithm also provides operators guidance on where the low accessibility zones are located, by performing weighted draw from the possible end stops during the initiation of new subsidized routes. Furthermore authors propose an approach to gradually optimize the level of provided subsidy.The results of the tests show that the proposed algorithm consistently improves the accessibility of deprived zones, building the sustainable subsidized routes, which the profit-oriented paratransit algorithm is not able to find1.