الگوریتم تکاملی و DNA تصمیم گیری برای مسئله فروشنده دوره گرد متعدد
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|78882||2015||8 صفحه PDF||سفارش دهید||محاسبه نشده|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Neurocomputing, Volume 150, Part A, 20 February 2015, Pages 50–57
In the real world, it is common to face optimization problems that have two or more objectives that must be optimized at the same time, that are typically explained in different units, and are in conflict with one another. This paper presents a hybrid structure that combines set of experience knowledge structures (SOEKS) and evolutionary algorithms, NSGA-II (Non-dominated Sorting Genetic Algorithm II), to solve multiple optimization problems. The proposed structure uses experience that is derived from a former decision event to improve the evolutionary algorithm’s ability to find optimal solutions rapidly and efficiently. It is embedded in a smart experience-based data analysis system (SEDAS) introduced in the paper. Experimental illustrative results of SEDAS application to solve a travelling salesman problem show that our new proposed hybrid model can find optimal or close to true Pareto-optimal solutions in a fast and efficient way.