Volume 5, Issue 1 (1-2015)                   2015, 5(1): 67-77 | Back to browse issues page

XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Kaveh A, Ilchi Ghazaan M. METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM. International Journal of Optimization in Civil Engineering. 2015; 5 (1) :67-77
URL: http://ijoce.iust.ac.ir/article-1-199-en.html
Abstract:   (2372 Views)
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in engineering. The proposed algorithms are tested on six complete graphs and eight complete bipartite graphs and their results are compared with some existing methods.
Full-Text [PDF 208 kb]   (1334 Downloads)    
Type of Study: Research | Subject: Optimal design
Received: 2015/01/2 | Accepted: 2015/01/2 | Published: 2015/01/2

Add your comments about this article : Your username or Email:
Write the security code in the box

© 2018 All Rights Reserved | Iran University of Science & Technology

Designed & Developed by : Yektaweb