دوره 5، شماره 1 - ( 10-1393 )
جلد 5 شماره 1 صفحات 77-67 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Kaveh A, Ilchi Ghazaan M. METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM. IJOCE 2015; 5 (1) :67-77
URL: http://ijoce.iust.ac.ir/article-1-199-fa.html
URL: http://ijoce.iust.ac.ir/article-1-199-fa.html
METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM. عنوان نشریه. 1393; 5 (1) :67-77
چکیده: (21115 مشاهده)
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.
نوع مطالعه: پژوهشي |
موضوع مقاله:
Optimal design
دریافت: 1393/10/12 | پذیرش: 1393/10/12 | انتشار: 1393/10/12
دریافت: 1393/10/12 | پذیرش: 1393/10/12 | انتشار: 1393/10/12
| بازنشر اطلاعات | |
 | این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
