{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T11:36:36Z","timestamp":1767008196354},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2006,8,18]],"date-time":"2006-08-18T00:00:00Z","timestamp":1155859200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2007,2,15]]},"DOI":"10.1007\/s00500-006-0131-1","type":"journal-article","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T12:07:42Z","timestamp":1155816462000},"page":"687-694","source":"Crossref","is-referenced-by-count":32,"title":["An improved genetic algorithm with conditional genetic operators and its application to set-covering problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Rong-Long","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kozo","family":"Okazaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,8,18]]},"reference":[{"key":"131_CR1","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-library: distributing test problems by electronic mail. J Oper Res Soc 41:1069\u20131072","journal-title":"J Oper Res Soc"},{"key":"131_CR2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0926-5805(00)00096-0","volume":"11","author":"LG Caldas","year":"2002","unstructured":"Caldas LG, Norford LK (2002) A design optimization tool based on a genetic algorithm. Autom Construct 11:173\u2013184","journal-title":"Autom Construct"},{"key":"131_CR3","unstructured":"Caldero NM, Flores M (1996) Solving combinatorial problems through tabu search. Computing Engineer Final Project, Departamento de Ingenierm\u00e0 Inform\u00e0tica, Universidad de Santiago de Chile (in Spanish)"},{"key":"131_CR4","unstructured":"De Jong KA (1975) An analysis of the behaviour of a class of genetic adaptive systems. PhD thesis, University of Michigan"},{"key":"131_CR5","unstructured":"Duclos F (1998) Parallel hybrid algorithms to solve the SCP. Computing Engineer Final Project, Departamento de Ingenierm\u00e0 Inform\u00e0tica, Universidad de Santiago de Chile"},{"key":"131_CR6","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, San Francisco"},{"key":"131_CR7","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading"},{"key":"131_CR8","volume-title":"Practical genetic algorithms","author":"RL Haupt","year":"1998","unstructured":"Haupt RL, Haupt SE (1998) Practical genetic algorithms. Wiley Interscience, New York"},{"key":"131_CR9","volume-title":"Adaption in natural and artificial system","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaption in natural and artificial system. MIT Press, Cambridge"},{"key":"131_CR10","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/j.advengsoft.2005.08.002","volume":"37","author":"SF Hwang","year":"2006","unstructured":"Hwang SF, He RS (2006) Improved real-parameter genetic algorithm with simulated annealing for engineering problems. Adv Eng Softw 37:406\u2013418","journal-title":"Adv Eng Softw"},{"key":"131_CR11","first-page":"110","volume-title":"Proceedings of the 3rd international conference on genetic algorithms","author":"P Jog","year":"1989","unstructured":"Jog P, Suh JY, Van Gucht D (1989). The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem. In: Schaffer JD (eds). Proceedings of the 3rd international conference on genetic algorithms. Morgan Kaufmann, Los Altos, pp. 110\u2013115"},{"key":"131_CR12","volume-title":"Simulated annealing: theory and applications","author":"PJM van Laarhoven","year":"1988","unstructured":"van Laarhoven PJM, Aarts EHL (1988) Simulated annealing: theory and applications. Kluwer, Dordrecht"},{"key":"131_CR13","first-page":"734","volume":"22","author":"H Satoh","year":"1997","unstructured":"Satoh H, Ono I, Kobayashi S (1997) A new generation alternation model of genetic algorithms and its assessment. J Japanese Soc Artif Intell 22:734\u2013744","journal-title":"J Japanese Soc Artif Intell"},{"key":"131_CR14","unstructured":"Sawai H, Kizu S, Endo T (1998) Performance comparison of parameter-free genetic algorithm with steady-state genetic algorithm. IEICE D-II, J81-D-II:1455\u20131459"},{"key":"131_CR15","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/S0377-2217(97)00206-3","volume":"108","author":"LJ Schmitt","year":"1998","unstructured":"Schmitt LJ, Amini MM (1998) Performance characteristics of alternative genetic algorithm approaches to the traveling salesman problem using path representation: an empirical study. Eur J Oper Res 108:551\u2013570","journal-title":"Eur J Oper Res"},{"key":"131_CR16","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1016\/S0305-0548(01)00026-0","volume":"29","author":"M Solar","year":"2002","unstructured":"Solar M, Parada V, Urrutia R (2002) A parallel genetic algorithm to solve the set-covering problem. Comput Oper Res 29:1221\u20131235","journal-title":"Comput Oper Res"},{"key":"131_CR17","unstructured":"Whiley D (1993) A genetic algorithm tutorial. Technical Report CS-93\u2013103, Department of Computer Science, Colorado State University"},{"key":"131_CR18","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02430367","volume":"1","author":"D Whitley","year":"1995","unstructured":"Whitley D, Beverridge R, Graves C, Mathias K (1995) New test functions and geometric matching. J Heuristics 1:77\u2013104","journal-title":"J Heuristics"},{"key":"131_CR19","unstructured":"Whitley D, Kauth J (1988) GENITOR: a different genetic algorithm. In: Proceedings of the Rocky Mountain conference on artificial intelligence, Denver, Colorado, pp 118\u2013130"},{"key":"131_CR20","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0965-9978(99)00054-X","volume":"31","author":"SV Wong","year":"2000","unstructured":"Wong SV, Hamouda AMS (2000) Optimization of fuzzy rules design using genetic algorithm. Adv Eng Softw 31:251\u2013262","journal-title":"Adv Eng Softw"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-006-0131-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-006-0131-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-006-0131-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:39:49Z","timestamp":1559093989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-006-0131-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,18]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2007,2,15]]}},"alternative-id":["131"],"URL":"https:\/\/doi.org\/10.1007\/s00500-006-0131-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,18]]}}}