Volume 10, Issue 1 (1-2020)
2020, 10(1): 35-51 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Kaveh A, Biabani Hamedani K. META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS. International Journal of Optimization in Civil Engineering 2020; 10 (1) :35-51
URL: http://ijoce.iust.ac.ir/article-1-419-en.html
URL: http://ijoce.iust.ac.ir/article-1-419-en.html
Abstract: (13265 Views)
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for embedding graphs in the plane. The algorithms consist of Artificial Bee Colony algorithm, Big Bang-Big Crunch algorithm, Teaching-Learning-Based Optimization algorithm, Cuckoo Search algorithm, Charged System Search algorithm, Tug of War Optimization algorithm, Water Evaporation Optimization algorithm, and Vibrating Particles System algorithm. The performance of the utilized algorithms is investigated through various examples including six complete graphs and eight complete bipartite graphs. Convergence histories of the algorithms are provided to better understanding of their performance. In addition, optimum results at different stages of the optimization process are extracted to enable to compare the meta-heuristics algorithms.
Keywords: crossing number, meta-heuristic algorithms, optimization, 2-page book drawing, complete graph, complete bipartite graph
Type of Study: Research |
Subject:
Applications
Received: 2019/12/1 | Accepted: 2019/12/1 | Published: 2019/12/1
Received: 2019/12/1 | Accepted: 2019/12/1 | Published: 2019/12/1
| Rights and permissions | |
 | This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
