{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:05:19Z","timestamp":1770815119594,"version":"3.50.1"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319591049","type":"print"},{"value":"9783319591056","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59105-6_4","type":"book-chapter","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T07:45:06Z","timestamp":1494920706000},"page":"39-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Tabu Search and Greedy Algorithm Adaptation to Logistic Task"],"prefix":"10.1007","author":[{"given":"Kamil","family":"Musia\u0142","sequence":"first","affiliation":[]},{"given":"Joanna","family":"Kotowska","sequence":"additional","affiliation":[]},{"given":"Dagmara","family":"G\u00f3rnicka","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Burduk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,17]]},"reference":[{"key":"4_CR1","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-319-47364-2_35","volume-title":"International Joint Conference SOCO\u201916-CISIS\u201916-ICEUTE\u201916","author":"A Burduk","year":"2017","unstructured":"Burduk, A., Musia\u0142, K.: Genetic algorithm adoption to transport task optimization. In: Gra\u00f1a, M., L\u00f3pez-Guede, J.M., Etxaniz, O., Herrero, \u00c1., Quinti\u00e1n, H., Corchado, E. (eds.) ICEUTE\/SOCO\/CISIS -2016. AISC, vol. 527, pp. 366\u2013375. Springer, Cham (2017). doi:10.1007\/978-3-319-47364-2_35"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-45378-1_18","volume-title":"Computer Information Systems and Industrial Management","author":"A Burduk","year":"2016","unstructured":"Burduk, A., Musia\u0142, K.: Optimization of chosen transport task by using generic algorithms. In: Saeed, K., Homenda, W. (eds.) CISIM 2016. LNCS, vol. 9842, pp. 197\u2013205. Springer, Cham (2016). doi:10.1007\/978-3-319-45378-1_18"},{"issue":"2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-007-0178-5","volume":"115","author":"R Baldacci","year":"2008","unstructured":"Baldacci, R., Christofides, N., Mingozzi, A.: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Prog. Ser. A 115(2), 351\u2013385 (2008)","journal-title":"Math. Prog. Ser. A"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-319-39384-1_36","volume-title":"Artificial Intelligence and Soft Computing","author":"W Bo\u017cejko","year":"2016","unstructured":"Bo\u017cejko, W., Uchro\u0144ski, M., Wodecki, M.: Parallel tabu search algorithm with uncertain data for the flexible job shop problem. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, Lotfi A., Zurada, Jacek M. (eds.) ICAISC 2016. LNCS, vol. 9693, pp. 419\u2013428. Springer, Cham (2016). doi:10.1007\/978-3-319-39384-1_36"},{"key":"4_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)"},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1057\/palgrave.jors.2601055","volume":"52","author":"J Grabowski","year":"2001","unstructured":"Grabowski, J., Pempera, J.: New block properties for the permutation flow shop problem with application in tabu search. J. Oper. Res. Soc. 52(2), 210\u2013220 (2001)","journal-title":"J. Oper. Res. Soc."},{"issue":"8","key":"4_CR7","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.1061\/(ASCE)TE.1943-5436.0000404","volume":"138","author":"T Hu","year":"2012","unstructured":"Hu, T., Chen, L.: Traffic signal optimization with greedy randomized tabu search algorithm. J. Transp. Eng. 138(8), 1040\u20131050 (2012)","journal-title":"J. Transp. Eng."},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard, J., Letchford, N.A., Eglese, W.R.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100(2), 423\u2013445 (2004)","journal-title":"Math. Program."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Pacheco, J., Garc\u00eda, I., \u00c1lvarez, A.: Enhancing variable neighborhood search by adding memory: application to a real logistic problem. Knowl. Based Syst. 62, 28\u201337, (2014)","DOI":"10.1016\/j.knosys.2014.02.014"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Resende, M., Ribeiro, C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 57, pp. 219\u2013249. Springer, New York (2003)","DOI":"10.1007\/0-306-48056-5_8"},{"issue":"30","key":"4_CR11","doi-asserted-by":"publisher","first-page":"182","DOI":"10.12913\/22998624\/62513","volume":"10","author":"A Rudawska","year":"2016","unstructured":"Rudawska, A., \u010cubo\u0148ova, N., Pomara\u0144ska, K., Stane\u010dkov\u00e1, D., Gola, A.: Technical and organizational improvements of packaging production processes. Adv. Sci. Technol. Res. J. 10(30), 182\u2013192 (2016)","journal-title":"Adv. Sci. Technol. Res. J."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: Branch-and-bound algorithms for the capacitated VRP. In: The Vehicle Routing Problem, pp. 29\u201352. SIAM, Philadelphia (2001)","DOI":"10.1137\/1.9780898718515.ch2"}],"container-title":["Lecture Notes in Computer Science","Computer Information Systems and Industrial Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59105-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,16]],"date-time":"2021-05-16T00:03:13Z","timestamp":1621123393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59105-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319591049","9783319591056"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59105-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"17 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CISIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Computer Information Systems and Industrial Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bialystok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisim2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wi.pb.edu.pl\/cisim2017\/","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"}]}}