Skip to Main content Skip to Navigation
Journal articles

Parallel VNS for Bus Terminal Location Problem

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03400628
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 10:06:03 AM
Last modification on : Wednesday, November 3, 2021 - 5:24:20 AM

Identifiers

Collections

Citation

Aleksandar Djenić, Nina Radojičić, Miroslav Marić, Marko Mladenovic. Parallel VNS for Bus Terminal Location Problem. Applied Soft Computing, Elsevier, 2016, 42, pp.448-458. ⟨10.1016/j.asoc.2016.02.002⟩. ⟨hal-03400628⟩

Share

Metrics

Record views

5