{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:37Z","timestamp":1740099637214,"version":"3.37.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030386283"},{"type":"electronic","value":"9783030386290"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-38629-0_13","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:05:05Z","timestamp":1579597505000},"page":"157-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive GVNS Heuristics for Solving the Pollution Location Inventory Routing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1936-8468","authenticated-orcid":false,"given":"Panagiotis","family":"Karakostas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5696-7021","authenticated-orcid":false,"given":"Angelo","family":"Sifaleras","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2016-5131","authenticated-orcid":false,"given":"Michael C.","family":"Georgiadis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.endm.2017.03.007","volume":"58","author":"N Antoniadis","year":"2017","unstructured":"Antoniadis, N., Sifaleras, A.: A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems. Electron. Notes Discrete Math. 58, 47\u201354 (2017)","journal-title":"Electron. Notes Discrete Math."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tre.2016.11.001","volume":"97","author":"C Cheng","year":"2017","unstructured":"Cheng, C., Yang, P., Qi, M., Rousseau, L.M.: Modeling a green inventory routing problem with a heterogeneous fleet. Transp. Res. Part E 97, 97\u2013112 (2017)","journal-title":"Transp. Res. Part E"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/S0377-2217(99)00468-3","volume":"129","author":"F Glover","year":"2001","unstructured":"Glover, F., Gutin, G., Yeo, A., Zverovich, A.: Construction heuristics for the asymmetric TSP. Eur. J. Oper. Res. 129, 555\u2013568 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6940-7","volume-title":"Search Methodologies","year":"2014","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search. In: Burke, E., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, chap. 12, pp. 313\u2013337. Springer, New York (2014). \nhttps:\/\/doi.org\/10.1007\/978-1-4614-6940-7"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovic, N., Todosijevic, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5, 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.ejor.2017.04.046","volume":"263","author":"S Huber","year":"2017","unstructured":"Huber, S., Geiger, M.: Order matters - a variable neighborhood search for the swap-body vehicle routing problem. Eur. J. Oper. Res. 263, 419\u2013445 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-15843-9_6","volume-title":"Variable Neighborhood Search","author":"P Karakostas","year":"2019","unstructured":"Karakostas, P., Sifaleras, A., Georgiadis, M.C.: Basic VNS algorithms for solving the pollution location inventory routing problem. In: Sifaleras, A., Salhi, S., Brimberg, J. (eds.) ICVNS 2018. LNCS, vol. 11328, pp. 64\u201376. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-15843-9_6"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.compchemeng.2019.04.015","volume":"126","author":"P Karakostas","year":"2019","unstructured":"Karakostas, P., Sifaleras, A., Georgiadis, C.: A general variable neighborhood search-based solution approach for the location-inventory-routing problem with distribution outsourcing. Comput. Chem. Eng. 126, 263\u2013279 (2019)","journal-title":"Comput. Chem. Eng."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.asoc.2016.02.040","volume":"43","author":"K Li","year":"2016","unstructured":"Li, K., Tian, H.: A two-level self-adaptive variable neighborhood search algorithm for the prize-collecting vehicle routing problem. Appl. Soft Comput. 43, 469\u2013479 (2016)","journal-title":"Appl. Soft Comput."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.endm.2014.11.010","volume":"47","author":"A Sifaleras","year":"2015","unstructured":"Sifaleras, A., Konstantaras, I.: General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain. Electron. Notes Discrete Math. 47, 69\u201376 (2015)","journal-title":"Electron. Notes Discrete Math."},{"key":"13_CR11","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-99142-9_6","volume-title":"Open Problems in Optimization and Data Analysis","author":"K Skouri","year":"2018","unstructured":"Skouri, K., Sifaleras, A., Konstantaras, I.: Open problems in green supply chain modeling and optimization with carbon emission targets. In: Pardalos, P.M., Migdalas, A. (eds.) Open Problems in Optimization and Data Analysis. SOIA, vol. 141, pp. 83\u201390. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-99142-9_6"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.ijepes.2015.12.031","volume":"78","author":"R Todosijevic","year":"2016","unstructured":"Todosijevic, R., Mladenovic, M., Hanafi, S., Mladenovic, N., Crevits, I.: Adaptive general variable neighborhood search heuristics for solving the unit commitment problem. Electr. Power Energy Syst. 78, 873\u2013883 (2016)","journal-title":"Electr. Power Energy Syst."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38629-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:21:03Z","timestamp":1579598463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38629-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030386283","9783030386290"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38629-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chania, Crete","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion13.pem.tuc.gr\/en\/home\/","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":"52","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":"38","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":"0","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":"73% - 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","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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}