{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:11:27Z","timestamp":1743027087503,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030233662"},{"type":"electronic","value":"9783030233679"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23367-9_1","type":"book-chapter","created":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T17:02:51Z","timestamp":1560963771000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Population-Based Variable Neighborhood Descent for Discrete Optimization"],"prefix":"10.1007","author":[{"given":"Petar","family":"Afric","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian Satja","family":"Kurdija","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucija","family":"Sikic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marin","family":"Silic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goran","family":"Delac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klemo","family":"Vladimir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sinisa","family":"Srbljic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,20]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.ejor.2013.02.025","volume":"229","author":"P Schittekat","year":"2013","unstructured":"Schittekat, P., Kinable, J., S\u00f6rensen, K., Sevaux, M., Spieksma, F., Springael, J.: A metaheuristic for the school bus routing problem with bus stop selection. Eur. J. Oper. Res. 229(2), 518\u2013528 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.endm.2017.03.023","volume":"58","author":"M Harzi","year":"2017","unstructured":"Harzi, M., Krichen, S.: Variable neighborhood descent for solving the vehicle routing problem with time windows. Electron. Notes Discrete Math. 58, 175\u2013182 (2017)","journal-title":"Electron. Notes Discrete Math."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.endm.2014.11.016","volume":"47","author":"N Dahmani","year":"2015","unstructured":"Dahmani, N., Krichen, S., Ghazouani, D.: A variable neighborhood descent approach for the two-dimensional bin packing problem. Electron. Notes Discrete Math. 47, 117\u2013124 (2015)","journal-title":"Electron. Notes Discrete Math."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.endm.2018.03.023","volume":"66","author":"A Zudio","year":"2018","unstructured":"Zudio, A., da Silva Costa, D.H., Masquio, B.P., Coelho, I.M., Pinto, P.E.D.: Brkga\/vnd hybrid algorithm for the classic three-dimensional bin packing problem. Electron Notes Discrete Math. 66, 175\u2013182 (2018)","journal-title":"Electron Notes Discrete Math."},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1828","DOI":"10.1109\/59.476047","volume":"10","author":"GC Oliveira","year":"1995","unstructured":"Oliveira, G.C., Costa, A.P.C., Binato, S.: Large scale transmission network planning using optimization and heuristic techniques. IEEE Trans. Power Syst. 10(4), 1828\u20131834 (1995)","journal-title":"IEEE Trans. Power Syst."},{"issue":"7","key":"1_CR6","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1007\/s00521-015-2135-1","volume":"28","author":"Y Feng","year":"2017","unstructured":"Feng, Y., Wang, G.G., Deb, S., Lu, M., Zhao, X.J.: Solving 0\u20131 Knapsack problem by a novel binary Monarch butterfly optimization. Neural Comput. Appl. 28(7), 1619\u20131634 (2017)","journal-title":"Neural Comput. Appl."},{"key":"1_CR7","volume-title":"Operations Research: An Introduction","author":"HA Taha","year":"2006","unstructured":"Taha, H.A.: Operations Research: An Introduction, 8th edn. Prentice-Hall Inc., Upper Saddle River (2006)","edition":"8"},{"key":"1_CR8","volume-title":"Mathematical Programming","author":"N Reinfeld","year":"1958","unstructured":"Reinfeld, N., Vogel, W.: Mathematical Programming. Prentice-Hall, Upper Saddle River (1958)"},{"key":"1_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4","volume-title":"Handbook of Metaheuristics","year":"2010","unstructured":"Gendreau, M., Potvin, J.Y. (eds.): Handbook of Metaheuristics, vol. 2. Springer, Cham (2010). https:\/\/doi.org\/10.1007\/978-3-319-91086-4"},{"issue":"11","key":"1_CR10","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."},{"issue":"3","key":"1_CR11","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10898-014-0185-z","volume":"63","author":"A Lamghari","year":"2015","unstructured":"Lamghari, A., Dimitrakopoulos, R., Ferland, J.A.: A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines. J. Glob. Optim. 63(3), 555\u2013582 (2015)","journal-title":"J. Glob. Optim."},{"issue":"9","key":"1_CR12","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J Gao","year":"2008","unstructured":"Gao, J., Sun, L., Gen, M.: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput. Oper. Res. 35(9), 2892\u20132907 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2017","unstructured":"Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., Subramanian, A.: New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. 257(3), 845\u2013858 (2017)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Mobile Services \u2013 AIMS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23367-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:06:40Z","timestamp":1687133200000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23367-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030233662","9783030233679"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23367-9_1","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":"20 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on AI and Mobile Services","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Diego, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"25 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aimse2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ai1000.org\/2019\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}