Başar, Ayfer and Çatay, Bülent and Ünlüyurt, Tonguç (2009) A new model and tabu search approach for planning the emergency service stations. In: Annual International Conference of the German Operations Research Society, 2008, Augsburg, Germany
This is the latest version of this item.
PDF (This is a RoMEO green publisher -- author can archive post-print (ie final draft post-refereeing))
a_new_model.pdf
Download (391kB)
a_new_model.pdf
Download (391kB)
Official URL: http://dx.doi.org/10.1007/978-3-642-00142-0_7
Abstract
The location planning of emergency service stations is crucial, especially in the populated cities with heavy tra±c 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 di®erent 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 di®erent parameters to demonstrate the e®ectiveness of the proposed algorithm. Finally, we apply our TS approach for planning the emergency service stations in Istanbul.
Item Type: | Papers in Conference Proceedings |
---|---|
Subjects: | T Technology > T Technology (General) |
Divisions: | Faculty of Engineering and Natural Sciences Faculty of Engineering and Natural Sciences > Academic programs > Manufacturing Systems Eng. |
Depositing User: | Bülent Çatay |
Date Deposited: | 10 Nov 2009 14:35 |
Last Modified: | 26 Apr 2022 08:52 |
URI: | https://research.sabanciuniv.edu/id/eprint/12608 |
Available Versions of this Item
-
A new model and tabu search approach for planning the emergency service stations. (deposited 24 Oct 2008 10:51)
- A new model and tabu search approach for planning the emergency service stations. (deposited 10 Nov 2009 14:35) [Currently Displayed]