{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T18:33:56Z","timestamp":1790188436775,"version":"4.1.0"},"reference-count":33,"publisher":"MIT Press - Journals","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Evolutionary Computation"],"published-print":{"date-parts":[[2019,6]]},"abstract":"<jats:p> The notion and characterisation of fitness landscapes has helped us understand the performance of heuristic algorithms on complex optimisation problems. Many practical problems, however, are constrained, and when significant areas of the search space are infeasible, researchers have intuitively resorted to a variety of constraint-handling techniques intended to help the algorithm manoeuvre through infeasible areas and toward feasible regions of better fitness. It is clear that providing constraint-related feedback to the algorithm to influence its choice of solutions overlays the violation landscape with the fitness landscape in unpredictable ways whose effects on the algorithm cannot be directly measured. In this work, we apply metrics of violation landscapes to continuous and combinatorial problems to characterise them. We relate this information to the relative performance of six well-known constraint-handling techniques to demonstrate how some properties of constrained landscapes favour particular constraint-handling approaches. For the problems with sampled feasible solutions, a bi-objective approach was the best performing approach overall, but other techniques performed better on problems with the most disjoint feasible areas. For the problems with no measurable feasibility, a feasibility ranking approach was the best performing approach overall, but other techniques performed better when the correlation between fitness values and the level of constraint violation was high. <\/jats:p>","DOI":"10.1162\/evco_a_00222","type":"journal-article","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T17:29:17Z","timestamp":1520875757000},"page":"267-289","source":"Crossref","is-referenced-by-count":20,"title":["Constraint Handling Guided by Landscape Analysis in Combinatorial and Continuous Search Spaces"],"prefix":"10.1162","volume":"27","author":[{"given":"Katherine M.","family":"Malan","sequence":"first","affiliation":[{"name":"Department of Decision Sciences, University of South Africa, Pretoria, South Africa"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"I.","family":"Moser","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Software Engineering, Swinburne University of Technology, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"281","reference":[{"key":"B1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330209"},{"key":"B2","author":"Coello Coello C. A.","year":"1999","journal-title":"A survey of constraint handling techniques used with evolutionary algorithms"},{"key":"B3","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(99)00389-8"},{"key":"B4","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"B5","author":"Friedrich T.","year":"2016","journal-title":"GECCO '16: Proceedings of the genetic and evolutionary computation conference 2016"},{"key":"B6","first-page":"57:321","author":"Greenwood G. W.","year":"1998","journal-title":"Physica Scripta"},{"key":"B7","first-page":"28:131","author":"Greenwood G. W.","year":"1998","journal-title":"Computational Statistics and Data Analysis"},{"issue":"1","key":"B8","first-page":"10","volume":"11","author":"Hall M.","year":"2009","journal-title":"Special Interest Group on Knowledge and Discover & Data Mining Explorations Newsletter"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1999.7.1.19"},{"key":"B10","author":"Liang J.","year":"2006","journal-title":"Problem definitions and evaluation criteria for the CEC 2006 competition on constrained real-parameter optimization"},{"key":"B11","first-page":"241:148","author":"Malan K. M.","year":"2013","journal-title":"Information Sciences"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41888-4_4"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2015.7257045"},{"key":"B14","author":"Mallipeddi R.","year":"2010","journal-title":"Problem definitions and evaluation criteria for the CEC 2010 competition on constrained real-parameter optimization"},{"key":"B15","first-page":"143","volume-title":"Proceedings of the Fourth International Conference on Genetic Algorithms","author":"Manderick B.","year":"1991"},{"key":"B16","author":"Mezura-Montes E.","year":"2004","journal-title":"What makes a constrained problem difficult to solve by an evolutionary algorithm?"},{"key":"B17","first-page":"4:135","author":"Michalewicz Z.","year":"1995","journal-title":"Evolutionary Programming"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1996.4.1.1"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00177"},{"key":"B20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32378-2_6"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41888-4_9"},{"key":"B22","first-page":"29","volume-title":"Evolutionary constrained optimization","author":"Poursoltan S.","year":"2014"},{"key":"B23","volume-title":"C4.5: Programs for machine learning","author":"Quinlan J. R","year":"1993"},{"key":"B24","first-page":"15:65","author":"Rice J. R.","year":"1976","journal-title":"Advances in Computers"},{"key":"B25","first-page":"191","volume-title":"Proceedings of the Third International Conference on Genetic Algorithms","author":"Richardson J. T.","year":"1989"},{"key":"B26","doi-asserted-by":"publisher","DOI":"10.1109\/4235.873238"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2008.4634391"},{"key":"B28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45692-9_10"},{"key":"B29","author":"Storn R.","year":"1995","journal-title":"Differential evolution\u2014A simple and efficient adaptive scheme for global optimization over continuous spaces"},{"key":"B30","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1996.542711"},{"key":"B31","first-page":"1019","author":"Takahama T.","year":"2005","journal-title":"Constrained optimization by constrained particle swarm optimizer with -level control"},{"key":"B32","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2006.1688283"},{"key":"B33","doi-asserted-by":"publisher","DOI":"10.1007\/BF00202749"}],"container-title":["Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/evco_a_00222","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:59:00Z","timestamp":1615586340000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/evco\/article\/27\/2\/267-289\/1089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["10.1162\/evco_a_00222"],"URL":"https:\/\/doi.org\/10.1162\/evco_a_00222","relation":{},"ISSN":["1063-6560","1530-9304"],"issn-type":[{"value":"1063-6560","type":"print"},{"value":"1530-9304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6]]}}}