{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:53:41Z","timestamp":1752461621257},"reference-count":7,"publisher":"MIT Press - Journals","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Evolutionary Computation"],"published-print":{"date-parts":[[2000,9]]},"abstract":"<jats:p> The progress behavior of evolution strategies (ES) using recombination is analyzed in this paper on the parabolic ridge. This test function represents landscapes far from the optimum. The ES algorithms with intermediate and dominant recombination are considered in the analysis. The derivations are presented for intermediate recombination. Thereafter, the formulae for dominant recombination are obtained using the so-called surrogate mutation model. In the analysis, the formulae are derived for the progress rate \u03c6 and for the stationary distance R<jats:sup>(\u221e)<\/jats:sup> to the ridge axis. As a result, it will be shown that the progress rate \u03c6 can increase if recombination is applied. Simulations are used to show the appropriateness of the formulae derived. <\/jats:p>","DOI":"10.1162\/106365600750078781","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:55:01Z","timestamp":1027770901000},"page":"267-289","source":"Crossref","is-referenced-by-count":16,"title":["Analysis of the (\u03bc\/\u03bc, \u03bb)-ES on the Parabolic Ridge"],"prefix":"10.1162","volume":"8","author":[{"given":"A. Irfan","family":"Oyman","sequence":"first","affiliation":[{"name":"University of Dortmund, Department of Computer Science, Systems Analysis Research Group, D-44221 Dortmund, Germany"}]},{"given":"Hans-Georg","family":"Beyer","sequence":"additional","affiliation":[{"name":"University of Dortmund, Department of Computer Science, Systems Analysis Research Group, D-44221 Dortmund, Germany"}]}],"member":"281","reference":[{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1993.1.1.1"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1993.1.2.165"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1994.2.4.381"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1995.3.1.81"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1995.3.3.311"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/S0303-2647(96)01657-7"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1162\/106365600750078772"}],"container-title":["Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/106365600750078781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:30:22Z","timestamp":1615584622000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/evco\/article\/8\/3\/267-289\/882"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["10.1162\/106365600750078781"],"URL":"https:\/\/doi.org\/10.1162\/106365600750078781","relation":{},"ISSN":["1063-6560","1530-9304"],"issn-type":[{"value":"1063-6560","type":"print"},{"value":"1530-9304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}