{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:01:39Z","timestamp":1743066099527,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030158422"},{"type":"electronic","value":"9783030158439"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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-15843-9_5","type":"book-chapter","created":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T08:02:38Z","timestamp":1552464158000},"page":"52-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How to Locate Disperse Obnoxious Facility Centers?"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1702-4941","authenticated-orcid":false,"given":"Jes\u00fas","family":"S\u00e1nchez-Oro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7490-9450","authenticated-orcid":false,"given":"J. Manuel","family":"Colmenar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5560-7270","authenticated-orcid":false,"given":"Enrique","family":"Garc\u00eda-Gal\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3022-3865","authenticated-orcid":false,"given":"Ana D.","family":"L\u00f3pez-S\u00e1nchez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,14]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1287\/trsc.2013.0511","volume":"49","author":"JG Carlsson","year":"2014","unstructured":"Carlsson, J.G., Jia, F.: Continuous facility location with backbone network costs. Transp. Sci. 49(3), 433\u2013451 (2014)","journal-title":"Transp. Sci."},{"key":"5_CR2","series-title":"Genetic and Evolutionary Computation","volume-title":"Evolutionary Algorithms for Solving Multi-Objective Problems","author":"CAC Coello","year":"2006","unstructured":"Coello, C.A.C., Lamont, G.B., Veldhuizen, D.A.V.: Evolutionary Algorithms for Solving Multi-Objective Problems. Genetic and Evolutionary Computation. Springer, New York (2006)"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2017.12.028","volume":"144","author":"J Colmenar","year":"2018","unstructured":"Colmenar, J., Mart\u00ed, R., Duarte, A.: Multi-objective memetic optimization for the bi-objective obnoxious p-median problem. Knowl.-Based Syst. 144, 88\u2013101 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"5_CR4","first-page":"119","volume-title":"Discrete Location Theory","author":"G Cornu\u00e9jols","year":"1990","unstructured":"Cornu\u00e9jols, G., Nemhauser, G., Wolsey, L.: The uncapacitated facility location problem. In: Mirchandani, P.B., Francis, R.L. (eds.) Discrete Location Theory, pp. 119\u2013171. Wiley-Interscience, New York (1990)"},{"issue":"8","key":"5_CR5","doi-asserted-by":"publisher","first-page":"3596","DOI":"10.1016\/j.eswa.2013.11.046","volume":"41","author":"S Dantrakul","year":"2014","unstructured":"Dantrakul, S., Likasiri, C., Pongvuthithum, R.: Applied p-median and p-center algorithms for facility location problems. Expert Syst. Appl. 41(8), 3596\u20133604 (2014)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1093\/imaman\/dpt026","volume":"27","author":"A Duarte","year":"2016","unstructured":"Duarte, A., Pantrigo, J., Pardo, E., S\u00e1nchez-Oro, J.: Parallel variable neighbourhood search strategies for the cutwidth minimization problem. IMA J. Manag. Math. 27(1), 55 (2016)","journal-title":"IMA J. Manag. Math."},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10898-014-0213-z","volume":"63","author":"A Duarte","year":"2015","unstructured":"Duarte, A., Pantrigo, J.J., Pardo, E.G., Mladenovic, N.: Multi-objective variable neighborhood search: an application to combinatorial optimization problems. J. Glob. Optim. 63(3), 515\u2013536 (2015)","journal-title":"J. Glob. Optim."},{"key":"5_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2151-2","volume-title":"Facility Location: Concepts, Models, Algorithms and Case Studies","author":"RZ Farahani","year":"2009","unstructured":"Farahani, R.Z., Hekmatfar, M.: Facility Location: Concepts, Models, Algorithms and Case Studies. Springer, Heidelberg (2009)"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6(2), 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ejor.2010.10.012","volume":"210","author":"A Mar\u00edn","year":"2011","unstructured":"Mar\u00edn, A.: The discrete facility location problem with balanced allocation of customers. Eur. J. Oper. Res. 210(1), 27\u201338 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.endm.2014.11.012","volume":"47","author":"J S\u00e1nchez-Oro","year":"2015","unstructured":"S\u00e1nchez-Oro, J., Sevaux, M., Rossi, A., Mart\u00ed, R., Duarte, A.: Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies. Electron. Notes Discret Math. 47, 85\u201392 (2015)","journal-title":"Electron. Notes Discret Math."},{"issue":"5","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1016\/j.cor.2004.09.012","volume":"33","author":"LY Wu","year":"2006","unstructured":"Wu, L.Y., Zhang, X.S., Zhang, J.L.: Capacitated facility location problem with general setup cost. Comput. Oper. Res. 33(5), 1226\u20131241 (2006)","journal-title":"Comput. Oper. Res."},{"key":"5_CR16","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength pareto evolutionary algorithm for multiobjective optimization. In: Giannakoglou, K., et al. (eds.) Evolutionary Methods for Design, Optimisation and Control with Application to Industrial Problems (EUROGEN 2001), pp. 95\u2013100. International Center for Numerical Methods in Engineering (CIMNE) (2002)"},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Variable Neighborhood Search"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-15843-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:04:00Z","timestamp":1558343040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15843-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030158422","9783030158439"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15843-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICVNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Variable Neighborhood Search","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sithonia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"7 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icvns2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/vns2018.uom.gr\/","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"}},{"value":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"47% - 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"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"14 submissions were accepted for oral presentation only.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}