{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T14:29:31Z","timestamp":1749047371912,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030009786"},{"type":"electronic","value":"9783030009793"}],"license":[{"start":{"date-parts":[[2018,9,28]],"date-time":"2018-09-28T00:00:00Z","timestamp":1538092800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-00979-3_56","type":"book-chapter","created":{"date-parts":[[2018,9,27]],"date-time":"2018-09-27T08:55:41Z","timestamp":1538038541000},"page":"531-538","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Path-Relinking for Fire Station Location"],"prefix":"10.1007","author":[{"given":"Titima","family":"Srianan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ornurai","family":"Sangsawang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,28]]},"reference":[{"issue":"1","key":"56_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01942293","volume":"32","author":"R Church","year":"1974","unstructured":"Church, R., Velle, C.R.: The\u00a0maximal covering location problem. Pap. Reg. Sci. 32(1), 101\u2013118 (1974)","journal-title":"Pap. Reg. Sci."},{"issue":"3","key":"56_CR2","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","volume":"32","author":"Morton E. O'kelly","year":"1987","unstructured":"O\u2019kelly, M.E.: A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32(3), 393\u2013404 (1986)","journal-title":"European Journal of Operational Research"},{"key":"56_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0377-2217(94)90318-2","volume":"72","author":"JF Campbell","year":"1994","unstructured":"Campbell, J.F.: Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72, 1\u201319 (1994)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"56_CR4","first-page":"243","volume":"25","author":"P Srikijakarn","year":"2015","unstructured":"Srikijakarn, P., Chanta, S.: Determining appropriate emergency medical service unit locations by considering severity of patient\u2019s condition: a case study in Muang district, Prachin Buri province. J. KMUTNB 25(2), 243\u2013254 (2015)","journal-title":"J. KMUTNB"},{"key":"56_CR5","unstructured":"Lomnak, N., Limsuwan, T., Samorngarm C., Chanta, S..: Improving emergency medical service: a case study Chao Praya Abhaibhubejhr Hospital. In: The 2015 Operations Research Network of Thailand, pp. 42\u201447. Bangkok (2015)"},{"key":"56_CR6","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.ijdrr.2017.01.017","volume":"24","author":"C Boonmee","year":"2017","unstructured":"Boonmee, C., Arimura, M., Asada, T.: Facility location optimization model for emergency humanitarian logistics. Int. J. Disaster Risk Reduct. 24, 485\u2013498 (2017)","journal-title":"Int. J. Disaster Risk Reduct."},{"key":"56_CR7","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.firesaf.2013.03.002","volume":"62","author":"AT Murray","year":"2013","unstructured":"Murray, A.T.: Optimising the spatial location of urban fire stations. Fire Saf. J. 62, 64\u201371 (2013)","journal-title":"Fire Saf. J."},{"key":"56_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.seps.2012.02.003","volume":"46","author":"P Chevalier","year":"2012","unstructured":"Chevalier, P., Thomas, I., Geraets, D., Goetghebeur, E., Janssens, O., Peeters, D., Plastria, F.: Locating fire stations: an integrated approach for Belgium. Socio-Econ. Plan. Sci. 46, 173\u2013182 (2012)","journal-title":"Socio-Econ. Plan. Sci."},{"key":"56_CR9","unstructured":"Glover, F., Laguna, M.: Tabu search, modern heuristic techniques for combinatorial problems. In: Reeves, C. (ed.) pp. 70\u2013150. Blackwell Scientific Publishing, Oxford (1993)"},{"key":"56_CR10","doi-asserted-by":"crossref","unstructured":"P\u00e9rez, M.P., Rodr\u00edguez, F.A., Vega, J.M.: On the use of the path relinking for the p-hub median problem. Lecture Notes in Computer Science, pp. 155\u2013164 (2004)","DOI":"10.1007\/978-3-540-24652-7_16"},{"key":"56_CR11","doi-asserted-by":"publisher","first-page":"1890","DOI":"10.1016\/j.camwa.2008.10.004","volume":"57","author":"B Qu","year":"2009","unstructured":"Qu, B., Weng, K.: Path relinking approach for multiple allocation hub maximal covering problem. Comput. Math Appl. 57, 1890\u20131894 (2009)","journal-title":"Comput. Math Appl."},{"key":"56_CR12","unstructured":"Srianan, T., Sangsawang, O., Chanta, S.: Path-relinking for high-speed rail station location. In: The 2016 operations research network of Thailand, pp. 259\u2013265. Nakorn Ratchasima (2017)"},{"issue":"1","key":"56_CR13","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.engappai.2011.09.012","volume":"25","author":"VP Nguyen","year":"2012","unstructured":"Nguyen, V.P., Prins, C., Prodhon, C.: A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem. Eng. Appl. Artif. Intell. 25(1), 56\u201371 (2012)","journal-title":"Eng. Appl. Artif. Intell."}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Computing & Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00979-3_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T20:15:04Z","timestamp":1571948104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00979-3_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,28]]},"ISBN":["9783030009786","9783030009793"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00979-3_56","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2018,9,28]]},"assertion":[{"value":"ICO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing & Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pattaya","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ico2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icico.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}