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

XML Print

Abstract:   (4304 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]   (1776 Downloads)    
Type of Study: Research | Subject: Optimal design
Received: 2015/01/2 | Accepted: 2015/01/2 | Published: 2015/01/2