.png){kind=icon}
返回
Parallel VNS for Bus Terminal Location Problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2016.02.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers the Bus Terminal Location Problem (BTLP) which incorporates characteristics of both the p-median and maximal covering problems. We propose a parallel variable neighborhood search algorithm (PVNS) for solving BTLP. Improved local search, based on efficient neighborhood interchange, is used for the p-median problem, and is combined with a reduced neighborhood size for the maximal covering part of the problem. The proposed parallel algorithm is compared with its non-parallel version. Parallelization yielded significant time improvement in function of the processor core count. Computational results show that PVNS improves all existing results from the literature, while using significantly less time. New larger instances, based on rl instances from the TSP library, are introduced and computational results for those new instances are reported. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Combinatorial optimization
Bus Terminal Location Problem
Variable neighborhood search
Metaheuristic
Parallelization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Injury-Dependent and Disability-Specific Lumbar Spinal Gene Regulation following Sciatic Nerve Injury in the Rat大鼠坐骨神经损伤后损伤依赖性和残疾特异性腰椎基因调控.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容