Optimal answer generation by equivalent transformation incorporating multi-objective genetic algorithm

被引:1
|
作者
Miura, Katsunori [1 ]
Powell, Courtney [2 ]
Munetomo, Masaharu [2 ]
机构
[1] Otaru Univ, Dept Informat & Management Sci, 3-5-21 Midori, Otaru, Hokkaido 0478501, Japan
[2] Hokkaido Univ, Informat Initiat Ctr, Kita Ku, Kita 11,Nishi 5, Sapporo, Hokkaido 0600811, Japan
基金
日本科学技术振兴机构;
关键词
Equivalent transformation; Multi-objective genetic algorithm; Clause replacement; Optimization; Pareto-optimal answer; Predicate logic; LOGICAL EQUIVALENCES; PROGRAM; RULES; FORMULAS; SEARCH;
D O I
10.1007/s00500-022-06923-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes a framework for time-efficiently finding multiple answers that meet multiple logical constraints and are Pareto-optimal for multiple objective functions. The proposed framework determines a set of optimal answers by iteratively replacing a set of definite clauses. Clause replacement is performed using a SAT solver consisting of equivalent transformation rules (ETRs). An ETR replaces a definite clause with one or more clauses while preserving the declarative meaning of the union of the original clause and problem clauses. To efficiently find optimal answers, in this paper, we define a new class of ETRs that are generated based on the evaluation results of a multi-objective genetic algorithm (MOGA) and propose a method for generating ETRs that belong to the new class. ETRs belonging to the new class help to replace definite clauses according to user objectives such as cost-benefit performance, reliability, and financial constraints. Thus, a SAT solver that uses the new ETR class in addition to extant ETR classes can preferentially replace definite clauses that produce the optimal answer for user objectives. Experimental results indicate that the proposed framework can significantly reduce the computation time and memory usage necessary to determine a set of optimal answers for user objectives.
引用
收藏
页码:10535 / 10546
页数:12
相关论文
共 50 条
  • [1] Optimal answer generation by equivalent transformation incorporating multi-objective genetic algorithm
    Katsunori Miura
    Courtney Powell
    Masaharu Munetomo
    [J]. Soft Computing, 2022, 26 : 10535 - 10546
  • [2] A Multi-Objective Genetic Algorithm for Optimal Portfolio Problems
    林丹
    赵瑞
    [J]. Transactions of Tianjin University, 2004, (04) : 310 - 314
  • [3] A Multi-Objective Genetic Algorithm to Test Data Generation
    Pinto, Gustavo H. L.
    Vergilio, Silvia R.
    [J]. 22ND INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2010), PROCEEDINGS, VOL 1, 2010,
  • [4] An equivalent transformation of multi-objective optimization problems
    Zarepisheh, Masoud
    Pardalos, Panos M.
    [J]. ANNALS OF OPERATIONS RESEARCH, 2017, 249 (1-2) : 5 - 15
  • [5] An equivalent transformation of multi-objective optimization problems
    Masoud Zarepisheh
    Panos M. Pardalos
    [J]. Annals of Operations Research, 2017, 249 : 5 - 15
  • [6] A Multi-objective Hybrid Algorithm for Optimal Planning of Distributed Generation
    Pandey, Ravi Shankar
    Awasthi, S. R.
    [J]. ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2020, 45 (04) : 3035 - 3054
  • [7] A Multi-objective Hybrid Algorithm for Optimal Planning of Distributed Generation
    Ravi Shankar Pandey
    S. R. Awasthi
    [J]. Arabian Journal for Science and Engineering, 2020, 45 : 3035 - 3054
  • [8] A micro multi-objective genetic algorithm for multi-objective optimizations
    Liu, G. P.
    Han, X.
    [J]. CJK-OSM 4: THE FOURTH CHINA-JAPAN-KOREA JOINT SYMPOSIUM ON OPTIMIZATION OF STRUCTURAL AND MECHANICAL SYSTEMS, 2006, : 419 - 424
  • [9] Expensive Multi-Objective Evolutionary Algorithm with Multi-Objective Data Generation
    Li, Jian-Yu
    Zhan, Zhi-Hui
    [J]. Jisuanji Xuebao/Chinese Journal of Computers, 2023, 46 (05): : 896 - 908
  • [10] An Improved Multi-Objective Genetic Algorithm for Solving Multi-objective Problems
    Hsieh, Sheng-Ta
    Chiu, Shih-Yuan
    Yen, Shi-Jim
    [J]. APPLIED MATHEMATICS & INFORMATION SCIENCES, 2013, 7 (05): : 1933 - 1941