A New Model and Tabu Search Approach for Planning the Emergency Service Stations
Ayfer Başar (),
Bülent Çatay () and
Tonguç Ünlüyurt ()
Additional contact information
Ayfer Başar: Sabanci University
Bülent Çatay: Sabanci University
Tonguç Ünlüyurt: Sabanci University
Chapter 7 in Operations Research Proceedings 2008, 2009, pp 41-46 from Springer
Abstract:
Summary The location planning of emergency service stations is crucial, especially in the populated cities with heavy trafic conditions such as Istanbul. In this paper, we propose a Backup Double Covering Model (BDCM), a variant of the well-known Maximal Covering Location Problem, that requires two types of services to plan the emergency service stations. The objective of the model is to maximize the total population serviced using two distinct emergency service stations in different time limits where the total number of stations is limited. We propose a Tabu Search (TS) approach to solve the problem. We conduct an extensive experimental study on randomly generated data set with different parameters to demonstrate the effectiveness of the proposed algorithm. Finally, we apply our TS approach for planning the emergency service stations in Istanbul.
Keywords: Tabu Search; Problem Instance; Emergency Medical Service; Tabu List; Demand Point (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-00142-0_7
Ordering information: This item can be ordered from
http://www.springer.com/9783642001420
DOI: 10.1007/978-3-642-00142-0_7
Access Statistics for this chapter
More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().