A simulated annealing-based heuristic for the single allocation maximal covering hub location problem (Q2256914)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A simulated annealing-based heuristic for the single allocation maximal covering hub location problem |
scientific article |
Statements
A simulated annealing-based heuristic for the single allocation maximal covering hub location problem (English)
0 references
23 February 2015
0 references
Summary: 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.
0 references
logistics
0 references
telecommunications
0 references
network design
0 references
hub location
0 references
maximal covering
0 references
simulated annealing
0 references
metaheuristics
0 references