Title of article
METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
Author/Authors
Kaveh, A. Centre of Excellence for Fundamental Studies in Structural Engineering - Iran University of Science and Technology, Narmak, Tehran , Ilchi Ghazaan, M. Centre of Excellence for Fundamental Studies in Structural Engineering - Iran University of Science and Technology, Narmak, Tehran
Pages
12
From page
67
To page
78
Abstract
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.
Farsi abstract
فاقد چكيده فارسي
Keywords
graph layout , crossing number , particle swarm optimization , improved ray optimization , colliding bodies optimization , enhanced colliding bodies optimization
Journal title
International Journal of Optimization in Civil Engineering
Serial Year
2015
Record number
2510702
Link To Document