An Incremental Approach to Solving Dynamic Constraint Satisfaction Problems

被引：0

作者：

Sharma, Anurag ^{[1
]}

Sharma, Dharmendra ^{[1
]}

机构：

[1] Univ Canberra, Fac Informat Sci & Engn, Canberra, ACT 2601, Australia

来源：

NEURAL INFORMATION PROCESSING, ICONIP 2012, PT III | 2012年 / 7665卷

关键词：

Constraint satisfaction problem (CSP); intelligent constraint handling evolutionary algorithm (ICHEA); evolutionary algorithm (EA); local optima; dynamic constraints; incremental approach; EVOLUTIONARY ALGORITHMS; OPTIMIZATION;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Constraint satisfaction problems (CSPs) underpin many science and engineering applications. Recently introduced intelligent constraint handling evolutionary algorithm (ICHEA) in [14] has demonstrated strong potential in solving them through evolutionary algorithms (EAs). ICHEA outperforms many other evolutionary algorithms to solve CSPs with respect to success rate (SR) and efficiency. This paper is an enhancement of ICHEA to improve its efficiency and SR further by an enhancement of the algorithm to deal with local optima obstacles. The enhancement also includes a capability to handle dynamically introduced constraints without restarting the whole algorithm that uses the knowledge from already solved constraints using an incremental approach. Experiments on benchmark CSPs adapted as dynamic CSPs has shown very promising results.

引用

页码：445 / 455

页数：11

共 50 条

[21] The complexity of Boolean constraint satisfaction local search problems
Chapdelaine, P
Creignou, N
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2005, 43 (1-4) : 51 - 63
[22] The complexity of Boolean constraint satisfaction local search problems
Philippe Chapdelaine
Nadia Creignou
Annals of Mathematics and Artificial Intelligence, 2005, 43 : 51 - 63
[23] Comparing evolutionary algorithms on binary constraint satisfaction problems
Craenen, BGW
Eiben, AE
van Hemert, JI
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (05) : 424 - 444
[24] OPTIMIZATION APPROACHES TO CONSTRAINT SATISFACTION PROBLEMS IN COMPUTER VISION
YAMAMOTO, K
IMAGE AND VISION COMPUTING, 1995, 13 (05) : 335 - 340
[25] Using association rules to guide evolutionary search in solving constraint satisfaction
Raschip, Madalina
Croitoru, Cornelius
Stoffel, Kilian
2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 744 - 750
[26] FastPGA: A dynamic population sizing approach for solving expensive multiobjective optimization problems
Eskandari, Hamidreza
Geiger, Christopher D.
Lamont, Gary B.
EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, PROCEEDINGS, 2007, 4403 : 141 - +
[27] Solving airline crew pairing problems through constraint partitioning
Radman, Maryam
Eshghi, Kourosh
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2023, 17 (01) : 29 - 59
[28] Analysis of Evolutionary Operators for ICHEA in Solving Constraint Optimization Problems
Sharma, Anuraganand
2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 46 - 53
[29] A collective neurodynamic approach for solving distributed system optimum dynamic traffic assignment problems
Shi, Xinli
Xu, Xiangping
Cao, Jinde
NEUROCOMPUTING, 2022, 483 : 411 - 422
[30] Transition models as an incremental approach for problem solving in evolutionary algorithms
Defaweux, Anne
Lenaerts, Tom
van Hemert, Jano
GECCO 2005: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOLS 1 AND 2, 2005, : 599 - 606

← 1 2 3 4 5 →