Krzysztof Krawiec


Home

Research:

edit SideBar

In metaheuristic algorithms applied to certain problems, it may be difficult to design search operators that guarantee producing feasible search points. In such cases, it may be more efficient to allow a search operator to yield an infeasible solution, and then turn it into a feasible one using a repair process. This paper is an attempt to provide a broad perspective on the candidate solution repair and frame it as a metaheuristic design pattern.

@INPROCEEDINGS { Krawiec:2014:GECCOWorkshop,
    AUTHOR = { Krawiec, Krzysztof },
    TITLE = { Metaheuristic Design Pattern: Candidate Solution Repair },
    BOOKTITLE = { Proceedings of the 2014 Conference Companion on Genetic and Evolutionary Computation Companion },
    SERIES = { GECCO Comp '14 },
    YEAR = { 2014 },
    ISBN = { 978-1-4503-2881-4 },
    LOCATION = { Vancouver, BC, Canada },
    PAGES = { 1415--1418 },
    NUMPAGES = { 4 },
    URL = { http://doi.acm.org/10.1145/2598394.2609847 },
    DOI = { 10.1145/2598394.2609847 },
    ACMID = { 2609847 },
    PUBLISHER = { ACM },
    ADDRESS = { New York, NY, USA },
    KEYWORDS = { feasibility, metaheuristic algorithms, search operators, solution repair },
    ABSTRACT = { In metaheuristic algorithms applied to certain problems, it may be difficult to design search operators that guarantee producing feasible search points. In such cases, it may be more efficient to allow a search operator to yield an infeasible solution, and then turn it into a feasible one using a repair process. This paper is an attempt to provide a broad perspective on the candidate solution repair and frame it as a metaheuristic design pattern. },
}


Powered by PmWiki