Lociranje opasnih materija sa konstantnim i promenljivim radijusima uticaja
Sažetak
Donošenje odluka o prostornom raspoređivanju opasnih materija neophodno je zbog minimiziranja rizika po okolinu. U ovom radu razmatran je problem lociranja različitih vrsta opasnih materija (sa različitim karakteristikama). One mogu biti locirane unutar poznatog diskretnog skupa potencijalnih lokacija skladišta, pod uslovom da budu zadovoljena minimalna bezbednosna rastojanja između odabranih lokacija. Minimalno bezbednosno rastojanje je posledica postojanja verovatnoće da opasne materije neželjeno deluju na objekte u okolini. Cilj je da se istovremeno maksimizira uskladištena količina različitih opasnih materija, vodeći računa o minimalnim bezbednosnim rastojanjima. Za neke opasne materije minimalno bezbednosno rastojanje je konstantna vrednost, koja zavisi samo od karakteristika opasnih materija. Sa druge strane, minimalno bezbednosno rastojanje može da varira u zavisnosti od količine opasne materije i njenih ostalih karakteristika. Za ova dva tipa minimalnih bezbednosnih rastojanja predloženi su modeli mešovitog celobrojnog programiranja. Ovi modeli zasnovani su na lokacijskom problemu nepokrivanja, pa se mogu tretirati i kao njegova modifikacija i proširenje. Verifikacija modela sprovedena je i ilustrovana na generisanom hipotetičkom primeru čiji su rezultati prikazani.
Reference
AFMAN 91-201. 2011. Department of the Air Forces, United States of America: Explosives Safety Standards, Available on Web site: www.e-publishing.af.mil
Balas, E., Yu, C., 1986. Finding a maximum clique in an arbitrary graph. SIAM Journal on Computing, 15, 1054-1068.
Barahona, F., Weintraub, A., Epstein, R., 1992. Habitat dispersion in forest planning and the stable set problem. Operations Research, 40, I S14-S21.
Berman, O., Drezner, Z., 2000. A note on the location of an obnoxious facility on a network. European Journal of Operational Research, 120, 215–217.
Berman, O., Drezner, Z., Wesolowsky, G.O., 1996. Minimum covering criterion for obnoxious facility location on a network. Networks, 28, 1–5.
Berman, O., Drezner, Z., Wesolowsky, G.O., 2003. The expropriation location problem. Journal of Operational Research Society, 54, 769–776.
Berman, O., Huang, R., 2008. The minimum weighted covering location problem with distance constraints. Computers & Operations Research, 35, 356–372.
Brimberg, J., Wesolowsky, G., 1995. The rectilinear distance minisum problem with minimum distance constraints. Location Science, 3, 203-215.
Carrizosa, E., Tóth, G. B., 2015. Anti-covering problems. Location Science, 115-132.
Chaudhry, S.S., 2006. A genetic algorithm approach to solving the anti-covering location problem. Expert Systems, 23, 251- 257.
Chaudhry, S., McCormick, S.T., Moon, I.D., 1986. Locating independent facilities with maximum weight: greedy heuristics. Omega, 14, 383-389.
Church, R.L., 2013. Identification and mapping of habitat cores. In F. L. Craighead, & C. L. Convis Jr. (Eds.), Conservation planning: shaping the future (1 ed., pp. 219-244). Redlands, California, USA: ESRI Press.
Church, R.L., Garfinkel, R.S., 1978. Locating an obnoxious facility on a network. Transportation Science, 12, 107–118.
Cravo, G.L., Ribeiro, G.M., Lorena, L.A., 2008. A greedy randomized adaptive search procedure for the point-feature cartographic label placement. Computers & Geosciences, 34(4), 373-386.
Curtin, K.M., Church, R.L., 2006. A family of location models for multiple-type discrete dispersion. Geographical Analysis, 38, 248-270.
Dimitrijević, B., Teodorović, D., Simić, V., Šelmić, M., 2012. Bee Colony Optimization Approach to Solving the Anticovering Location Problem. Journal of Computing in Civil Engineering, 26, 759–768.
Dimitrijević, B., Nikolić, M., Vukićević, I., Vukadinović, K., 2013. Locating Undesirable Facilities with Variable Coverage Radius, Proceedings of the XI Balkan Conference on Operational Research – BALCOR 2013, 524-531.
Downs, J.A., Gates, R.J., Murray, A.T., 2008. Estimating carrying capacity for sandhill cranes using habitat suitability and spatial optimization models. Ecological Modeling, 214, 284-292.
Drezner Z, Wesolowsky G., 1980. A maximin location problem with maximum distance constrains. AIIE Transaction, 12, 249–252.
Drezner, Z., Wesolowsky, G.O., 1994. Finding the circle or rectangle containing the minimum weight of points. Location Science, 2, 83–90.
Erkut, E., Neuman, S., 1989. Analytical models for locating undesirable facilities. European Journal of Operational Research, 40, 275–291.
Erkut, E., Neuman, S., 1991. Comparison of four models for dispersing facilities. INFOR, 29, 68-86.
Farahani, R.Z., Asgari, N., Heidari, N., Hosseininia, M., Goh, M., 2012. Covering problems in facility location: A review. Computers & Industrial Engineering, 62, 368–407.
Garey, M., Johnson, D., 1979. Computers and Intractability: A guide to the Theory of NP, Completeness, Freeman and Company, New York
Grubesic, T.H., Murray, A. T., 2008. Sex offender residency and spatial equity. Applied Spatial Analysis and Policy, 1(3), 175-192.
Grubesic, T.H., Murray, A. T., Pridemore, W. A., Tabb, L. P., Liu, Y., Wei, R., 2012. Alcohol beverage control, privatization and the geographic distribution of alcohol outlets. BioMed Central, 12(1015), 1-10.
Kuby, M.J., 1987. Programming models for facility dispersion: the p-dispersion and maximum dispersion problem. Geographical Analysis, 19, 315–329.
Lei, T.L., Church, R. L., 2013. A Unified Model for Dispersing Facilities. Geographical Analysis, 45, 401-418.
Moon, I.D., Chaudhry, S., 1984. An analysis of network location problems with distance constraints. Management Science, 30, 290–307.
Murray, A.T., Church, R.L., 1997. Solving the anti-covering location problem using Lagrangian relaxation. Computers & Operations Research, 24, 127–140.
Niblett, M.R., 2014. The Disruptive Anti-Covering Location Problem: new modeling perspectives and solution approaches. Dissertation, University of California, Santa Barbara
Plastria, F., Carrizosa, E., 1999. Undesirable facility location with minimal covering objectives. European Journal of Operational Research, 119, 158–180.
Ribeiro, G.M., Lorena, L. A., 2008. Column generation approach for the pointfeature cartographic label placement problem. Journal of Combinatorial Optimization, 15(2), 147-164.
Tamir, A., 1991: Obnoxious facility location on graphs. SIAM Journal of Discrete Mathematics 4, 550–567.
Williams, J.C., 2008. Optimal reserve site selection with distance requirements. Computers & Operations Research, 35(2), 488-498.
Vojnotehnički glasnik omogućava otvoreni pristup i, u skladu sa preporukom CEON-a, primenjuje Creative Commons odredbe o autorskim pravima:
Autori koji objavljuju u Vojnotehničkom glasniku pristaju na sledeće uslove:
- Autori zadržavaju autorska prava i pružaju časopisu pravo prvog objavljivanja rada i licenciraju ga Creative Commons licencom koja omogućava drugima da dele rad uz uslov navođenja autorstva i izvornog objavljivanja u ovom časopisu.
- Autori mogu izraditi zasebne, ugovorne aranžmane za neekskluzivnu distribuciju rada objavljenog u časopisu (npr. postavljanje u institucionalni repozitorijum ili objavljivanje u knjizi), uz navođenje da je rad izvorno objavljen u ovom časopisu.
- Autorima je dozvoljeno i podstiču se da postave objavljeni rad onlajn (npr. u institucionalnom repozitorijumu ili na svojim internet stranicama) pre i tokom postupka prijave priloga, s obzirom da takav postupak može voditi produktivnoj razmeni ideja i ranijoj i većoj citiranosti objavljenog rada (up. Efekat otvorenog pristupa).