Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/246437 
Year of Publication: 
2021
Citation: 
[Journal:] Operations Research Perspectives [ISSN:] 2214-7160 [Volume:] 8 [Publisher:] Elsevier [Place:] Amsterdam [Year:] 2021 [Pages:] 1-15
Publisher: 
Elsevier, Amsterdam
Abstract: 
It has been shown that evolutionary algorithms are able to construct suitable search strategies for classes of Constraint Satisfaction Problems (CSPs) in Constraint Programming. This paper is an explanation of the use of multi-objective optimisation in contrast to simple additive weighting techniques with a view to develop search strategies to classes of CSPs. A hierarchical scheme is employed to select a candidate strategy from the Pareto frontier for final evaluation. The results demonstrate that multi-objective optimisation significantly outperforms the single objective scheme in the same number of objective evaluations. In situations where strategies developed for a class of problems fail to extend to unseen problem instances of the same class, it is found that the structure of the underlying CSPs do not resemble those employed in the training process.
Subjects: 
Combinatorial optimization
Constraint programming
Genetic algorithms
Multi-objective optimization
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.