.png){kind=icon}
返回
Solving bus terminal location problems using evolutionary algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2010.01.019.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Bus terminal assignment with the objective of maximizing public transportation service is known as bus terminal location problem (BTLP). We formulate the BTLP, a problem of concern in transportation industry, as a p-uncapacitated facility location problem (p-UFLP) with distance constraint. The p-UFLP being NP-hard (Krarup and Pruzan, 1990), we propose evolutionary algorithms for its solution. According to the No Free Lunch theorem and the good efficiency of the distinctive preserve recombination (DPX) operator, we design a new recombination operator for solving a BTLP by new evolutionary and memetic algorithms namely, genetic local search algorithms (GLS). We also define the potential objective function (POF) for the nodes and design a new mutation operator based on POF. To make the memetic algorithm faster, we estimate the variation of the objective function based on POF in the local search as part of an operator in memetic algorithms. Finally, we explore numerically the performance of nine proposed algorithms on over a thousand randomly generated problems and select the best two algorithms for further testing. The comparative studies show that our new hybrid algorithm composing the evolutionary algorithm with the GLS outperforms the multistart simulated annealing algorithm. (c) 2010 Elsevier B. V. All rights reserved.
Keyword:
Bus terminal location problem
Evolutionary algorithm
Memetic algorithm
Transportation
Simulated annealing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
.png){kind=icon}
Neighborhood search heuristics for the uncapacitated facility location problem无能力设施选址问题的邻域搜索启发式方法
PREAI
分享收藏A hybrid multistart heuristic for the uncapacitated facility location problem用于无能力设施选址问题的混合多启动启发式方法
PREAI
分享收藏Genetic local search with distance preserving recombination operator for a vehicle routing problem
PREAI
分享收藏
查看更多内容