{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:23:14Z","timestamp":1761294194037,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030587987"},{"type":"electronic","value":"9783030587994"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-58799-4_11","type":"book-chapter","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T13:06:26Z","timestamp":1601471186000},"page":"149-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Characterizing and Analyzing the Relation Between Bin-Packing Problem and Tabu Search Algorithm"],"prefix":"10.1007","author":[{"given":"V.","family":"Landero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"R\u00edos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joaqu\u00edn","family":"P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Cruz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Collazos-Morales","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,1]]},"reference":[{"key":"11_CR1","volume-title":"Computers and Intractability, a Guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Jhonson, D.S.: Computers and Intractability, a Guide to the Theory of NP-completeness. W. H. Freeman and Company, New York (1979)"},{"key":"11_CR2","unstructured":"Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization, Algorithms and Complexity. Prentice Hall, Upper Saddle River (1982)"},{"key":"11_CR3","first-page":"267","volume":"5","author":"L Rendell","year":"1990","unstructured":"Rendell, L., Cho, H.: Empirical learning as a function of concept character. Mach. Learn. 5, 267\u2013298 (1990)","journal-title":"Mach. Learn."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/S1571-0653(04)00332-4","volume":"9","author":"M Lagoudakis","year":"2001","unstructured":"Lagoudakis, M., Littman, M.: Learning to select branching rules in the DPLL procedure for satisfiability. Electron. Notes Discrete Math. 9, 344\u2013359 (2001)","journal-title":"Electron. Notes Discrete Math."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41(1), 1\u201325 (2009)","DOI":"10.1145\/1456650.1456656"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1996","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for optimizations. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1996)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1007\/s00170-012-4571-8","volume":"67","author":"R Vanchipura","year":"2013","unstructured":"Vanchipura, R., Sridharan, R.: Development and analysis of constructive heuristic algorithms for flow shop scheduling problems with sequence-dependent setup times. Int. J. Adv. Manuf. Technol. 67, 1337\u20131353 (2013)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H., Leyton-Brown, K.: Algorithm runtime prediction: methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H., Leyton-Brown, K.: Hydra: automatically configuring algorithms for portfolio-based selection. In: Proceedings of the 25th National Conference on Artificial Intelligence (AAAI 2010), pp. 210\u2013216 (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ins.2013.05.015","volume":"246","author":"A Cayci","year":"2013","unstructured":"Cayci, A., Menasalvas, E., Saygin, Y., Eibe, S.: Self-configuring data mining for ubiquitous computing. Inf. Sci. 246, 83\u201399 (2013)","journal-title":"Inf. Sci."},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"5224","DOI":"10.1016\/j.eswa.2009.12.087","volume":"37","author":"R Pav\u00f3n","year":"2010","unstructured":"Pav\u00f3n, R., D\u00edaz, F., Laza, R., Luz\u00f3n, M.: Experimental evaluation of an automatic parameter setting system. Expert Syst. Appl. 37, 5224\u20135238 (2010)","journal-title":"Expert Syst. Appl."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_40"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.asoc.2014.01.032","volume":"18","author":"E Yeguas","year":"2014","unstructured":"Yeguas, E., Luz\u00f3n, M., Pav\u00f3n, R., Laza, R., Arroyo, G., D\u00edaz, F.: Automatic parameter tuning for evolutionary algorithms using a Bayesian case-based reasoning system. Appl. Soft Comput. 18, 185\u2013195 (2014)","journal-title":"Appl. Soft Comput."},{"issue":"5","key":"11_CR14","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1057\/jors.2014.46","volume":"66","author":"J Ries","year":"2015","unstructured":"Ries, J., Beullens, P.: A semi-automated design of instance-based fuzzy parameter tuning for metaheuristics based on decision tree induction. J. Oper. Res. Soc. 66(5), 782\u2013793 (2015)","journal-title":"J. Oper. Res. Soc."},{"key":"11_CR15","unstructured":"Yong, X., Feng, D., Rongchun, Z.: Optimal selection of image segmentation algorithms based on performance prediction. In: Proceedings of the Pan-Sydney Area Workshop on Visual Information Processing, pp. 105\u2013108. Australian Computer Society, Inc. (2003)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-540-24838-5_31","volume-title":"Experimental and Efficient Algorithms","author":"J P\u00e9rez","year":"2004","unstructured":"P\u00e9rez, J., Pazos, R.A., Frausto, J., Rodr\u00edguez, G., Romero, D., Cruz, L.: A statistical approach for algorithm selection. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 417\u2013431. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24838-5_31"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-02777-2_31","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"M Nikoli\u0107","year":"2009","unstructured":"Nikoli\u0107, M., Mari\u0107, F., Jani\u010di\u0107, P.: Instance-based selection of policies for SAT solvers. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 326\u2013340. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_31"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Yuen, S., Zhang, X.: Multiobjective evolutionary algorithm portfolio: choosing suitable algorithm for multiobjective optimization problem. In: 2014 IEEE Congress on Evolutionary Computation (CEC), Beijing, China, pp. 1967\u20131973 (2014)","DOI":"10.1109\/CEC.2014.6900470"},{"issue":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/TEVC.2014.2302006","volume":"19","author":"M Munoz","year":"2015","unstructured":"Munoz, M., Kirley, M., Halgamuge, S.: Exploratory landscape analysis of continuous space optimization problems using information content. IEEE Trans. Evol. Comput. 19(1), 74\u201387 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"11_CR20","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/2594413.2594424","volume":"57","author":"K Leyton-Brown","year":"2014","unstructured":"Leyton-Brown, K., Hoos, H., Hutter, F., Xu, L.: Understanding the empirical hardness of np-complete problems. Mag. Commun. ACM 57(5), 98\u2013107 (2014)","journal-title":"Mag. Commun. ACM"},{"key":"11_CR21","unstructured":"Cruz, L., G\u00f3mez, C., P\u00e9rez, J., Landero, V., Quiroz, M., Ochoa, A.: Algorithm Selection: From Meta-Learning to Hyper-Heuristics. INTECH Open Access Publisher (2012)"},{"key":"11_CR22","unstructured":"Wagner, M., Lindauer, M., Misir, M., et al.: A case of study of algorithm selection for the travelling thief problem. J. Heuristics, 1\u201326 (2017)"},{"issue":"5B","key":"11_CR23","first-page":"72","volume":"16","author":"J P\u00e9rez","year":"2007","unstructured":"P\u00e9rez, J., Cruz, L., Landero, V.: Explaining performance of the threshold accepting algorithm for the bin packing problem: a causal approach. Pol. J. Environ. Stud. 16(5B), 72\u201376 (2007)","journal-title":"Pol. J. Environ. Stud."},{"issue":"3","key":"11_CR24","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/TSMCB.2008.915539","volume":"38","author":"J Tavares","year":"2008","unstructured":"Tavares, J.: Multidimensional knapsack problem: a fitness landscape analysis. IEEE Trans. Syst. Man Cybern. Part B Cybern. 38(3), 604\u2013616 (2008)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B Cybern."},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1007\/978-3-540-69731-2_102","volume-title":"Artificial Intelligence and Soft Computing \u2013 ICAISC 2008","author":"J P\u00e9rez","year":"2008","unstructured":"P\u00e9rez, J., et al.: An application of causality for representing and providing formal explanations about the behavior of the threshold accepting algorithm. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2008. LNCS (LNAI), vol. 5097, pp. 1087\u20131098. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69731-2_102"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-13800-3_29","volume-title":"Learning and Intelligent Optimization","author":"K Smith-Miles","year":"2010","unstructured":"Smith-Miles, K., van Hemert, J., Lim, X.Y.: Understanding TSP difficulty by learning from evolved instances. In: Blum, C., Battiti, R. (eds.) LION 2010. LNCS, vol. 6073, pp. 266\u2013280. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13800-3_29"},{"key":"11_CR27","first-page":"361","volume-title":"Recent Advances on Hybrid Intelligent Systems, Studies in Computational Intelligence","author":"M Quiroz","year":"2013","unstructured":"Quiroz, M., Cruz, L., Torrez, J., G\u00f3mez, C.: Improving the performance of heuristic algorithms based on exploratory data analysis. In: Castillo, O., Melin, P., Kacprzyk, J. (eds.) Recent Advances on Hybrid Intelligent Systems, Studies in Computational Intelligence, vol. 452, pp. 361\u2013375. Springer, Heidelberg (2013)"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Landero, V., P\u00e9rez, J., Cruz, L., Turrubiates, T., Rios, D.: Effects in the algorithm performance from problem structure, searching behavior and temperature: a causal study case for threshold accepting and bin-packing problem. In: Misra, S., Gervasi, O., Murgante, B. (eds.) ICCSA 2019. LNCS, vol. 11619, pp. 152\u2013166. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-24289-3_13","DOI":"10.1007\/978-3-030-24289-3_13"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Spirtes, P., Glymour, C., Scheines, R.: Causation, Prediction, and Search, 2nd edn. The MIT Press, Cambridge (2001)","DOI":"10.7551\/mitpress\/1754.001.0001"},{"key":"11_CR30","unstructured":"Beasley, J., E.: OR-Library. Brunel University (2006). http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/binpackinfo.html"},{"key":"11_CR31","unstructured":"Scholl, A., Klein, R.: (2003). http:\/\/www.wiwi.uni-jena.de\/Entscheidung\/binpp\/"},{"issue":"3","key":"11_CR32","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-J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA-J. Comput."},{"key":"11_CR33","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/S0305-0548(00)00082-4","volume":"29","author":"K Fleszar","year":"2002","unstructured":"Fleszar, K., Hindi, K.S.: New heuristics for one-dimensional bin packing. Comput. Oper. Res. 29, 821\u2013839 (2002)","journal-title":"Comput. Oper. Res."},{"key":"11_CR34","doi-asserted-by":"publisher","unstructured":"Khuri, S., Sch\u00fctz, M., Heitk\u00f6tter, J.: Evolutionary heuristics for the bin packing problem. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna (1995). https:\/\/doi.org\/10.1007\/978-3-7091-7535-4_75","DOI":"10.1007\/978-3-7091-7535-4_75"},{"key":"11_CR35","unstructured":"Merz, P., Freisleben, B.: Fitness landscapes and memetic algorithm design. In: New Ideas in Optimization, pp. 245\u2013260. McGraw-Hill Ltd., UK (1999)"},{"key":"11_CR36","unstructured":"Fayyad, U.M., Irani, K.B.: Multi-interval discretization of continuous-valued attributes for classification learning. In: IJCAI, pp. 1022\u20131029 (1993)"},{"key":"11_CR37","unstructured":"Hall, M.A.: Feature selection for discrete and numeric class machine learning (1999)"},{"key":"11_CR38","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1613\/jair.1576","volume":"24","author":"J Watson","year":"2005","unstructured":"Watson, J., Darrell, W., Adele, E.: Linking search space structure, run-time dynamics, and problem difficulty: a step toward demystifying tabu search. J. Artif. Intell. Res. 24, 221\u2013261 (2005)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58799-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,21]],"date-time":"2022-11-21T10:34:11Z","timestamp":1669026851000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58799-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030587987","9783030587994"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58799-4_11","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":"1 October 2020","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":"Cagliari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","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":"Cyber chair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1450","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":"466","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":"32","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":"32% - 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":"2.5","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":"6","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)"}},{"value":"Conference was held virtually due to COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}