A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
From MaRDI portal
Publication:2256914
DOI10.1504/IJMHEUR.2012.048213zbMath1306.90074MaRDI QIDQ2256914
Farnaz Barzinpour, Ali Saboury, Mohamad Saeed Jabalameli, Nader Ghaffari-Nasab
Publication date: 23 February 2015
Published in: International Journal of Metaheuristics (Search for Journal in Brave)
metaheuristicssimulated annealingnetwork designtelecommunicationslogisticsmaximal coveringhub location
Multi-objective and goal programming (90C29) Communication networks in operations research (90B18) Discrete location and assignment (90B80)
Related Items (5)
Competitive multiple allocation hub location problem considering primary and backup routes ⋮ Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
This page was built for publication: A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
