Development Of Zero One Integer Programming Model For Optimizing The Number Of And Location Firefighter Station In North Aceh Distric

Authors

  • Muhammad Zakaria Department of Industrial Engineering, Malikussaleh University, Lhokseumawe, 24352, Aceh, Indonesia
  • Syarifuddin Abdullah Department of Industrial Engineering, Malikussaleh University, Lhokseumawe, 24352, Aceh, Indonesia

Keywords:

Firefighters Station, Integer Programming, Zero-One, Optimalizing

Abstract

Fires is a disaster that happened unexpectedly and caused huge losses in the form of casualties’ man and property. Fire is often unavoidable, which can be done is to minimize losses by establishing and providing firefighting facilities in the right area so as to reach the sub district center area in less than 15 minutes at the time of fire to extinguish the fire. At present North Aceh District has built 3 (three) fire stations to serve 27 sub-districts within its territory (Kantor Dinas Pemadam Kebakaran Kabupaten Aceh Utara). The existing fire stations are located in Alue Bili, District Nisam, District Landing Lhoksukon and Krung Mane, District Muara Batu. This study aims to determine the number and locations of the Optimal Firefighting Station within the district of North Aceh, which is a minimal number Stations but can reach all areas within the district of North Aceh. To achieve this goal, the method used is to model the problem into the Integer ZeroOne programming model, then completed with TORA windows® version 1.00 June 2002 by Taha H.. The implementations of the models produce the optimal solution is the minimum number of fire stations that must be built in North Aceh Regency is 6 stations so it needs to be added 3 more stations, with locations in the sub-district: Baktiya, Banda Baro, Cot Girek, Geureudong Pase, Kuta Makmur and Syamtalira Aron.

References

Syarifuddin; Muhammad; Deni Agustian; Muhammad Zeki; Optimasi Jumlah Stasiun emadam Kebakaran Di Pemerintahan Kota Lhokseumawe Dengan Denggunakan Metode Set Covering Problem, Prosiding Seminar Nasional teknologi Industri 2016, vol.5, ISSN: 2355-925X, Universitas Trisakti, Jakarta

Keputusan Menteri Negara Pekerjaan Umum Nomor : 11/KPTS/2000,” 2000.

Taha, Hamdy A, Operation Research ; An

Introduction, 7th Edition, Prentice Hall Education,

New Jersey, 2003

D. Gouwanda and S. Ponnambalam, “Evolutionary search techniques to solve set covering problems,” World Acad. Sci. Eng. Technol., vol. 39, pp. 20–25, 2008.

J.E. Beasley and P.C. Chu, “A genetic algorithm for the set covering problem”, European Journal of Operational Research, vol. 94, 1996, pp.392-404

J.E. Beasley, “An algorithm for set covering problem”, European Journal of Operational Research, vol. 31, 1987, pp 85-93

J.E. Beasley, “A Lagrangian heuristic for set covering problems”, Naval Research Logistics, Vol. 37, 1990, pp. 151-164

S. Haddadi, “Simple Lagrangian heuristic for the set covering problem”,European Journal of Operational Research, vol. 97, 1997, pp 200-204

U. Aickelin, “An indirect genetic algorithm for set covering problem”Journal of Operational Research Society, vol. 53, 2002, pp. 1118-1126

A. Monfroglio, “Hybrid heuristic algorithm for set covering”,Computers Operational Research, vol. 25, 1998, pp. 441-445

J.F. Vasko and F.E. Wolf, “ A heuristic concentration approach for weighted set covering problems”, Locator: ePublication of Location Analysis, vol. 2, 2001, no. 1, pp. 1-14

Ariifah, , Eka Mukti. 2009, Penyelesaian Set Cover

Problem dengan Algoritma Greedy

http://informatika.stei.itb.ac.id/~rinaldi.mu nir/Stmik/2009-2010/Makalah2009/ MakalahIF3051-2009-008.pdf, accessed August 27, 2017)

http://www1- media.acehprov.go.id/uploads/ACEH_UTARA.pd

Downloads

Published

2018-12-31