Fuzzy hybrid simulated annealing algorithms for topology design of switched local area networks

被引:11
|
作者
Khan, Salman A. [1 ]
Engelbrecht, Andries P. [1 ]
机构
[1] Univ Pretoria, Dept Comp Sci, ZA-0002 Pretoria, South Africa
关键词
network topology; fuzzy logic; distributed networks; simulated annealing; simulated evolution; GENETIC ALGORITHM; OPTIMIZATION;
D O I
10.1007/s00500-008-0292-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Topology design of switched local area networks (SLAN) is classified as an NP-hard problem since a number of objectives, such as monetary cost, network delay, hop count between communicating pairs, and reliability need to be simultaneously optimized under a set of constraints. This paper presents a multiobjective heuristic based on a simulated annealing (SA) algorithm for topology design of SLAN. Fuzzy logic has been incorporated in the SA algorithm to handle the imprecise multiobjective nature of the SLAN topology design problem, since the logic provides a suitable mathematical framework to address the multiobjective aspects of the problem. To enhance the performance of the proposed fuzzy simulated annealing (FSA) algorithm, two variants of FSA are also proposed. These variants incorporate characteristics of tabu search (TS) and simulated evolution (SimE) algorithms. The three proposed fuzzy heuristics are mutually compared with each other. Furthermore, two fuzzy operators, namely, ordered weighted average (OWA) and unified AND-OR (UAO) are also applied in certain steps of these algorithms. Results show that in general, the variant which embeds characteristics of SimE and TS into the fuzzy SA algorithm exhibits more intelligent search of the solution subspace and was able to find better solutions than the other two variants of the fuzzy SA. Also, the OWA and UAO operators exhibited relatively similar performance.
引用
收藏
页码:45 / 61
页数:17
相关论文
共 50 条
  • [31] Simulated annealing with local search - A hybrid algorithm for unit commitment
    Purushothama, GK
    Jenkins, L
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2003, 18 (01) : 273 - 278
  • [32] Location area planning in cellular networks using simulated annealing
    Demirkol, I
    Ersoy, C
    Caglayan, MU
    Delic, H
    IEEE INFOCOM 2001: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: TWENTY YEARS INTO THE COMMUNICATIONS ODYSSEY, 2001, : 13 - 20
  • [33] Structural topology optimisation using simulated annealing with multiresolution design variables
    Bureerat, Sujin
    Limtragool, Jumlong
    FINITE ELEMENTS IN ANALYSIS AND DESIGN, 2008, 44 (12-13) : 738 - 747
  • [34] Hybrid Algorithms for Fuzzy Reverse Supply Chain Network Design
    Che, Z. H.
    Chiang, Tzu-An
    Kuo, Y. C.
    Cui, Zhihua
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [35] Iterated local search and simulated annealing algorithms for the inventory routing problem
    Alvarez, Aldair
    Munari, Pedro
    Morabito, Reinaldo
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2018, 25 (06) : 1785 - 1809
  • [36] HYBRID SIMULATED ANNEALING AND GENETIC ALGORITHMS FOR INDUSTRIAL PRODUCTION MANAGEMENT PROBLEMS
    Vasant, Pandian
    INTERNATIONAL JOURNAL OF COMPUTATIONAL METHODS, 2010, 7 (02) : 279 - 297
  • [37] HYBRID SIMULATED ANNEALING AND GENETIC ALGORITHMS FOR INDUSTRIAL PRODUCTION MANAGEMENT PROBLEMS
    Vasant, Pandian
    Barsoum, Nader
    POWER CONTROL AND OPTIMIZATION, PROCEEDINGS, 2009, 1159 : 254 - +
  • [38] A hybrid simulated annealing and column generation approach for capacitated multicommodity network design
    Yaghini, M.
    Rahbar, M.
    Karimi, M.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2013, 64 (07) : 1010 - 1020
  • [39] A hybrid simulated annealing and optimality criteria method for optimum design of RC buildings
    Li, Gang
    Lu, Haiyan
    Liu, Xiang
    STRUCTURAL ENGINEERING AND MECHANICS, 2010, 35 (01) : 19 - 35
  • [40] Hybrid Simulated Annealing to Optimize the Water Distribution Network Design: A Real Case
    Bermudez, Carlos
    Alfonso, Hugo
    Minetti, Gabriela
    Salto, Carolina
    COMPUTER SCIENCE - CACIC 2020, 2021, 1409 : 19 - 34