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.

Keywords: graph layout, crossing number, particle swarm optimization, improved ray optimization, colliding bodies optimization, enhanced colliding bodies optimization.

Full-Text [PDF 208 kb]   (5275 Downloads)