.png){kind=icon}
返回
Solving Transit Network Design Problem Using Many-Objective Evolutionary Approach
.png){kind=icon}
PRE
AI
DOI：10.1109/TITS.2018.2883511.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In many cities around the world, private vehicles are increasingly causing severe traffic congestion, pollution, and accidents. Public transports have been widely recognized as an effective way to improve urban life. To dissuade citizens from using private vehicles, it is necessary to design a practical, efficient, and economical public bus network. The transit network design problem (TNDP) determines the transit network (i.e., public bus network) for a city. It involves different stakeholders with diverse interests and values. To capture their conflicting expectations, numerous optimization objectives arise naturally. This paper introduces the TNDP as a many-objective optimization problem that generates a diverse set of alternative solutions. We apply several state-of-the-art many-objective evolutionary algorithms for the newly formulated TNDP. To efficiently explore the high-dimensional objective space of the TNDP, we develop problem-specific genetic operators for the evolutionary algorithm. We rigorously tested our approach on several benchmark datasets. The simulation results exhibit the effectiveness of the approach in addressing the challenges of a modern city. Based on the obtained results, we found theta-DEA to be the most robust among our employed algorithms. In addition, we observed the usefulness of the crossover operator, which randomly combines two solutions into one, and a simple mutation scheme, which is not biased to any objective function, to handle the many-objective nature of the TNDP.
Keyword:
Public transport
public bus network
transit network design problem
many-objective optimization
artificial intelligence
evolutionary algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.4
论文数:
9.5K
被引数:
6.3W
机构
引用论文
.png){kind=icon}
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
分享收藏
查看更多内容