{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:35:43Z","timestamp":1726065343904},"publisher-location":"Cham","reference-count":19,"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_24","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:05:05Z","timestamp":1579597505000},"page":"298-303","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Assessing Simulated Annealing with Variable Neighborhoods"],"prefix":"10.1007","author":[{"given":"Eduardo","family":"Lalla-Ruiz","sequence":"first","affiliation":[]},{"given":"Leonard","family":"Heilig","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"RE Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB-a quadratic assignment problem library. J. Global Optim. 10(4), 391\u2013403 (1997)","journal-title":"J. Global Optim."},{"issue":"6","key":"24_CR2","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1016\/0305-0548(91)90059-Z","volume":"18","author":"KM Cheh","year":"1991","unstructured":"Cheh, K.M., Goldberg, J.B., Askin, R.G.: A note on the effect of neighborhood structure in simulated annealing. Comput. Oper. Res. 18(6), 537\u2013547 (1991)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1016\/j.eswa.2009.06.047","volume":"37","author":"P Chen","year":"2010","unstructured":"Chen, P., Huang, H.K., Dong, X.Y.: Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem. Expert Syst. Appl. 37(2), 1620\u20131627 (2010)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"24_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10479-005-3444-z","volume":"139","author":"Z Drezner","year":"2005","unstructured":"Drezner, Z., Hahn, P.M., Taillard, E.D.: Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann. Oper. Res. 139(1), 65\u201394 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.cor.2005.05.004","volume":"34","author":"E Duman","year":"2007","unstructured":"Duman, E., Or, I.: The quadratic assignment problem in the context of the printed circuit board assembly process. Comput. Oper. Res. 34(1), 163\u2013179 (2007)","journal-title":"Comput. Oper. Res."},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ins.2012.06.032","volume":"217","author":"E Duman","year":"2012","unstructured":"Duman, E., Uysal, M., Alkaya, A.F.: Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Inf. Sci. 217, 65\u201377 (2012)","journal-title":"Inf. Sci."},{"issue":"3","key":"24_CR7","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/s10696-017-9280-z","volume":"29","author":"L Heilig","year":"2017","unstructured":"Heilig, L., Lalla-Ruiz, E., Vo\u00df, S.: port-IO: an integrative mobile cloud platform for real-time inter-terminal truck routing optimization. Flex. Serv. Manuf. J. 29(3), 504\u2013534 (2017)","journal-title":"Flex. Serv. Manuf. J."},{"issue":"3","key":"24_CR8","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.ejor.2007.08.048","volume":"195","author":"VC Hemmelmayr","year":"2009","unstructured":"Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195(3), 791\u2013802 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/0-306-48056-5_10","volume-title":"Handbook of Metaheuristics","author":"D Henderson","year":"2003","unstructured":"Henderson, D., Jacobson, S.H., Johnson, A.W.: The theory and practice of simulated annealing. In: Glover, F.W., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 287\u2013319. Springer, Boston (2003). \nhttps:\/\/doi.org\/10.1007\/0-306-48056-5_10"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans, T.C., Beckman, M.: Assignment problems and the location of economic activities. Econometrica 25, 53\u201376 (1957)","journal-title":"Econometrica"},{"issue":"8","key":"24_CR11","doi-asserted-by":"publisher","first-page":"6949","DOI":"10.1016\/j.eswa.2012.01.024","volume":"39","author":"Y Kuo","year":"2012","unstructured":"Kuo, Y., Wang, C.C.: A variable neighborhood search for the multi-depot vehicle routing problem with loading cost. Expert Syst. Appl. 39(8), 6949\u20136954 (2012)","journal-title":"Expert Syst. Appl."},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/j.asoc.2016.08.036","volume":"49","author":"Y Lin","year":"2016","unstructured":"Lin, Y., Bian, Z., Liu, X.: Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing-tabu search algorithm to solve the symmetrical traveling salesman problem. Appl. Soft Comput. 49, 937\u2013952 (2016)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola, E.M., Maia de Abreu, N.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"24_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0305-0548(90)90001-N","volume":"17","author":"F Ogbu","year":"1990","unstructured":"Ogbu, F., Smith, D.K.: The application of the simulated annealing algorithm to the solution of the n\/m\/Cmax flowshop problem. Comput. Oper. Res. 17(3), 243\u2013253 (1990)","journal-title":"Comput. Oper. Res."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.endm.2012.10.033","volume":"39","author":"A Rodriguez-Cristerna","year":"2012","unstructured":"Rodriguez-Cristerna, A., Torres-Jimenez, J.: A simulated annealing with variable neighborhood search approach to construct mixed covering arrays. Electron. Notes Discret. Math. 39, 249\u2013256 (2012)","journal-title":"Electron. Notes Discret. Math."},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"1827","DOI":"10.1016\/j.asoc.2010.05.029","volume":"11","author":"Z Xinchao","year":"2011","unstructured":"Xinchao, Z.: Simulated annealing algorithm with adaptive neighborhood. Appl. Soft Comput. 11(2), 1827\u20131836 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"24_CR17","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1057\/jors.2010.138","volume":"62","author":"Y Xu","year":"2011","unstructured":"Xu, Y., Qu, R.: Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods. J. Oper. Res. Soc. 62(2), 313\u2013325 (2011)","journal-title":"J. Oper. Res. Soc."},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.endm.2012.10.038","volume":"39","author":"Y Xu","year":"2012","unstructured":"Xu, Y., Wang, L., Yang, Y.: A new variable neighborhood search algorithm for the multi depot heterogeneous vehicle routing problem with time windows. Electron. Notes Discret. Math. 39, 289\u2013296 (2012)","journal-title":"Electron. Notes Discret. Math."},{"issue":"1","key":"24_CR19","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1504\/EJIE.2011.037224","volume":"5","author":"KC Ying","year":"2010","unstructured":"Ying, K.C., Lin, S.W., Lu, C.C.: Cell formation using a simulated annealing algorithm with variable neighbourhood. Eur. J. Ind. Eng. 5(1), 22\u201342 (2010)","journal-title":"Eur. J. Ind. Eng."}],"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_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:21:34Z","timestamp":1579598494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38629-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030386283","9783030386290"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38629-0_24","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)"}}]}}