Do you want to publish a course? Click here

New Hybrid Evolutionary Algorithm for Solving Multi-Objective Optimization Problems

اقتراح خوارزمية تطورية هجينة لحل مسائل الأمثلة المتعددة الأهداف

2064   1   57   0 ( 0 )
 Publication date 2017
and research's language is العربية
 Created by Shamra Editor




Ask ChatGPT about the research

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, such as lack of a good criterion for termination, and lack of evidence of good convergence. A multi-objective hybrid evolutionary algorithm is often used to overcome these defects.

References used
A. Abraham, L. Jain, and R. Gldenberg,2004. Evolutionary Multi- Objective optimization- theorical Advances and Applications, 1st ed
Coello Coello-C.A., Van Veldhuizen-D.A., Lamont-G.B.,2007. Evolutionary Algorithms for Solving Multi-Objective Problems, Springer
G. Ashish and S. Dehuri,2004. Evolutionary Algorithms for Multi- Criterion Optimization A Survey, International Journal of Computing and Information Sciences, vol. 2
rate research

Read More

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.
we constructed a continuation predictor- corrector algorithm that solves constrained optimization problems. Smooth penalty functions combined with numerical continuation, along with the use of the expanded Lagrangian system, were essential compone nts of the algorithm. An improvement of this algorithm was published, which dealt with the linear algebra in the corrector part of the algorithm.
Conjugate gradient algorithms are important for solving unconstrained optimization problems, so that we present in this paper conjugate gradient algorithm depending on improving conjugate coefficient achieving sufficient descent condition and globa l convergence by doing hybrid between the two conjugate coefficients [1] and [2]. Numerical results show the efficiency of the suggested algorithm after its application on several standard problems and comparing it with other conjugate gradient algorithms according to number of iterations, function value and norm of gradient vector.
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 on now because of its real life applications. Moreover, We will also introduced an algorithm called hybrid algorithm (HA) which depends on integrates between Multiple objective ant colony optimisation (MOACO) and tabu search (TS) algorithm based on the Pareto optimization , and compare the presented approach is the developer with standard tests to demonstrate the applicability and efficiency.
In this paper we offer a new interactive method for solving Multiobjective linear programming problems. This method depends on forming the model for reducing the relative deviations of objective functions from their ideal standard, and dealing with the unsatisfying deviations of objective functions by reacting with decision maker. The results obtained from using this method were compared with many interactive methods as (STEM Method[6] – Improvement STEM Method[7] – Matejas-peric Method[8]). Numerical results indicate that the efficiency of purposed method comparing with the obtained results by using that methods at initial solution point and the other interactive points with decision maker.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا