.png){kind=icon}
返回
A heuristic aided Stochastic Beam Search algorithm for solving the transit network design problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2019.02.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Designing efficient routes for a transit network is one of the main problems faced by city planners of the world. Due to the largeness and complexity of modem day road networks it is impossible to make a good route design manually. So, at present computer algorithms are used to design the routes. Designing routes for transit network is a multi-criteria decision making problem which has to search a large solution space to find an optimal solution. This paper presents a novel heuristic that can quickly generate good solutions. Also we propose a Stochastic Beam Search algorithm with a heuristic inspired successor operator. We conduct extensive experiments on some benchmark datasets and perform statistical tests on the results. We show that our algorithm can successfully explore the search space. Also we compare our results with previous studies and show that our algorithms produce superior results. In particular, for large datasets, the solutions generated by our heuristic in less than a second turn out to be better than solutions generated in two hours by the state of the art algorithm.
Keyword:
MULTIOBJECTIVE OPTIMIZATION
GENETIC ALGORITHM
EVOLUTIONARY
FREQUENCIES
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms关于使用非参数统计检验作为比较进化和群体智能算法的方法的实用教程
PREAI
分享收藏分享收藏
查看更多内容