@inproceedings{8a052110612340c9966db25d60e7b28a,
title = "Feasibility restoration for iterative meta-heuristics search algorithms",
abstract = "Many combinatorial optimisation problems have constraints that are difficult for meta-heuristic search algorithms to process. One approach is that of feasibility restoration. This technique allows the feasibility of the constraints of a problem to be broken and then brought back to a feasible state. The advantage of this is that the search can proceed over infeasible regions, thus potentially exploring difficult to reach parts of the state space. In this paper, a generic feasibility restoration scheme is proposed for use with the neighbourhood search algorithm simulated annealing. Some improved solutions to standard test problems are recorded.",
author = "Marcus Randall",
year = "2002",
month = jan,
day = "1",
doi = "10.1007/3-540-48035-8_17",
language = "English",
isbn = "3540437819",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag London Ltd.",
pages = "168--178",
editor = "Tim Hendtlass and Moonis Ali",
booktitle = "Developments in Applied Artificial Intelligence - 15th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2002, Proceedings",
address = "Italy",
note = "15th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2002 ; Conference date: 17-06-2002 Through 20-06-2002",
}