Dissertation > Excellent graduate degree dissertation topics show

Multiobjective Evolutionary Algorithm Based on Symmetric Latin Hypercube Designs

Author: WangQun
Tutor: WangYuPing
School: Xi'an University of Electronic Science and Technology
Course: Operational Research and Cybernetics
Keywords: Multiobjective evolutionary algorithm Non-convex pareto front Symmetric latin hypercube designs Elitism strategy
CLC: O221.6
Type: Master's thesis
Year: 2011
Downloads: 275
Quote: 1
Read: Download Dissertation

Abstract


Coupling with the rapid development of technology and economy, people have encountered complicated Multiobjective Optimization Problems (MOPs) in various fields. The incommensurable and competing objectives which aim to be optimal synchronously are characteristic of these problems. For example, when we design the distribution of communication base stations, there are usually two objectives. One is the maximization of the communication zone covered by base stations; the other is the minimization of the quantities of base stations to save the cost. Different from the single objective optimization problems which usually have one global optimal solution, MOPs often have infinite number of Pareto optimal solutions. Therefore, it is of great urgency to design new algorithms for MOP which can generate a set of widely spread and uniformly distributed solutions on the entire Pareto front.The classical methods, such as Weighted Sums of Objectives,ε-constrained method, goal programming etc, for multiobjective optimization problems convert the multiobjective problems into scalar ones, and then solve them using the methods of Mathematical Programming. However, these algorithms often fail to produce the nondominated solutions which lie in the nonconvex region. Multiobjective evolutionary algorithms are efficient methods for global searching and can produce multiple nondominated solutions in a single round. It is insensitive to the shape and continuity of the Pareto front. Also, it has better convergence near the true Pareto optimal front compared to the classical methods.In this thesis, the basic concepts, theories and frameworks of the classical methods, multiobjective evolutionary algorithms are reviewed and analyzed systematically first. Then an improved multiobjective evolutionary algorithm called SLHD-MOEA is proposed which is based on the space-filling property of SLHD. This algorithm first creates various different sets of the weights by SLHD and then generates a scheme of multiple weighted-sum fitness function. The fitness function defined in this way can guide the search more effectively than in classical way. Moreover, a new kind of initial population and a crossover operator based on SLHD are presented. Also, the elitism strategy is introduced. By doing so, the diversity of solutions and the convergence power are increased. Simulation results demonstrate that the proposed algorithm can effectively handle nonconvex problems and has better convergence near the true Pareto optimal front compared to NSGAⅡ.

Related Dissertations

  1. An Improved Weighted Sum Algorithm for Multi-objectie Optimization Problems,O224
  2. Multiobjective Evolutionary Algorithms and Their Applications,TP301.6
  3. An improved immune genetic algorithm and PID controller to optimize the design of the application,TM571
  4. Identification and Speed Control of Ultrasonic Motors Based on Immune Algorithm and Dynamic Time Delay Neural Networks,TM359.9
  5. Based on the combined effect of the rough planning model,O221
  6. Wu's method in multi-objective planning application,O221.6
  7. Research on Strong Planning Solution and Weak Planning Solution,O221
  8. Sensitivity Analysis for the Second-Order Cone Programs,O221.2
  9. SDP Approximate Algorithm Based on D.C. Decompositions for a Class of Nonconvex Quadratically Constrained Quadratic Programming Problems,O221.2
  10. Research on Smoothing Methods for Mathematical Programs with Equilibrium Constraints,O221
  11. Studies on a Class of Penalty Method for Solving Linear Complementarity Problems,O221
  12. Optimality Conditions of the αk-major Efficient Solutions for Multiobjective Programming under B-invariant Convexity,O221.6
  13. A Primal-Dual Interior-Point Method of Using the Augmented Lagrangian Function for Nonlinear Semidefinite Programming,O221.2
  14. The Study of Gray Queuing System and E-Convex Bilevel Programming Problem,O221.2
  15. The Natures of Strong Quasiconcave Function and Its Apply in Utility Function,O221.6
  16. Trajectory Planning Algorithm for Uninhabited Aerial Vehicle,O221
  17. Coordinated Scheduling of Production and Delivery Basing on Heuristic Methods,O221
  18. A Quasi-Newton Trust Region Algorithm with the New Conic Model,O221.2
  19. An Application of the Dual Theory to Solve Quadratic Programming,O221.2
  20. Swarm intelligence optimization algorithm in the path planning,O221
  21. The Three Basic Models about Uncertain Programming on Quasi-probability Space,O221
  22. Whichever is greater average fuzzy relation geometric programming,O221.1

CLC: > Mathematical sciences and chemical > Mathematics > Operations Research > Planning Theory ( mathematical programming) > Multiple Objective Programming
© 2012 www.DissertationTopic.Net  Mobile