A simulated annealing-based heuristic for the single allocation maximal covering hub location problem

Authors:
Mohamad Saeed Jabalameli;Farnaz Barzinpour;Ali Saboury;Nader Ghaffari-Nasab
Affiliations:
Department of Industrial Engineering, Iran University of Science and Technology, 16846-13114 Narmak, Tehran, Iran.;Department of Industrial Engineering, Iran University of Science and Technology, 16846-13114 Narmak, Tehran, Iran.;Department of Industrial Engineering, Iran University of Science and Technology, 16846-13114 Narmak, Tehran, Iran.;Department of Industrial Engineering, Iran University of Science and Technology, 16846-13114 Narmak, Tehran, Iran
Venue:
International Journal of Metaheuristics
Year:
2012

Citing 9
Cited 0

Avoiding local optima in the p-hub location problem using tabu search and grasp

Annals of Operations Research - Special issue on locational decisions
The Latest Arrival Hub Location Problem

Management Science
Solving the uncapacitated hub location problem using genetic algorithms

Computers and Operations Research
A hub covering model for cargo delivery systems

Networks - Special Issue on Multicommodity Flows and Network Design
Uncapacitated single and multiple allocation p-hub center problems

Computers and Operations Research
New simple and efficient heuristics for the uncapacitated single allocation hub location problem

Computers and Operations Research
A tabu-search based heuristic for the hub covering problem over incomplete hub networks

Computers and Operations Research
Hub Covering Location Problem under Capacity Constraints

AMS '10 Proceedings of the 2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation
Two artificial intelligence heuristics in solving multiple allocation hub maximal covering problem

ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.