{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T04:14:48Z","timestamp":1760328888295,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066672"},{"type":"electronic","value":"9783031066689"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06668-9_15","type":"book-chapter","created":{"date-parts":[[2022,6,5]],"date-time":"2022-06-05T23:10:29Z","timestamp":1654470629000},"page":"199-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Multi Service Capacitated Facility Location Problem with\u00a0Stochastic Demand"],"prefix":"10.1007","author":[{"given":"L. J.","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4580-7521","authenticated-orcid":false,"given":"F.","family":"Phillipson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. S.","family":"Wezeman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,6]]},"reference":[{"issue":"1","key":"15_CR1","first-page":"29","volume":"8","author":"CC Chyu","year":"2009","unstructured":"Chyu, C.C., Chang, W.S.: Multi-exchange neighborhood search heuristics for the multi-source capacitated facility location problem. Ind. Eng. Manag. Syst. 8(1), 29\u201336 (2009)","journal-title":"Ind. Eng. Manag. Syst."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-030-03101-5_17","volume-title":"International Conference on Mobile, Secure, and Programmable Networking","author":"G Hoekstra","year":"2019","unstructured":"Hoekstra, G., Phillipson, F.: Location assignment of capacitated services in smart cities. In: Renault, \u00c9., Boumerdassi, S., Bouzefrane, S. (eds.) International Conference on Mobile, Secure, and Programmable Networking, vol. 11005, pp. 192\u2013206. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-03101-5_17"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of computer computations, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Kim, L.J.: A Multi service capacitated facility location problem with stochastic demand. Master\u2019s thesis. Erasmus University Rotterdam (2021)","DOI":"10.1007\/978-3-031-06668-9_15"},{"issue":"7","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1109\/LCOMM.2019.2917681","volume":"23","author":"M Marvi","year":"2019","unstructured":"Marvi, M., Aijaz, A., Khurram, M.: On the use of on\/off traffic models for spatio-temporal analysis of wireless networks. IEEE Commun. Lett. 23(7), 1219\u20131222 (2019)","journal-title":"IEEE Commun. Lett."},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2008.05.007","volume":"196","author":"MT Melo","year":"2009","unstructured":"Melo, M.T., Nickel, S., Saldanha-Da-Gama, F.: Facility location and supply chain management-a review. Eur. J. Oper. Res. 196(2), 401\u2013412 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","volume-title":"Handbook of metaheuristics","author":"D Pisinger","year":"2010","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of metaheuristics, vol. 146, pp. 399\u2013419. Springer, Boston, MA. (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_13"},{"key":"15_CR8","unstructured":"Postek, K.: Optimization under uncertainty: lecture notes, 5 (2019)"},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. sci."},{"key":"15_CR10","unstructured":"Shaw, P.: A new local search algorithm providing high quality solutions to vehicle routing problems. APES Group, Dept of Computer Science, University of Strathclyde, Glasgow, Scotland, UK 46 (1997)"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/A:1026183515320","volume":"123","author":"T Suzuki","year":"2003","unstructured":"Suzuki, T., Hodgson, M.J.: Multi-service facility location models. Ann. Oper. Res. 123, 223\u2013240 (2003). https:\/\/doi.org\/10.1023\/A:1026183515320","journal-title":"Ann. Oper. Res."},{"key":"15_CR12","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-030-22482-0_8","volume-title":"Innovations for Community Services","author":"B Veerman","year":"2019","unstructured":"Veerman, B., Phillipson, F.: Multi service modular capacitated facility location problem for smart cities. In: L\u00fcke, K.-H., Eichler, G., Erfurth, C., Fahrnberger, G. (eds.) I4CS 2019. CCIS, vol. 1041, pp. 97\u2013108. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22482-0_8"},{"key":"15_CR13","unstructured":"Verhoek, M.: Optimising the placement of access points for smart city services with stochastic demand. Master\u2019s thesis. Groningen University (2017)"},{"key":"15_CR14","unstructured":"Vos, T., Phillipson, F.: Dense multi-service planning in smart cities. In: International Conference on Information Society and Smart Cities (2018)"}],"container-title":["Communications in Computer and Information Science","Innovations for Community Services"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06668-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T09:45:38Z","timestamp":1675763138000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06668-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066672","9783031066689"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06668-9_15","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"I4CS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Innovations for Community Services","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Delft","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"i4cs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.i4cs-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.53","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.43","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}