A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem
Authors:
- Jian GuanJGJian Guan
- Geng LinGLGeng Lin
- Hui-Bin FengHFHui-Bin Feng
- 1 October 2018
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 98, 1-12
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (11301255)
- Natural Science Foundation of Fujian Province (2017J01767)
This publication has 28 references indexed in Scilit:
- An efficient tabu search for solving the uncapacitated single allocation hub location problemComputers & Industrial Engineering, 2016
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problemOptimization Letters, 2015
- A hybridization of an evolutionary algorithm and a parallel branch and bound for solving the capacitated single allocation hub location problemApplied Soft Computing, 2015
- A general variable neighborhood search for solving the uncapacitated $r$ r -allocation $p$ p -hub median problemOptimization Letters, 2015
- Hub location problems: A review of models, classification, solution techniques, and applicationsComputers & Industrial Engineering, 2013
- An efficient memetic algorithm for the uncapacitated single allocation hub location problemSoft Computing, 2012
- New simple and efficient heuristics for the uncapacitated single allocation hub location problemComputers & Operations Research, 2009
- Improved Tabu search heuristics for the dynamic space allocation problemComputers & Operations Research, 2008
- Two genetic algorithms for solving the uncapacitated single allocation p-hub median problemEuropean Journal of Operational Research, 2007
- Solving the uncapacitated hub location problem using genetic algorithmsComputers & Operations Research, 2005