Landscape analysis and scatter search metaheuristic for solving the uncapacitated single allocation hub location problem Online publication date: Mon, 17-Jul-2017
by Hossein Akbaripour; Ellips Masehian; Ali Roostaei
International Journal of Industrial and Systems Engineering (IJISE), Vol. 26, No. 4, 2017
Abstract: In this paper, solution space landscapes of the uncapacitated single allocation hub location problem (USAHLP) for the well-known CAB and AP benchmark datasets are investigated and analysed through several statistical criteria. The analyses show that both datasets have rugged landscapes, and the optimal solutions are concentrated in the search space of the CAB dataset while they are uniformly distributed in the search space of the AP dataset. It follows that in order for a method to find good solutions to the USAHLP, it should perform both proper exploitation and exploration of the workspace. Based on the landscape analysis, an efficient scatter search-based heuristic method called SSUHLP is tailored for solving the USAHLP. The performance of the SSUHLP is evaluated by solving all problems of the CAB and AP datasets and comparing them with some existing algorithms in the literature.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook