SOLVING FIRE DEPARTMENT STATION LOCATION PROBLEM USING MODIFIED BINARY GENETIC ALGORITHM: A CASE STUDY OF SAMSUN IN TURKEY

  • Irfan Maci Industrial Engineering Department, Çukurova University, Adana, Turkey

Abstract

Fire and traffic accident are the most common problem in our daily lives. Fire department location for the purpose of easy response and recovery is a significant problem today. The best location of a fire department station determines the rate of recovery of many injured people after traffic accident, fire outbreak, and so on. In this paper, we considered the best location of fire stations. In addition, we also considered where the station is setup. Surveying problem is modeled as a mixed integer programming. It is solved by modified binary genetic algorithm, coding with GAMS. Modified binary GA is different from known GA with respect to binary decision variables. Due to this problem, initial value of the objective function was obtained from known GA. Then finally, the best result was achieved from binary GA.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...
Published
2015-10-29
How to Cite
Maci, I. (2015). SOLVING FIRE DEPARTMENT STATION LOCATION PROBLEM USING MODIFIED BINARY GENETIC ALGORITHM: A CASE STUDY OF SAMSUN IN TURKEY. European Scientific Journal, ESJ, 11(30). Retrieved from https://eujournal.org/index.php/esj/article/view/6347