TAILIEUCHUNG - Multi-objective evolutionary algorithms: Foundation, development and open issues

This paper focuses on a special class problem called multi-objective optimization problems and evolutionary algorithms designed for it. We will overview the development of multi-objective evolutionary algorithms (MOEAs) over the years and problem difficulties and then indicate the open problems in this area. | Journal of Computer Science and Cybernetics, , (2017), 193–212 DOI REVIEW MULTI-OBJECTIVE EVOLUTIONARY ALGORITHMS: FOUNDATION, DEVELOPMENT AND OPEN ISSUES LAM THU BUI Le Quy Don Technical University; lambt@ Abstract. Evolutionary computation (EC) has been a fascinating branch of computation inspired by a natural phenomenal of evolution. EC enables computer scientists to design effective algorithms dealing with difficult problems. This paper focuses on a special class problem called multi-objective optimization problems and evolutionary algorithms designed for it. We will overview the development of multi-objective evolutionary algorithms (MOEAs) over the years and problem difficulties and then indicate the open problems in this area. Our chief goal is to provide readers with reference material in the area of multi-objective evolutionary algorithms. Keywords. Evolutionary computation, multi-objective evolutionary algorithms, optimization. 1. INTRODUCTION Evolutionary algorithms (EAs) [3, 28, 40] have emerged as major heuristic search paradigms. With the usage of a population for the search in each iteration, EAs are naturally suitable for solving multi-objective problems, which often have multiple conflicting objectives. They have attracted significant attention from the research community over the last 30 years. We can observe this fact by the number of publications produced over time [13, 16, 17]. Obviously, in these problems, there is no single solution that is the best when measured on all objectives (note that the terms solution, individual and point are used interchangeably in this paper). Instead we usually find several trade-off solutions (called the Pareto optimal set (POS) to honor Vilfredo Pareto [44], or Pareto optimal front (POF) for the image of the vectors corresponding to these solutions). In that sense, the search for an optimal solution has fundamentally changed from what we see in the case

• Sinh học
• Journal of Computer Science and Cybernetics
• Multi objective evolutionary algorithms
• Evolutionary algorithms and foundation
• development and open issues
• EC enables computer scientists
• Evolutionary algorithms designed
• Nonstandard finite difference schemes
• Solving a modified epidemiological model for computer viruses
• Nonstandard finite difference
• Computer virus propagation model
• Learning interaction measure
• Relevance feedback in image retrieval
• Multi feature query
• The fuzzy density values
• Quality of transmission aware routing in ad hoc networks
• Cross layer model combined
• The static agent
• Ad hoc networks
• QoT aware routing
• sattic agent
• Algorithm to build fuzzy decision tree for data classification problem
• Fuzziness intervals matching
• Fuzzy decision tree
• The fuzzy data mining problem
• Hedges algebras and fuzzy partition problem for qualitative attributes
• Construct the membership functions
• Fuzzy Association Rules
• Member ship functions
• Characterizations for several classes of alternative codes
• Several classes of alternative codes
• norm alternative code
• Left norm alternative code
• Two sided alternative code
• Left alternative code
• Strict alternative code
• Packet classification algorithm
• Multi way priority trie
• Significant number of researchers
• Both theoretically and experimentally proved
• Solving min max capacitated vehicle routing problem by local search
• Solving min max capacitated vehicle routing problem
• Solving min max capacitated
• Proposed algorithms compared
• Novel control approach for optimal power flow
• Hybrid wind photovoltaic diesel generation systems
• Diesel generation systems
• Analytical control model
• Mobile ad hoc network
• Valid route testing mechanism
• Using Network Simulator
• Random movement network topology
• Rough set theory
• Polynomial time complexity
• Algorithm finding object reducts
• Improved genetic algorithm
• Test data generation for simulink models
• Conventional genetic algorithm
• Generate test data for Simulink models
• Nonholonomic wheeled mobile robot
• Wheeled mobile robot
• Function neural network
• Unknown external disturbances
• Modeling the differential motion of a mobile manipulator
• Designing a new visual servoing
• Tracking a flying target
• Reinforcement learning algorithm
• Efficient navigation framework
• Autonomous mobile robots
• The mobile robots
• Interpolation based on semantic distance weighting
• Hedge algebra and its application
• Semantic distance weighting
• Bi linear interpolation
• Linguistic rule base system
• Transform the current Web
• Conceptual data model
• Ti meER model
• The temporal databases into OWL ontology
• The ER model into ontology
• Sliding mode control
• Sliding mode control for a planar parallel robot driven
• Electric motors in a task space
• The substructure method
• Greedy Randomized Adaptive Search Procedure
• Multiple Traveling Repairmen Problem with Distance Constraints
• Variable Neighborhood Descent
• Traveling Repairman Problem
• On the real world semantics interpretability
• Fuzzy rule based systems under fuzzy set approach
• Hedge algebra approach
• The RWS interpretability
• Alternating current electrical systems
• Integer quadratic programming
• Non linear knapsack problems arising
• Polynomial time approximation schemes
• Statistical implication rules
• Collaborative filtering recommender system
• Statistical implicative analysis
• The accuracy of recommender systems
• Picture fuzzy sets
• Picture fuzzy t norms
• Picture fuzzy t conorm
• De Morgan picture operator triple
• Taxonomic assignment for large scale metagenomic data
• High perfomance systems
• Large scale metagenomic data
• Achieve good performance