Solving Optimization Problems via Vortex Optimization Algorithm and Cognitive Development Optimization Algorithm
<p>In the fields which require finding the most appropriate value, optimization became a vital approach to employ effective solutions. With the use of optimization techniques, many different fields in the modern life have found solutions to their real-world based problems. In this context, cla...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
EduSoft publishing
2017-01-01
|
Series: | Brain: Broad Research in Artificial Intelligence and Neuroscience |
Subjects: | |
Online Access: | http://www.edusoft.ro/brain/index.php/brain/article/view/650 |
Summary: | <p>In the fields which require finding the most appropriate value, optimization became a vital approach to employ effective solutions. With the use of optimization techniques, many different fields in the modern life have found solutions to their real-world based problems. In this context, classical optimization techniques have had an important popularity. But after a while, more advanced optimization problems required the use of more effective techniques. At this point, Computer Science took an important role on providing software related techniques to improve the associated literature. Today, intelligent optimization techniques based on Artificial Intelligence are widely used for optimization problems. The objective of this paper is to provide a comparative study on the employment of classical optimization solutions and Artificial Intelligence solutions for enabling readers to have idea about the potential of intelligent optimization techniques. At this point, two recently developed intelligent optimization algorithms, Vortex Optimization Algorithm (VOA) and Cognitive Development Optimization Algorithm (CoDOA), have been used to solve some multidisciplinary optimization problems provided in the source book Thomas' Calculus 11th Edition and the obtained results have compared with classical optimization solutions. </p> |
---|---|
ISSN: | 2068-0473 2067-3957 |