تعتبر مسألة إيجاد الحل الأمثل لمسألة الارتباط الجزيئي بين المركبات من المسائل
الصعبة. عند حل المسألة باستخدام الخوارزميات التي تتبع النهج الوحيد الهدف تكون
النتائج متغيرة و معقدة. لا يمكن العثور إلاّ على عدد قليل من الأوراق البحثية التي تتناول
هذه المسألة عن طريق اتباع النهج متعدد الأهداف، كما لم يتم بذل الجهد الكافي لإجراء
مقارنات تجريبية في سبيل توضيح أفضل أداء لأفضل خوارزمية. يكمن هدف هذا البحث
في استخدام مجموعة من خوارزميات الأمثلة متعددة الأهداف و المقارنة بينها لحل مسألة
ارتباط الجزيئات بين المركبات.
Molecular docking is a hard optimization problem that has been
tackled in the past, demonstrating new and challenging results when
looking for one objective . However, only a few papers can be
found in the literature that deal with this problem by means of a
multi-objective approach, and no experimental comparisons have
been made in order to clarify which of them has the best overall
performance. In this research, we use and compare, a set of
representative multi-objective optimization algorithms. The
approach followed is focused on optimizing the inter-molecular and
intra-molecular energies as two main objectives to minimize.
References used
Goodsell- D.S., Morris- G.M, 1998- Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function- pp.1639–166
Roy- R, Oduguwa- A., Tiwari- A, 2006- Multi-objective optimisation of the protein-ligand docking problem in drug discovery- Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation- Seattle- USA- pp. 1793–1800
Grosdidier- A., Zoete- V.- Michielin- O, 2007- EADock: Docking of small molecules into protein active sites with a multi-objective evolutionary optimization- pp. 1010–1025
Multi-objective evolutionary algorithms are used in a wide range
of fields to solve the issues of optimization, which require several
conflicting objectives to be considered together. Basic evolutionary
algorithm algorithms have several drawbacks,
In this research, we are studying the possibility of contribution
in solving the multi-objective vehicle Routing problem with time
windows , that is one of the optimization problems of the NP-hard
type , This problem has attracted a lot of attenti
In the Multi-objective Traveling Salesman Problem (moTSP)
simultaneous optimization of more than one objective functions is
required. This paper proposes hybrid algorithm to solve the multiobjectives
Traveling Salesman problem through the integration of
the ant colony optimization algorithm with the Genetic algorithm.
Modelling and understanding dialogues in a conversation depends on identifying the user intent from the given text. Unknown or new intent detection is a critical task, as in a realistic scenario a user intent may frequently change over time and diver