METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
سال انتشار: 1393
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 58
فایل این مقاله در 11 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJOCE-5-1_005
تاریخ نمایه سازی: 5 آذر 1402
چکیده مقاله:
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.
کلیدواژه ها:
graph layout ، crossing number ، particle swarm optimization ، improved ray optimization ، colliding bodies optimization ، enhanced colliding bodies optimization.
نویسندگان