{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:18:41Z","timestamp":1778249921020,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540239314","type":"print"},{"value":"9783540304999","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30499-9_33","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T09:41:13Z","timestamp":1277890873000},"page":"224-229","source":"Crossref","is-referenced-by-count":3,"title":["A Partheno-genetic Algorithm for Combinatorial Optimization"],"prefix":"10.1007","author":[{"given":"Maojun","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaosheng","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"33_CR1","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/01969729508927504","volume":"26","author":"W. Lin","year":"1995","unstructured":"Lin, W., Delgadofiras, Y.G., Gause, D.C., et al.: Hybrid Newton Raphson Genetic Algorithm for the Traveling Salesman Problem. Cybernetics and Systems\u00a026(4), 387\u2013412 (1995)","journal-title":"Cybernetics and Systems"},{"key":"33_CR2","unstructured":"Xiaoyuan, H., Sihan, X., Shulin, W.: Application of Genetic Algorithm in Train Line Holding. Information and Control\u00a025(1), 58\u201363 (1996) (in Chinese)"},{"issue":"1","key":"33_CR3","first-page":"33","volume":"16","author":"W. Bo","year":"2001","unstructured":"Bo, W., Qun, Z., Fei, W., et al.: Quantitative Analysis of Infeasible Solution to Job Shop Scheduling Problem. Control and Decision\u00a016(1), 33\u201336 (2001) (in Chinese)","journal-title":"Control and Decision"},{"issue":"1","key":"33_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","volume":"32","author":"I. Kacem","year":"2002","unstructured":"Kacem, I., Hammadi, S., Borne, P.: Approach by Localization and Multi-objective Evolutionary Optimization for Flexible Job-Shop Scheduling Problems. IEEE trans on Systems, Man and Cybernetics-Part C: Applications and Reviews\u00a032(1), 1\u201313 (2002)","journal-title":"IEEE trans on Systems, Man and Cybernetics-Part C: Applications and Reviews"},{"issue":"4","key":"33_CR5","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1109\/3468.508827","volume":"26","author":"P. Larranga","year":"1996","unstructured":"Larranga, P., Kuijipers, C.M.H., Murga, R.H., et al.: Learning Bayesian Network Structures for the Best ordering with Genetic Algorithms. IEEE trans on Systems Man and Cybernetics-Part A: Systems and Humans\u00a026(4), 487\u2013493 (1996)","journal-title":"IEEE trans on Systems Man and Cybernetics-Part A: Systems and Humans"},{"issue":"6","key":"33_CR6","first-page":"56","volume":"25","author":"L. Maojun","year":"1998","unstructured":"Maojun, L., Tiaosheng, T.: A Partheno-genetic Algorithm and Its Applications. Journal of Hunan University\u00a025(6), 56\u201359 (1998)","journal-title":"Journal of Hunan University"},{"issue":"1","key":"33_CR7","first-page":"61","volume":"19","author":"L. Maojun","year":"2001","unstructured":"Maojun, L., Taoye, Z., Tiaosheng, T.: Comparison Between Partheno-genetic Algorithm and Traditional Genetic Algorithm. System Engineering\u00a019(1), 61\u201365 (2001)","journal-title":"System Engineering"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30499-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:05:11Z","timestamp":1778249111000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30499-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239314","9783540304999"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30499-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}