METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
Publish Year: 1393
Type: Journal paper
Language: English
View: 129
This Paper With 11 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
JR_IJOCE-5-1_005
Index date: 25 November 2023
METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM 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.
METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM Keywords:
graph layout , crossing number , particle swarm optimization , improved ray optimization , colliding bodies optimization , enhanced colliding bodies optimization.
METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM authors