Ant colony optimisation with local search for the bandwidth minimisation problem on graphs

被引：0
|
作者：
Guan J. [1 ]
Lin G. [2 ]
Feng H.-B. [3 ]
机构：
[1] Modern Educational Technology Center, Minjiang University, Fuzhou
[2] College of Mathematics and Data Science, Minjiang University, Fuzhou
[3] College of Computer and Control Engineering, Minjiang University, Fuzhou
来源：
International Journal of Intelligent Information and Database Systems | 2019年 / 12卷 / 1-2期
基金：
中国国家自然科学基金;
关键词：
Ant colony optimisation; Bandwidth minimisation problem; Intelligent algorithm; Local search; Metaheuristics;
D O I：
10.1504/IJIIDS.2019.102327
中图分类号：
学科分类号：
摘要：
The bandwidth minimisation problem on graphs (BMPG) is an NP-complete problem, which consists of labelling the vertices of a graph with the integers from 1 to n (n is the number of vertices) such that the maximum absolute difference between labels of adjacent vertices is as small as possible. In this paper, an application of the ant colony optimisation with local search is presented to solve the bandwidth minimisation problem. The main novelty of the proposed approach is an efficient local search combined with first improvement and best improvement strategies. A fast incremental evaluation technique is employed to avoid excessive fitness evaluations of moves in local search. Computational experiments on 56 benchmark instances show that the proposed algorithm is able to achieve competitive results. Copyright © 2019 Inderscience Enterprises Ltd.
引用
收藏
页码：65 / 78
页数：13
相关论文
共 50 条
  • [21] Accelerating ant colony optimisation for the travelling salesman problem on the GPU
    Uchida, Akihiro
    Ito, Yasuaki
    Nakano, Koji
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2014, 29 (04) : 401 - 420
  • [22] NetLogo implementation of an ant colony optimisation solution to the traffic problem
    Jerry, Kponyo
    Kuang Yujun
    Kwasi, Opare
    Enzhan, Zhang
    Parfait, Tebe
    IET INTELLIGENT TRANSPORT SYSTEMS, 2015, 9 (09) : 862 - 869
  • [23] Ant Colony Optimization with Local Search for Continuous Functions
    Qi, Chengming
    ADVANCED RESEARCH ON INDUSTRY, INFORMATION SYSTEMS AND MATERIAL ENGINEERING, PTS 1-7, 2011, 204-210 : 1135 - 1138
  • [24] Ant colony search algorithms for optimal packing problem
    Peng, W
    Tong, RF
    Tang, M
    Dong, JX
    ADVANCES IN NATURAL COMPUTATION, PT 2, PROCEEDINGS, 2005, 3611 : 1229 - 1238
  • [25] Ant colony optimisation with elitist ant for sequencing problem in a mixed model assembly line
    Zhu, Qiong
    Zhang, Jie
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (15) : 4605 - 4626
  • [26] Estimation-based ant colony optimization and local search for the probabilistic traveling salesman problem
    Balaprakash P.
    Birattari M.
    Stützle T.
    Yuan Z.
    Dorigo M.
    Swarm Intell., 2009, 3 (223-242): : 223 - 242
  • [27] MST Ant Colony Optimization with Lin-Kerninghan Local Search for the Traveling Salesman Problem
    Zhang, Ying
    Li, Lijie
    PROCEEDINGS OF THE 2008 INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN, VOL 1, 2008, : 344 - +
  • [28] Optimization by Ant Colony hybrid Local Search for online Class Constrained Bin Packing problem
    Lin, Tsai-Duan
    Hsu, Chiun-Chieh
    Hsu, Li-Fu
    INFORMATION, COMMUNICATION AND ENGINEERING, 2013, 311 : 123 - 128
  • [29] Dynamic ant colony optimisation
    Angus, D
    Hendtlass, T
    APPLIED INTELLIGENCE, 2005, 23 (01) : 33 - 38
  • [30] Competitive ant colony optimisation
    Randall, Marcus
    NEW TRENDS IN APPLIED ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2007, 4570 : 974 - 983
12345