{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T22:54:06Z","timestamp":1761519246920,"version":"3.41.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319775371"},{"type":"electronic","value":"9783319775388"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-77538-8_52","type":"book-chapter","created":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T11:33:17Z","timestamp":1520422397000},"page":"778-793","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Late Acceptance Hill Climbing for\u00a0Constrained Covering Arrays"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6555-7200","authenticated-orcid":false,"given":"Mosab","family":"Bazargani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6699-8323","authenticated-orcid":false,"given":"John H.","family":"Drake","sequence":"additional","affiliation":[]},{"given":"Edmund K.","family":"Burke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,8]]},"reference":[{"key":"52_CR1","unstructured":"Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for examination timetabling problems. In: Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2008) (2008)"},{"issue":"1","key":"52_CR2","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2016.07.012","volume":"258","author":"EK Burke","year":"2017","unstructured":"Burke, E.K., Bykov, Y.: The late acceptance hill-climbing heuristic. Eur. J. Oper. Res. 258(1), 70\u201378 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"52_CR3","unstructured":"Franzin, A., St\u00fctzle, T.: Comparison of acceptance criteria in randomized local searches. In: 13th Biennal International Conference on Artificial Evolution, pp. 24\u201337 (2017)"},{"key":"52_CR4","doi-asserted-by":"publisher","unstructured":"Swan, J., Drake, J.H., \u00d6zcan, E., Goulding, J., Woodward, J.R.: A comparison of acceptance criteria for the daily car-pooling problem. In: Gelenbe, E., Lent, R. (eds.) Computer and Information Sciences III, pp. 477\u2013483. Springer, London (2012). https:\/\/doi.org\/10.1007\/978-1-4471-4594-3_49","DOI":"10.1007\/978-1-4471-4594-3_49"},{"issue":"4598","key":"52_CR5","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"1","key":"52_CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G Dueck","year":"1990","unstructured":"Dueck, G., Scheuer, T.: Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phys. 90(1), 161\u2013175 (1990)","journal-title":"J. Comput. Phys."},{"issue":"1","key":"52_CR7","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G Dueck","year":"1993","unstructured":"Dueck, G.: New optimization heuristics: the great deluge algorithm and the record-to-record travel. J. Comput. Phys. 104(1), 86\u201392 (1993)","journal-title":"J. Comput. Phys."},{"issue":"6","key":"52_CR8","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1109\/TSE.2004.24","volume":"30","author":"DR Kuhn","year":"2004","unstructured":"Kuhn, D.R., Wallace, D.R., Gallo, A.M.: Software fault interactions and implications for software testing. IEEE Trans. Software Eng. 30(6), 418\u2013421 (2004)","journal-title":"IEEE Trans. Software Eng."},{"issue":"1","key":"52_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10664-010-9135-7","volume":"16","author":"BJ Garvin","year":"2011","unstructured":"Garvin, B.J., Cohen, M.B., Dwyer, M.B.: Evaluating improvements to a meta-heuristic search for constrained interaction testing. Empirical Software Eng. 16(1), 61\u2013102 (2011)","journal-title":"Empirical Software Eng."},{"issue":"3","key":"52_CR10","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search-Part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"key":"52_CR11","doi-asserted-by":"crossref","unstructured":"Ozcan, E., Bykov, Y., Birben, M., Burke, E.K.: Examination timetabling using late acceptance hyper-heuristics. In: IEEE Congress on Evolutionary Computation, (CEC 2009), pp. 997\u20131004. IEEE (2009)","DOI":"10.1109\/CEC.2009.4983054"},{"key":"52_CR12","doi-asserted-by":"crossref","unstructured":"Jackson, W.G., Ozcan, E., Drake, J.H.: Late acceptance-based selection hyper-heuristics for cross-domain heuristic search. In: 13th UK Workshop on Computational Intelligence (UKCI 2013), pp. 228\u2013235. IEEE (2013)","DOI":"10.1109\/UKCI.2013.6651310"},{"key":"52_CR13","doi-asserted-by":"publisher","unstructured":"Verstichel, J., Berghe, G.V.: A late acceptance algorithm for the lock scheduling problem. In: In: Vo\u00df, S., Pahl, J., Schwarze, S. (eds.) Logistik Management, pp. 457\u2013478. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-7908-2362-2_23","DOI":"10.1007\/978-3-7908-2362-2_23"},{"issue":"4","key":"52_CR14","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10951-015-0458-5","volume":"19","author":"GH Fonseca","year":"2016","unstructured":"Fonseca, G.H., Santos, H.G., Carrano, E.G.: Late acceptance hill-climbing for high school timetabling. J. Sched. 19(4), 453\u2013465 (2016)","journal-title":"J. Sched."},{"issue":"1","key":"52_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1162\/EVCO_a_00145","volume":"24","author":"JH Drake","year":"2016","unstructured":"Drake, J.H., \u00d6zcan, E., Burke, E.K.: A case study of controlling crossover in a selection hyper-heuristic framework using the multidimensional knapsack problem. Evol. Comput. 24(1), 113\u2013141 (2016)","journal-title":"Evol. Comput."},{"key":"52_CR16","doi-asserted-by":"crossref","unstructured":"Nie, C., Leung, H.: A survey of combinatorial testing. ACM Comput. Surv. 43(2), 11:1\u201311:29 (2011)","DOI":"10.1145\/1883612.1883618"},{"issue":"5","key":"52_CR17","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1109\/TSE.2008.50","volume":"34","author":"MB Cohen","year":"2008","unstructured":"Cohen, M.B., Dwyer, M.B., Shi, J.: Constructing interaction test suites for highly-configurable systems in the presence of constraints: A greedy approach. IEEE Trans. Software Eng. 34(5), 633\u2013650 (2008)","journal-title":"IEEE Trans. Software Eng."},{"key":"52_CR18","doi-asserted-by":"crossref","unstructured":"Galinier, P., Kpodjedo, S., Antoniol, G.: A penalty-based tabu search for constrained covering arrays. In: Proceedings of the Genetic and Evolutionary Computation Conference, (GECCO 2017), pp. 1288\u20131294. ACM (2017)","DOI":"10.1145\/3071178.3071324"},{"key":"52_CR19","doi-asserted-by":"crossref","unstructured":"Cohen, D.M., Dalal, S.R., Kajla, A., Patton, G.C.: The automatic efficient test generator (AETG) system. In: 5th International Symposium on Software Reliability Engineering, (ISSRE 1994), pp. 303\u2013309. IEEE (1994)","DOI":"10.1109\/ISSRE.1994.341392"},{"key":"52_CR20","doi-asserted-by":"crossref","unstructured":"Yu, L., Lei, Y., Borazjany, M.N., Kacker, R., Kuhn, D.R.: An efficient algorithm for constraint handling in combinatorial test generation. In: Sixth IEEE International Conference on Software Testing, Verification and Validation, ICST 2013, pp. 242\u2013251. IEEE Computer Society (2013)","DOI":"10.1109\/ICST.2013.35"},{"key":"52_CR21","doi-asserted-by":"crossref","unstructured":"Bryce, R.C., Colbourn, C.J.: One-test-at-a-time heuristic search for interaction test suites. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation (GECCO 2007), pp. 1082\u20131089. ACM (2007)","DOI":"10.1145\/1276958.1277173"},{"key":"52_CR22","doi-asserted-by":"crossref","unstructured":"Lin, J., Luo, C., Cai, S., Su, K., Hao, D., Zhang, L.: TCA: an efficient two-mode meta-heuristic algorithm for combinatorial test generation (T). In: 30th IEEE\/ACM International Conference on Automated Software Engineering, ASE 2015, pp. 494\u2013505. IEEE Computer Society (2015)","DOI":"10.1109\/ASE.2015.61"},{"key":"52_CR23","doi-asserted-by":"crossref","unstructured":"Jia, Y., Cohen, M.B., Harman, M., Petke, J.: Learning combinatorial interaction test generation strategies using hyperheuristic search. In: 37th IEEE International Conference on Software Engineering, ICSE 2015, vol. 1, pp. 540\u2013550 (2015)","DOI":"10.1109\/ICSE.2015.71"},{"key":"52_CR24","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.asoc.2016.03.021","volume":"44","author":"KZ Zamli","year":"2016","unstructured":"Zamli, K.Z., Alkazemi, B.Y., Kendall, G.: A tabu search hyper-heuristic strategy for t-way test suite generation. Appl. Soft Comput. 44, 57\u201374 (2016)","journal-title":"Appl. Soft Comput."},{"key":"52_CR25","doi-asserted-by":"crossref","unstructured":"Khalsa, S.K., Labiche, Y.: An orchestrated survey of available algorithms and tools for combinatorial testing. In: 25th IEEE International Symposium on Software Reliability Engineering, (ISSRE 2014), pp. 323\u2013334. IEEE Computer Society (2014)","DOI":"10.1109\/ISSRE.2014.15"},{"key":"52_CR26","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., Colbourn, C.J., Ling, A.C.H.: Augmenting simulated annealing to build interaction test suites. In: 14th International Symposium on Software Reliability Engineering (ISSRE 2003), pp. 394\u2013405. IEEE Computer Society (2003)","DOI":"10.1109\/ISSRE.2003.1251061"},{"key":"52_CR27","doi-asserted-by":"crossref","unstructured":"Garvin, B.J., Cohen, M.B., Dwyer, M.B.: An improved meta-heuristic search for constrained interaction testing. In: 2009 1st International Symposium on Search Based Software Engineering, pp. 13\u201322 (2009)","DOI":"10.1109\/SSBSE.2009.25"},{"key":"52_CR28","doi-asserted-by":"crossref","unstructured":"Bazargani, M., Lobo, F.G.: Parameter-less late acceptance hill-climbing. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, Berlin, Germany, July 15\u201319 2017, pp. 219\u2013226. ACM (2017)","DOI":"10.1145\/3071178.3071225"},{"key":"52_CR29","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Curtois, T., Hyde, M.R., Kendall, G., Ochoa, G., Petrovic, S., Rodr\u00edguez, J.A.V., Gendreau, M.: Iterated local search vs. hyper-heuristics: towards general-purpose search algorithms. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010), pp. 1\u20138 (2010)","DOI":"10.1109\/CEC.2010.5586064"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77538-8_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T13:40:31Z","timestamp":1751463631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-77538-8_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319775371","9783319775388"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77538-8_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}