A simple search heuristic for the maximal covering location problem: Application to the location of ambulance bases in a rural region

A simple search heuristic for the maximal covering location problem: Application to the location of ambulance bases in a rural region

0.00 Avg rating0 Votes
Article ID: iaor19982766
Country: United Kingdom
Volume: 25
Issue: 2
Start Page Number: 181
End Page Number: 187
Publication Date: Apr 1997
Journal: OMEGA
Authors: ,
Keywords: location
Abstract:

In the location of ambulance bases for medical assistance, an adequate time of response must be guaranteed for each area in the region covered, incurring the minimum operating costs. Several linear models (such as the maximal covering location problem) have been developed for designing these emergency systems which guarantee a certain cover whilst minimising determined costs. The computational difficulty involved in resolving large scale problems occasionally means trying to offer solutions using metaheuristics. This article presents the solution to the problem of locating ambulance bases in the province of León (Spain), using the tabu search metaheuristic, which in its simplest version already offers good results, and which makes it a tool to be kept very much in mind when a rapid solution is needed to such problems.

Reviews

Required fields are marked *. Your email address will not be published.