دوره 5، شماره 1 - ( 10-1393 )                   جلد 5 شماره 1 صفحات 67-77 | برگشت به فهرست نسخه ها


XML English Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Kaveh A, Ilchi Ghazaan M. METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM. International Journal of Optimization in Civil Engineering. 2015; 5 (1) :67-77
URL: http://ijoce.iust.ac.ir/article-1-199-fa.html
METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM. دانشگاه علم و صنعت ایران. 1393; 5 (1) :67-77

URL: http://ijoce.iust.ac.ir/article-1-199-fa.html


چکیده:   (1596 مشاهده)
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.
متن کامل [PDF 208 kb]   (967 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: Optimal design
دریافت: ۱۳۹۳/۱۰/۱۲ | پذیرش: ۱۳۹۳/۱۰/۱۲ | انتشار: ۱۳۹۳/۱۰/۱۲

کلیه حقوق این وب سایت متعلق به دانشگاه علم و صنعت ایران می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2015 All Rights Reserved | Iran University of Science & Technology

Designed & Developed by : Yektaweb