{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T04:04:23Z","timestamp":1751169863627,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031969997","type":"print"},{"value":"9783031970009","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-97000-9_5","type":"book-chapter","created":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T06:52:07Z","timestamp":1751093527000},"page":"71-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Study Cases on Initial Solution and Searching for Tabu Search and Threshold Accepting Algorithms on Bin-Packing Problem"],"prefix":"10.1007","author":[{"given":"Vanesa Landero","family":"N\u00e1jera","sequence":"first","affiliation":[]},{"given":"Ortega","family":"Joaqu\u00edn P\u00e9rez","sequence":"additional","affiliation":[]},{"given":"Laura Cruz","family":"Reyes","sequence":"additional","affiliation":[]},{"given":"Carlos Rodr\u00edguez","family":"Orta","sequence":"additional","affiliation":[]},{"given":"Carlos Collazos","family":"Morales","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/S0377-2217(02)00669-0","volume":"152","author":"CD Tarantilis","year":"2004","unstructured":"Tarantilis, C.D., Kiranoudis, C.T., Vassiliadis, V.S.: A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Eur. J. Oper. Res. 152(1), 148\u2013158 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR2","unstructured":"Martinez-Rios, F., Frausto-Solis, J.: An hybrid simulated annealing threshold accepting algorithm for satisfiability problems using dynamically cooling schemes. Electrical and Computer Engineering Series WSEAS, pp. 282\u2013286 (2007)"},{"issue":"8","key":"5_CR3","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.epsr.2010.01.001","volume":"80","author":"AY Abdelaziz","year":"2010","unstructured":"Abdelaziz, A.Y., Mohamed, F.M., Mekhamer, S.F., Badr, M.A.L.: Distribution system reconfiguration using a modified Tabu Search algorithm. Electric Power Systems Res. 80(8), 943\u2013953 (2010)","journal-title":"Electric Power Systems Res."},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1137\/110833865","volume":"50","author":"M Gnewuch","year":"2012","unstructured":"Gnewuch, M., Wahlstr\u00f6m, M., Winzen, C.: A new randomized algorithm to approximate the star discrepancy based on threshold accepting. SIAM J. Numer. Anal. 50(2), 781\u2013807 (2012)","journal-title":"SIAM J. Numer. Anal."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"2177","DOI":"10.1007\/s00500-013-1192-6","volume":"18","author":"P Pellegrini","year":"2014","unstructured":"Pellegrini, P., Mascia, F., St\u00fctzle, T., Birattari, M.: On the sensitivity of reactive tabu search to its meta-parameters. Soft. Comput. 18, 2177\u20132190 (2014)","journal-title":"Soft. Comput."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Adamczewski, K., Suh, Y., Mu Lee, K.: Discrete tabu search for graph matching. In Proceedings of the IEEE International Conference on Computer Vision, pp. 109\u2013117 (2015)","DOI":"10.1109\/ICCV.2015.21"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.cie.2015.12.028","volume":"93","author":"R Abyazi-Sani","year":"2016","unstructured":"Abyazi-Sani, R., Ghanbari, R.: An efficient tabu search for solving the uncapacitated single allocation hub location problem. Comput. Ind. Eng. 93, 99\u2013109 (2016)","journal-title":"Comput. Ind. Eng."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Heymann, B., Pon, J., Sellmann, M., Tierney, K.: Hyper-reactive tabu search for MaxSAT. In Learning and Intelligent Optimization: 12th International Conference, LION 12, Kalamata, Greece, June 10\u201315, 2018, Revised Selected Papers 12, pp. 309\u2013325, Springer International Publishing (2019)","DOI":"10.1007\/978-3-030-05348-2_27"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Leite, N., Mel\u00edcio, F., Rosa, A.C.: A fast threshold acceptance algorithm for the examination timetabling problem. Handbook of Operations Research and Management Science in Higher Education, pp. 323\u2013363 (2021)","DOI":"10.1007\/978-3-030-74051-1_11"},{"issue":"1","key":"5_CR10","first-page":"168","volume":"31","author":"FH Awad","year":"2022","unstructured":"Awad, F.H., Al-Kubaisi, A., Mahmood, M.: Large-scale timetabling problems with adaptive tabu search. J. Intell. Syst. 31(1), 168\u2013176 (2022)","journal-title":"J. Intell. Syst."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Wu, L., Lin, K., Lin, X., Lin, J.: List-based threshold accepting algorithm with improved neighbor operator for 0\u20131 knapsack problem. Algorithms 17(11), 478 (2024)","DOI":"10.3390\/a17110478"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"P\u00e9rez, O.J., Pazos, R.R., Cruz, R.L., Reyes, S.G., Basave, T.R., Fraire, H.H.: Improving the efficiency and efficacy of the k-means clustering algorithm through a new convergence condition. In: Computational Science and Its Applications\u2013ICCSA 2007: International Conference, Kuala Lumpur, Malaysia, August 26\u201329. Proceedings. Part III 7, pp. 674\u2013682, Springer Berlin Heidelberg (2007)","DOI":"10.1007\/978-3-540-74484-9_58"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"R Barr","year":"1995","unstructured":"Barr, R., Golden, B., Kelly, J., Resende, M., Stewart, W.: Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics 1(1), 9\u201332 (1995)","journal-title":"Journal of Heuristics"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s10898-016-0417-5","volume":"66","author":"T Weise","year":"2016","unstructured":"Weise, T., Wu, Y., Chiong, R., Tang, K., L\u00e4ssig, J.: Global versus local search: the impact of population sizes on evolutionary algorithm performance. J. Global Optim. 66, 511\u2013534 (2016)","journal-title":"J. Global Optim."},{"key":"5_CR15","unstructured":"Beasley, J.E.: OR-Library. Brunel University (2006). http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/binpackinfo.html"},{"key":"5_CR16","unstructured":"Scholl, A., Klein, R.: http:\/\/www.wiwi.uni-jena.de\/Entscheidung\/binpp\/ (2003)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/0377-2217(95)00011-E","volume":"83","author":"CKY Lin","year":"1995","unstructured":"Lin, C.K.Y., Haley, K.B., Sparks, C.: A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems. Eur. J. Oper. Res. 83, 330\u2013346 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search - part i, first comprehensive description of tabu search. ORSA-Journal on Computing 1(3), 190\u2013206 (1989)","journal-title":"ORSA-Journal on Computing"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Dueck, G., Scheuer, T.: Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J. Computational Physics, pp.161\u2013175 (1990)","DOI":"10.1016\/0021-9991(90)90201-B"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Fleszar, K., Hindi, K.S.: New heuristics for one-dimensional bin packing. In: Computers and Operations Research, Elsevier Science Ltd, 29, 821\u2013839 (2002)","DOI":"10.1016\/S0305-0548(00)00082-4"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97000-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T06:52:12Z","timestamp":1751093532000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97000-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031969997","9783031970009"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97000-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"29 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Istanbul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcrkiye","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}