首页|Tabu search and variable neighborhood search algorithms for solving interval bus terminal location problem[Formula presented]
Tabu search and variable neighborhood search algorithms for solving interval bus terminal location problem[Formula presented]
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
Recently, Ghanbari and Mahdavi-Amiri (2011) have proposed a model for the bus terminal location problem. Here, we want to improve Ghanbari and Mahdavi-Amiri's model by defining three types of neighborhoods for each terminal. In our model, we consider a neighbor for each terminal, so the cost of service to stations in a neighborhood is individual. The proposed model is an NP-hard problem, so we suggest two algorithms based on the Tabu search and variable neighborhood search for solving it. Due to the Mann–Whitney and Dolan–Moré performance profiles, we use the recently proposed nonparametric statistical test to access the performance of numerical algorithms and demonstrate the efficiency of our proposed approach in comparison with other available methods.
Bus terminal location problemMetaheuristic algorithmService functionTabu searchVariable neighborhood search
Rahdar S.、Ghanbari R.、Ghorbani-Moghadam K.
展开 >
Ferdowsi University of Mashhad
Faculty of Mathematical Sciences Department of Applied Mathematics Ferdowsi University of Mashhad
Member of Optimization Laboratory in Faculty of Mathematical Sciences Department of Applied Mathematics Ferdowsi University of Mashhad
NSTL
Elsevier
