Robust solutions by using evolutionary computations on dynamic max-sat problems

被引:0
|
作者
Handa, Hisashi [1 ]
机构
[1] Okayama Univ, Grad Sch Nat Sci & Technol, Okayama 7008530, Japan
来源
2006 SICE-ICASE International Joint Conference, Vols 1-13 | 2006年
关键词
dynamic environment; evolutionary computation; robust solution; max-sat problem;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, optimization problems such that the landscape of the objective function changes over time are treated. Conventional approaches for such time-varying functions by using Evolutionary Computations are designed to track moving optimal solutions. On the contrary, the proposed method in this paper tries to find out stable solutions, i.e., robust solutions, which may not be optimal at each time step but exhibit better performance for all time steps. Such stable solutions are useful if the acquired solutions are operated by human.
引用
收藏
页码:4239 / 4242
页数:4
相关论文
共 50 条
  • [1] MAX-SAT Problem using Evolutionary Algorithms
    Ali, H. M.
    Mitchell, David
    Lee, Daniel C.
    2014 IEEE SYMPOSIUM ON SWARM INTELLIGENCE (SIS), 2014, : 105 - 112
  • [2] AN ANT ALGORITHM FOR STATIC AND DYNAMIC MAX-SAT PROBLEMS
    Pinto, Pedro C.
    Runkler, Thomas A.
    Sousa, Joao M. C.
    2006 1ST BIO-INSPIRED MODELS OF NETWORK, INFORMATION AND COMPUTING SYSTEMS, 2006,
  • [3] Wasp swarm algorithm for dynamic MAX-SAT problems
    Pinto, Pedro C.
    Runkler, Thomas A.
    Sousa, Joao M. C.
    ADAPTIVE AND NATURAL COMPUTING ALGORITHMS, PT 1, 2007, 4431 : 350 - +
  • [4] Solving MAX-SAT problems using a memetic evolutionary meta-heuristic
    Boughaci, D
    Drias, H
    Benhamou, B
    2004 IEEE CONFERENCE ON CYBERNETICS AND INTELLIGENT SYSTEMS, VOLS 1 AND 2, 2004, : 480 - 484
  • [5] A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems
    Borchers B.
    Furman J.
    Journal of Combinatorial Optimization, 1998, 2 (4) : 299 - 306
  • [6] A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
    Borchers, B
    Furman, J
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 1999, 2 (04) : 299 - 306
  • [7] Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
    Resende, MGC
    Pitsoulis, LS
    Pardalos, PM
    DISCRETE APPLIED MATHEMATICS, 2000, 100 (1-2) : 95 - 113
  • [8] Three Truth Values for the SAT and MAX-SAT Problems
    Lardeux, Frederic
    Saubion, Frederic
    Hao, Jin-Kao
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 187 - 192
  • [9] Iterated robust tabu search for MAX-SAT
    Smyth, K
    Hoos, HH
    Stützle, T
    ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2003, 2671 : 129 - 144
  • [10] Analog dynamics for solving max-SAT problems
    Molnar, Botond
    Ercsey-Ravasz, Maria
    2014 14TH INTERNATIONAL WORKSHOP ON CELLULAR NANOSCALE NETWORKS AND THEIR APPLICATIONS (CNNA), 2014,