A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm

DOI10.1155/2013/375657zbMath1266.90115WikidataQ59005629 ScholiaQ59005629MaRDI QIDQ2375528

Menghao Xi, Zhong Yao, Feng Ye, Qiu Hong Zhao

Publication date: 14 June 2013

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/375657

Mathematics Subject Classification ID

90B50: Management decision making, including multiple objectives

Related Items

Metaheuristic algorithm for solving biobjective possibility planning model of location-allocation in disaster relief logistics

Uses Software

• BEAMR

Cites Work

• The \(p\)-median problem: a survey of metaheuristic approaches
• Variable neighbourhood search: methods and applications
• COBRA: A new formulation of the classic \(p\)-median location problem
• Variable neighborhood decomposition search
• The parallel variable neighborhood search for the \(p\)-median problem
• BEAMR: an exact and approximate model for the \(p\)-median problem
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Variable neighborhood search for the p-median
• Large neighborhood local search for the p-median problem
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• The Location of Emergency Service Facilities
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• The generalized maximal covering location problem