{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T18:13:32Z","timestamp":1725992012672},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319960043"},{"type":"electronic","value":"9783319960050"}],"license":[{"start":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T00:00:00Z","timestamp":1537315200000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-319-96005-0_26","type":"book-chapter","created":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T13:44:21Z","timestamp":1537278261000},"page":"211-218","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["When to Stop? A New Stop Criterion for Combinatorial Optimization Search Techniques"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Roy","family":"Gelbard","sequence":"additional","affiliation":[]},{"given":"Marlene","family":"Amorim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,19]]},"reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1080\/00029890.1978.11994501","volume":"85","author":"Ned Glick","year":"1978","unstructured":"Glick N (1978) Breaking records and breaking boards. Am Math Monthly 2\u201326","journal-title":"The American Mathematical Monthly"},{"key":"26_CR2","unstructured":"Glorieux E (2015) Constructive cooperative coevolution for optimising interacting production stations. Doctoral dissertation, University West, Trollh\u00e4ttan: Sweden"},{"issue":"2","key":"26_CR3","first-page":"67","volume":"2","author":"MP Ha","year":"2014","unstructured":"Ha MP, Kumar L, Ananthapadmanabha T (2014) A novel approach for optimal allocation of a distributed generator in a radial distribution feeder for loss minimization and tail end node voltage improvement during peak load. Int Trans Electr Comput Eng Syst 2(2):67\u201372","journal-title":"Int Trans Electr Comput Eng Syst"},{"issue":"4","key":"26_CR4","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.infsof.2014.01.001","volume":"56","author":"I Hermadi","year":"2014","unstructured":"Hermadi I, Lokan C, Sarker R (2014) Dynamic stopping criteria for search-based test data generation for path testing. Inf Softw Technol 56(4):395\u2013407","journal-title":"Inf Softw Technol"},{"key":"26_CR5","unstructured":"Holland J (1992) Adaptation in natural and artificial systems. The MIT Press; Reprint edition (originally published in 1975)"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/01446193.2012.697181","volume":"31","author":"JL Kim","year":"2013","unstructured":"Kim JL (2013) Genetic algorithm stopping criteria for optimization of construction resource scheduling problems. Constr Manag Econ 31(1):3\u201319","journal-title":"Constr Manag Econ"},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch R, Sprecher A (1997) PSPLIB-a project scheduling problem library: OR software-ORSEP operations research software exchange program. Eur J Oper Res 96(1):205\u2013216","journal-title":"Eur J Oper Res"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Kolisch R, Schwindt C, Sprecher A (1999) Benchmark instances for project scheduling problems. Int Ser Oper Res Manag Sci 197\u2013212","DOI":"10.1007\/978-1-4615-5533-9_9"},{"issue":"1","key":"26_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physa.2005.06.002","volume":"358","author":"J Krug","year":"2005","unstructured":"Krug J, Jain K (2005) Breaking records in the evolutionary race. Physica A 358(1):1\u20139","journal-title":"Physica A"},{"issue":"3","key":"26_CR10","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1109\/TEVC.2013.2281533","volume":"18","author":"HL Liu","year":"2014","unstructured":"Liu HL, Gu F, Zhang Q (2014) Decomposition of a multi-objective optimization problem into a number of simple multi-objective sub-problems. IEEE Trans Evol Comput 18(3):450\u2013455","journal-title":"IEEE Trans Evol Comput"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1016\/j.ins.2016.07.025","volume":"367","author":"L Mart\u00ed","year":"2016","unstructured":"Mart\u00ed L, Garc\u00eda J, Berlanga A, Molina JM (2016) A stopping criterion for multi-objective optimization evolutionary algorithms. Inf Sci 367:700\u2013718","journal-title":"Inf Sci"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.asoc.2014.08.025","volume":"24","author":"HM Pandey","year":"2014","unstructured":"Pandey HM, Chaudhary A, Mehrotra D (2014) A comparative review of approaches to prevent premature convergence in GA. Appl Soft Comput 24:1047\u20131077","journal-title":"Appl Soft Comput"},{"issue":"1","key":"26_CR13","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.ejor.2005.07.014","volume":"176","author":"S Robinson","year":"2007","unstructured":"Robinson S (2007) A statistical process control approach to selecting a warm-up period for a discrete-event simulation. Eur J Oper Res 176(1):332\u2013346","journal-title":"Eur J Oper Res"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Rossetti MD, Li Z, Qu P (2005) Exploring exponentially weighted moving average control charts to determine the warmup period, In: Proceedings of the 2005 winter simulation conference, 771\u2013780","DOI":"10.1109\/WSC.2005.1574321"},{"key":"26_CR15","unstructured":"Rawlins GJE, Sushil JL (2014) Syntactic analysis of convergence in genetic algorithms. Found Genet Algorithms (FOGA 2), 2:141"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.cam.2013.11.008","volume":"261","author":"CFM Toledo","year":"2014","unstructured":"Toledo CFM, Oliveira L, Fran\u00e7a PM (2014) Global optimization using a genetic algorithm with hierarchically structured population. J Comput Appl Math 261:341\u2013351","journal-title":"J Comput Appl Math"}],"container-title":["Lecture Notes in Management and Industrial Engineering","Engineering Digital Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96005-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T10:30:57Z","timestamp":1571913057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96005-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,19]]},"ISBN":["9783319960043","9783319960050"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96005-0_26","relation":{},"ISSN":["2198-0772","2198-0780"],"issn-type":[{"type":"print","value":"2198-0772"},{"type":"electronic","value":"2198-0780"}],"subject":[],"published":{"date-parts":[[2018,9,19]]}}}