{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T22:41:02Z","timestamp":1769553662838,"version":"3.49.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030227401","type":"print"},{"value":"9783030227418","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22741-8_24","type":"book-chapter","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T15:02:45Z","timestamp":1559919765000},"page":"332-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimizing Spatial Accessibility of Company Branches Network with Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0145-5010","authenticated-orcid":false,"given":"Oleg","family":"Zaikin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2722-312X","authenticated-orcid":false,"given":"Ivan","family":"Derevitskii","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6025-0552","authenticated-orcid":false,"given":"Klavdiya","family":"Bochenina","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2645-0037","authenticated-orcid":false,"given":"Janusz","family":"Holyst","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.5121\/ijcsea.2015.5102","volume":"5","author":"L Abualigah","year":"2015","unstructured":"Abualigah, L., Hanandeh, E.: Applying genetic algorithms to information retrieval using vector space model. Int. J. Comput. Sci. Eng. Appl. 5, 19\u201328 (2015). https:\/\/doi.org\/10.5121\/ijcsea.2015.5102","journal-title":"Int. J. Comput. Sci. Eng. Appl."},{"key":"24_CR2","unstructured":"Allahi, S., Mobin, M., Vafadarnikjoo, A., Salmon, C.: An integrated AHP-GIS-MCLP method to locate bank branches. In: Proceedings of Industrial and Systems Engineering Research Conference, July 2015"},{"issue":"0","key":"24_CR3","doi-asserted-by":"publisher","first-page":"0","DOI":"10.24200\/sci.2018.20493","volume":"0","author":"Ayfer Basar","year":"2018","unstructured":"Basar, A., Kabak, O., Topcu, Y.I.: A tabu search algorithm for multi-period bank branch location problem: a case study in a Turkish bank. Scientia Iranica (2018). https:\/\/doi.org\/10.24200\/sci.2018.20493","journal-title":"Scientia Iranica"},{"key":"24_CR4","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, KDD 1996, pp. 226\u2013231. AAAI Press (1996)"},{"issue":"5","key":"24_CR5","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533\u2013549 (1986). https:\/\/doi.org\/10.1016\/0305-0548(86)90048-1","journal-title":"Comput. Oper. Res."},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1111\/1475-3995.00373","volume":"9","author":"P Miliotis","year":"2002","unstructured":"Miliotis, P., Dimopoulou, M., Giannikos, I.: A hierarchical location model for locating bank branches in a competitive environment. Int. Trans. Oper. Res. 9, 549\u2013565 (2002). https:\/\/doi.org\/10.1111\/1475-3995.00373","journal-title":"Int. Trans. Oper. Res."},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-32539-5_48","volume-title":"Operations Research Proceedings 2005","author":"MSR Monteiro","year":"2006","unstructured":"Monteiro, M.S.R., Fontes, D.B.M.M.: Locating and sizing bank-branches by opening, closing or maintaining facilities. In: Haasis, H.D., Kopfer, H., Sch\u00f6nberger, J. (eds.) Operations Research Proceedings 2005, pp. 303\u2013308. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-32539-5_48"},{"key":"24_CR8","volume-title":"Artificial Intelligence: A Modern Approach","author":"S Russell","year":"2009","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice Hall, Englewood cliffs (2009)","edition":"3"},{"key":"24_CR9","doi-asserted-by":"publisher","unstructured":"Schneider, S., Seifert, F., Sunyaev, A.: Market potential analysis and branch network planning: application in a german retail bank. In: 2014 47th Hawaii International Conference on System Sciences, pp. 1122\u20131131, January 2014. https:\/\/doi.org\/10.1109\/HICSS.2014.145","DOI":"10.1109\/HICSS.2014.145"},{"key":"24_CR10","doi-asserted-by":"publisher","unstructured":"Thiel, D., Hovelaque, V., Pham, D.N.: A multi-agent model for optimizing supermarkets location in emerging countries. In: 2012 IEEE 13th International Symposium on Computational Intelligence and Informatics (CINTI), pp. 395\u2013399 (2012). https:\/\/doi.org\/10.1109\/CINTI.2012.6496798","DOI":"10.1109\/CINTI.2012.6496798"},{"issue":"13","key":"24_CR11","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1016\/S0305-0548(02)00123-5","volume":"30","author":"Q Wang","year":"2003","unstructured":"Wang, Q., Batta, R., Bhadury, J., Rump, C.M.: Budget constrained location problem with opening and closing of facilities. Comput. Oper. Res. 30(13), 2047\u20132069 (2003). https:\/\/doi.org\/10.1016\/S0305-0548(02)00123-5","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"04018047","DOI":"10.1061\/(ASCE)UP.1943-5444.0000482","volume":"145","author":"Shan-Shan Wu","year":"2019","unstructured":"Wu, S.S., Kuang, H., Lo, S.M.: Modeling shopping center location choice: Shopper preference-based competitive location model. J. Urban Plan. Dev. 145, March 2019. https:\/\/doi.org\/10.1061\/(ASCE)UP.1943-5444.0000482","journal-title":"Journal of Urban Planning and Development"},{"key":"24_CR13","doi-asserted-by":"publisher","unstructured":"Xia, L., Xie, M., Yin, W., Dong, J., Shao, J.: Markov decision processes formulation for stochastic and dynamic bank branches location problems. In: Proceedings of 2008 IEEE International Conference on Service Operations and Logistics, and Informatics, IEEE\/SOLI 2008, vol. 1, pp. 419\u2013424, October 2008. https:\/\/doi.org\/10.1109\/SOLI.2008.4686432","DOI":"10.1109\/SOLI.2008.4686432"},{"issue":"3","key":"24_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1111\/mice.12114","volume":"31","author":"W Xie","year":"2016","unstructured":"Xie, W., Ouyang, Y., Somani, K.: Optimizing location and capacity for multiple types of locomotive maintenance shops. Comp.-Aided Civ. Infrastruct. Eng. 31(3), 163\u2013175 (2016). https:\/\/doi.org\/10.1111\/mice.12114","journal-title":"Comp.-Aided Civ. Infrastruct. Eng."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22741-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T03:31:14Z","timestamp":1686108674000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22741-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030227401","9783030227418"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22741-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"8 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Faro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}