{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:31:40Z","timestamp":1743096700404,"version":"3.40.3"},"publisher-location":"Cham","reference-count":7,"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_23","type":"book-chapter","created":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T08:02:38Z","timestamp":1552464158000},"page":"303-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A GVNS Algorithm to Solve VRP with Optional Visits"],"prefix":"10.1007","author":[{"given":"Manel","family":"Kammoun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Houda","family":"Derbel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bassem","family":"Jarboui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,14]]},"reference":[{"issue":"3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.ejor.2014.10.048","volume":"242","author":"S Allahyari","year":"2015","unstructured":"Allahyari, S., Salari, M., Vigo, D.: A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem. Eur. J. Oper. Res. 242(3), 756\u2013768 (2015). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2014.10.048","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.ejor.2012.11.012","volume":"226","author":"MH Ha","year":"2013","unstructured":"Ha, M.H., Bostel, N., Langevin, A., Rousseau, L.: An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices. Eur. J. Oper. Res. 226(2), 211\u2013220 (2013). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2012.11.012","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-1-4615-5775-3_30","volume-title":"Meta-heuristics","author":"P Hansen","year":"1999","unstructured":"Hansen, P., Mladenovi\u0107, N.: An introduction to variable neighborhood search. In: Vo\u00df, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-heuristics, pp. 433\u2013458. Springer, Boston (1999). \n                    https:\/\/doi.org\/10.1007\/978-1-4615-5775-3_30"},{"issue":"3","key":"23_CR4","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449\u2013467 (2001). \n                    https:\/\/doi.org\/10.1016\/S0377-2217(00)00100-4","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR5","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/0-306-48056-5_6","volume-title":"Handbook of Metaheuristics","author":"P Hansen","year":"2003","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 57, pp. 145\u2013184. Springer, Boston (2003). \n                    https:\/\/doi.org\/10.1007\/0-306-48056-5_6"},{"issue":"3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1111\/itor.12355","volume":"24","author":"M Kammoun","year":"2017","unstructured":"Kammoun, M., Derbel, H., Ratli, M., Jarboui, B.: An integration of mixed VND and VNS: the case of the multivehicle covering tour problem. ITOR 24(3), 663\u2013679 (2017). \n                    https:\/\/doi.org\/10.1111\/itor.12355","journal-title":"ITOR"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.cor.2017.07.009","volume":"88","author":"TA Pham","year":"2017","unstructured":"Pham, T.A., Ha, M.H., Nguyen, X.H.: Solving the multi-vehicle multi-covering tour problem. Comput. Oper. Res. 88, 258\u2013278 (2017)","journal-title":"Comput. Oper. Res."}],"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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:04:40Z","timestamp":1558343080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15843-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030158422","9783030158439"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15843-9_23","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"}}]}}