A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
by Mohamad Saeed Jabalameli; Farnaz Barzinpour; Ali Saboury; Nader Ghaffari-Nasab
International Journal of Metaheuristics (IJMHEUR), Vol. 2, No. 1, 2012

Abstract: Hub location problem is one of the most important problems in the areas of logistics and telecommunication network design. In this paper, we address the single allocation maximal covering hub location problem in which the objective is to maximise the amount of covered flows associated with origin-destination pairs in a hub-and-spoke network using a fixed number of hub facilities. Two mathematical programming formulations are developed for the problem and since the problem belongs to the class of NP-hard problems, an efficient simulated annealing (SA)-based heuristic is proposed to solve it. Computational results indicate the efficiency of the proposed heuristic both in terms of solution quality and CPU time.

Online publication date: Wed, 22-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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