Drift analysis of ant colony optimization of stochastic linear pseudo-boolean functions

被引：1
|
作者：
Brahimi, Nassim [1 ]
Salhi, Abdellah [2 ]
Ourbih-Tari, Megdouda [1 ,3 ]
机构：
[1] Univ Bejaia, Fac Sci Exactes, Lab Math Appl, Bejaia 06000, Algeria
[2] Univ Essex, Fac Sci & Hlth, Dept Math Sci, Colchester CO4 3SQ, Essex, England
[3] Ctr Univ Morsli Abdellah Tipaza, Inst Sci & Technol, Tipasa 42000, Algeria
来源：
OPERATIONS RESEARCH LETTERS | 2017年 / 45卷 / 04期
关键词：
Drift analysis; Runtime analysis; Ant System; Global optimization; THEORETICAL-ANALYSIS; BOUNDS; TIME;
D O I：
10.1016/j.orl.2017.05.002
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper we study the behavior of a variant of the Max-Min Ant System algorithm when applied to a stochastic Linear Pseudo-Boolean Optimization problem. Previous related work is on a partial analysis of its performance on a different problem. Here, we carry out its complete performance analysis giving a bound on its average runtime using drift analysis. For the purpose, we give a new drift theorem and use it to analyze the algorithm when applied to our problem. (C) 2017 Published by Elsevier B.V.
引用
收藏
页码：342 / 347
页数：6
相关论文
共 50 条
  • [1] Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions
    Koetzing, Timo
    Neumann, Frank
    Sudholt, Dirk
    Wagner, Markus
    [J]. FOGA 11: PROCEEDINGS OF THE 2011 ACM/SIGEVO FOUNDATIONS OF GENETIC ALGORITHMS XI, 2011, : 209 - 218
  • [2] On Boolean functions encodable as a single linear Pseudo-Boolean constraint
    Smaus, Jan-Georg
    [J]. INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, PROCEEDINGS, 2007, 4510 : 288 - 302
  • [3] Modified Max-Min Ant Colony System for Solving Pseudo-Boolean Optimization Problem
    Zhen, Liu
    Ren, Zhou Yu
    [J]. 2009 SECOND INTERNATIONAL CONFERENCE ON FUTURE INFORMATION TECHNOLOGY AND MANAGEMENT ENGINEERING, FITME 2009, 2009, : 132 - 135
  • [4] Pseudo-Boolean optimization
    Boros, E
    Hammer, PL
    [J]. DISCRETE APPLIED MATHEMATICS, 2002, 123 (1-3) : 155 - 225
  • [5] Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
    Ding, Guoli
    Lax, Robert F.
    Chen, Peter
    Chen, Jianhua
    [J]. JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS, 2007, 11 (04) : 403 - 409
  • [6] Calculus of Pseudo-Boolean Functions
    Zhao Yin
    Cheng Daizhan
    [J]. PROCEEDINGS OF THE 31ST CHINESE CONTROL CONFERENCE, 2012, : 267 - 272
  • [7] Locally monotone Boolean and pseudo-Boolean functions
    Couceiro, Miguel
    Marichal, Jean-Luc
    Waldhauser, Tamas
    [J]. DISCRETE APPLIED MATHEMATICS, 2012, 160 (12) : 1651 - 1660
  • [8] How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
    Doerr, Benjamin
    Johannsen, Daniel
    Tang, Ching Hoo
    [J]. PARALLEL PROBLEM SOLVING FROM NATURE - PPSN X, PROCEEDINGS, 2008, 5199 : 378 - 388
  • [9] ADAPTIVENESS IN MONOTONE PSEUDO-BOOLEAN OPTIMIZATION AND STOCHASTIC NEURAL COMPUTATION
    Grossi, Giuliano
    [J]. INTERNATIONAL JOURNAL OF NEURAL SYSTEMS, 2009, 19 (04) : 241 - 252
  • [10] Algebraic method to pseudo-Boolean function and its application in pseudo-Boolean optimization
    Li, Zhiqiang
    Song, Jinli
    Xiao, Huimin
    [J]. PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012), 2012, : 2468 - 2472
12345