A Bionomic Approach to the Capacitated p-Median Problem
Journal of Heuristics
A hybrid grouping genetic algorithm for the registration area planning problem
Computer Communications
A new representation and operators for genetic algorithms applied to grouping problems
Evolutionary Computation
Heuristic Solutions for Locating Health Resources
IEEE Intelligent Systems
Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
A new grouping genetic algorithm approach to the multiple traveling salesperson problem
Soft Computing - A Fusion of Foundations, Methodologies and Applications
A hybrid grouping genetic algorithm for assigning students to preferred laboratory groups
Expert Systems with Applications: An International Journal
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
A grouping genetic algorithm for the microcell sectorization problem
Engineering Applications of Artificial Intelligence
Optimal scheduling of multiple dam system using harmony search algorithm
IWANN'07 Proceedings of the 9th international work conference on Artificial neural networks
Harmony search algorithm for solving Sudoku
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part I
Computers and Operations Research
Harmony search in water pump switching problem
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
A hybrid harmony search algorithm for the spread spectrum radar polyphase codes design problem
Expert Systems with Applications: An International Journal
Engineering Applications of Artificial Intelligence
Survey A survey on applications of the harmony search algorithm
Engineering Applications of Artificial Intelligence
| Hi-index | 12.05 |
This paper presents a novel multi-objective heuristic approach for the efficient distribution of 24-h emergency units. This paradigm is essentially a facility location problem that involves determining the optimum locations, within the existing health care centers, where to deploy 24-h emergency resources, as well as an efficient assignment of patients to such newly placed resources through the existing medical care infrastructure. The formulation of the underlying NP-complete problem is based on a bi-objective distance and cost metric, which is tackled in our approach by combining a Harmony Search algorithm with a grouping encoding and a non-dominated solution sorting strategy. Additionally, the nominal grouping encoding procedure has been redefined in order to reduce the dimension of the search space, thus allowing for a higher efficiency of the searching process. Extensive simulations in a real scenario - based on the geographic location of medical centers over the provinces of Guadalajara and Cuenca (Spain) - show that the proposed algorithm is statistically robust and provides a wide range of feasible solutions, hence offering multiple alternatives for the distribution of emergency units.