{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T22:40:01Z","timestamp":1745102401868,"version":"3.40.4"},"publisher-location":"London","reference-count":16,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781447147381"},{"type":"electronic","value":"9781447147398"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-1-4471-4739-8_28","type":"book-chapter","created":{"date-parts":[[2012,10,30]],"date-time":"2012-10-30T07:27:13Z","timestamp":1351582033000},"page":"361-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimizing Opening Strategies in a Real-time Strategy Game by a Multi-objective Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Bj\u00f6rn","family":"Gmeiner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerald","family":"Donnert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harald","family":"K\u00f6stler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,9]]},"reference":[{"key":"28_CR1","unstructured":"E. Cant\u2019u-Paz. A survey of parallel genetic algorithms. Calculateurs paralleles, reseaux et systems repartis, 10(2):141\u2013171, 1998."},{"key":"28_CR2","unstructured":"L. Davis and M. Mitchell. Handbook of genetic algorithms. Van Nostrand Reinhold, 1991."},{"key":"28_CR3","unstructured":"K. Deb and T. Goel. Controlled elitist non-dominated sorting genetic algorithms for better"},{"issue":"2","key":"28_CR4","first-page":"67","volume":"6","author":"K. Deb","year":"2001","unstructured":"convergence. In Evolutionary Multi-Criterion Optimization, pages 67\u201381. Springer, 2001.4. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: Nsga-ii. Evolutionary Computation, IEEE Transactions on, 6(2):182\u2013197, 2002.","journal-title":"IEEE Transactions on"},{"issue":"3","key":"28_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/1932409","volume":"26","author":"LR Dice","year":"1945","unstructured":"L.R. Dice. Measures of the amount of ecologic association between species. Ecology, 26(3):297\u2013302, 1945.","journal-title":"Ecology"},{"key":"28_CR6","unstructured":"C.M. Fonseca and P.J. Fleming. Genetic algorithms for multiobjective optimization: Formulation discussion and generalization. In Proceedings of the 5th International Conference on Genetic Algorithms, pages 416\u2013423. Morgan Kaufmann Publishers Inc., 1993."},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"F. Glover and M. Laguna. Tabu search, volume 1. Springer, 1998.","DOI":"10.1007\/978-1-4615-6089-0_1"},{"key":"28_CR8","unstructured":"D.E. Goldberg. Genetic algorithms in search, optimization, and machine learning. Addisonwesley, 1989."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"R.L. Haupt. Optimum population size and mutation rate for a simple real genetic algorithm that optimizes array factors. In Antennas and Propagation Society International Symposium, 2000. IEEE, volume 2, pages 1034 \u20131037 vol.2, 2000.","DOI":"10.1109\/APS.2000.875398"},{"key":"28_CR10","volume-title":"and J","author":"RL Haupt","year":"2004","unstructured":"R.L. Haupt, S.E. Haupt, and J. Wiley. Practical genetic algorithms. Wiley Online Library, 2004."},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"J. Horn, N. Nafpliotis, and D.E. Goldberg. A niched pareto genetic algorithm for multiobjective optimization. In Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on, pages 82\u201387. IEEE, 1994.","DOI":"10.1109\/ICEC.1994.350037"},{"issue":"5","key":"28_CR12","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TEVC.2003.817234","volume":"7","author":"MT Jensen","year":"2003","unstructured":"M.T. Jensen. Reducing the run-time complexity of multiobjective eas: The nsga-ii and other algorithms. Evolutionary Computation, IEEE Transactions on, 7(5):503\u2013515, 2003.","journal-title":"Evolutionary Computation, IEEE Transactions on"},{"issue":"2","key":"28_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"JD Knowles","year":"2000","unstructured":"J.D. Knowles and D.W. Corne. Approximating the nondominated front using the pareto archived evolution strategy. Evolutionary computation, 8(2):149\u2013172, 2000.","journal-title":"Evolutionary computation"},{"key":"28_CR14","unstructured":"M.L. Mauldin. Maintaining diversity in genetic search. In Proceedings of the national conference on artificial intelligence, volume 247, page 250, 1984."},{"issue":"2","key":"28_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.knosys.2004.03.001","volume":"17","author":"A Misevicius","year":"2004","unstructured":"A. Misevicius. An improved hybrid genetic algorithm: new results for the quadratic assignment problem. Knowledge-Based Systems, 17(2):65\u201373, 2004.","journal-title":"Knowledge-Based Systems"},{"issue":"4","key":"28_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"E. Zitzler and L. Thiele. Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. Evolutionary Computation, IEEE Transactions on, 3(4):257\u2013271, 1999.","journal-title":"Evolutionary Computation, IEEE Transactions on"}],"container-title":["Research and Development in Intelligent Systems XXIX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-4739-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T22:19:37Z","timestamp":1745101177000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-4739-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9781447147381","9781447147398"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-4739-8_28","relation":{},"subject":[],"published":{"date-parts":[[2012]]},"assertion":[{"value":"9 October 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}