• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Multiobjective differential evolution with external archive and harmonic distance-based diversity measure (2005)

by V L Huang, P N Suganthan, A K Qin, S Baskar
Add To MetaCart

Tools

Sorted by:
Results 1 - 7 of 7

Choosing Leaders for Multi-objective PSO Algorithms Using Differential Evolution

by X. Li
"... Abstract. The fast convergence of particle swarm algorithms can become a downside in multi-objective optimization problems when there are many local optimal fronts. In such a situation a multi-objective particle swarm algorithm may get stuck to a local Pareto optimal front. In this paper we propose ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
Abstract. The fast convergence of particle swarm algorithms can become a downside in multi-objective optimization problems when there are many local optimal fronts. In such a situation a multi-objective particle swarm algorithm may get stuck to a local Pareto optimal front. In this paper we propose a new approach in selecting leaders for the particles to follow, which in-turn will guide the algorithm towards the Pareto optimal front. The proposed algorithm uses a Differential Evolution operator to create the leaders. These leaders can successfully guide the other particles towards the Pareto optimal front for various types of test problems. This simple yet robust algorithm is effective compared with existing multi-objective particle swarm algorithms.
(Show Context)

Citation Context

..., which locates the leaders near the vicinity of other particles. A lower CR value is also present as desirable in other examples of multi-objective optimization algorithms using DE in the literature =-=[7,8,9,10]-=-. 3 Related Work There are several examples of multi-objective PSO algorithms where leaders are chosen by the notion of dominance in the literature. In DNPSO [11], particles choose a leader from their...

A Multi-objective Approach to Testing Resource Allocation in Modular Software Systems

by Zai Wang, Ke Tang, Xin Yao
"... Abstract — Nowadays, as the software systems become increasingly large and complex, the problem of allocating the limited testing-resource during the testing phase has become more and more difficult. In this paper, we propose to solve the testing-resource allocation problem (TRAP) using multi-object ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
Abstract — Nowadays, as the software systems become increasingly large and complex, the problem of allocating the limited testing-resource during the testing phase has become more and more difficult. In this paper, we propose to solve the testing-resource allocation problem (TRAP) using multi-objective evolutionary algorithms. Specifically, we formulate TRAP as two multi-objective problems. First, we consider the reliability of the system and the testing cost as two objectives. In the second formulation, the total testing-resource consumed is also taken into account as the third goal. Two multi-objective evolutionary algorithms, Non-dominated Sorting Genetic Algorithm II (NSGA2) and Multi-Objective Differential Evolution Algorithms (MODE), are applied to solve the TRAP in the two scenarios. This is the first time that the TRAP is explicitly formulated and solved by multi-objective evolutionary approaches. Advantages of our approaches over the state-of-the-art single-objective approaches are demonstrated on two parallel-series modular software models.
(Show Context)

Citation Context

..., we suggest using NSGA2 and MODE as the specific problem solver. Proposed by Deb et al. [18], NSGA2 is one of the most famous MOEAs and has been extensively used in various real-world problems. MODE =-=[20]-=- is a recently proposed approach and show some advantages over NSGA2 in some aspects. Due to space constraints, the details of NSGA2 and MODE may not be described in this paper, interested readers are...

A Multi-objective Evolutionary Approach to Aircraft Landing Scheduling Problems

by Ke Tang, Zai Wang, Xianbin Cao, Jun Zhang
"... Abstract—Scheduling aircraft landings has been a complex and challenging problem in air traffic control for long time. In this paper, we propose to solve the aircraft landing scheduling problem (ALSP) using multi-objective evolutionary algorithms (MOEAs). Specifically, we consider simultaneously min ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract—Scheduling aircraft landings has been a complex and challenging problem in air traffic control for long time. In this paper, we propose to solve the aircraft landing scheduling problem (ALSP) using multi-objective evolutionary algorithms (MOEAs). Specifically, we consider simultaneously minimizing the total scheduled time of arrival and the total cost, and formulate the ALSP as a 2-objective optimization problem. A MOEA named Multi-Objective Neighborhood Search Differential Evolution (MONSDE) is applied to solve the 2-objective ALSP. Besides, a ranking scheme named non-dominated average ranking is also proposed to determine the optimal landing sequence. Advantages of our approaches are demonstrated on two example scenarios. I.
(Show Context)

Citation Context

...utionary Algorithm IIs(SPEA2) [8], Pareto Archived Evolution Strategy (PAES) [9], Non-dominated Sorting Genetic Algorithm II (NSGA2) [10] and Multi-Objective Differential Evolution Algorithms (MODEs) =-=[11]-=-, are a family of evolutionary approaches to multi-objective optimization problems. They have been proven to perform well on lots of real-world problems. Taking the advantage of MOEA, we manage to off...

SEE PROFILE

by Rammohan Mallipeddi, Ponnuthurai N. Suganthan, Available Ponnuthurai, N. Suganthan , 2009
"... Abstract - In this paper, we propose a Multiobjective Self-adaptive Differential Evolution algorithm with objective-wise learning strategies (OW-MOSaDE) to solve numerical optimization problems with multiple conflicting objectives. The proposed approach learns suitable crossover parameter values and ..."
Abstract - Add to MetaCart
Abstract - In this paper, we propose a Multiobjective Self-adaptive Differential Evolution algorithm with objective-wise learning strategies (OW-MOSaDE) to solve numerical optimization problems with multiple conflicting objectives. The proposed approach learns suitable crossover parameter values and mutation strategies for each objective separately in a multi-objective optimization problem. The performance of the proposed OW-MOSaDE algorithm is evaluated on a suit of 13 benchmark problems provided for the CEC2009 MOEA Special Session and Competition
(Show Context)

Citation Context

...y exclusivesintegers randomly generated within the range [1, NP], thesesindices are randomly generated once for each mutant vector.sThese mutation strategies have been commonly used whenssolving MOPs =-=[4]-=-[6][7][10][11].sThe main steps of OW-MOSaDE are described below:sStep 1. Randomly initialize a population of NP individuals.sInitialize n_obj number of vectors each corresponding to onesobjective. Eac...

355 PUBLICATIONS 13,818 CITATIONS SEE PROFILE

by Kai Qin, Ponnuthurai N. Suganthan, Mehmet Fatih Tasgetiren , 2007
"... Multi-objective optimization based on self-adaptive differential evolution algorithm ..."
Abstract - Add to MetaCart
Multi-objective optimization based on self-adaptive differential evolution algorithm
(Show Context)

Citation Context

...y exclusivesintegers randomly generated within the range [1, NP], thesesindices are randomly generated once for each mutant vector.sThese mutation strategies have been commonly used whenssolving MOPs =-=[4]-=-[6][7][10][11].sThe main steps of OW-MOSaDE are described below:sStep 1. Randomly initialize a population of NP individuals.sInitialize n_obj number of vectors each corresponding to onesobjective. Eac...

Self-adaptive Differential Evolution algorithm with

by unknown authors
"... Abstract - In this paper, we propose a Multiobjective ..."
Abstract - Add to MetaCart
Abstract - In this paper, we propose a Multiobjective
(Show Context)

Citation Context

...y exclusivesintegers randomly generated within the range [1, NP], thesesindices are randomly generated once for each mutant vector.sThese mutation strategies have been commonly used whenssolving MOPs =-=[4]-=-[6][7][10][11].sThe main steps of OW-MOSaDE are described below:sStep 1. Randomly initialize a population of NP individuals.sInitialize n_obj number of vectors each corresponding to onesobjective. Eac...

Optimal Testing Resource Allocation Problems in Software System using Heuristic Algorithm

by M. Pavithra
"... Abstract---Software Testing is the process of implementing a program with the definite intent of finding errors former to delivery to the end user. Due to the increase and the complexity of the software system the problem is how to optimally assign the narrow testing resource during the testing phas ..."
Abstract - Add to MetaCart
Abstract---Software Testing is the process of implementing a program with the definite intent of finding errors former to delivery to the end user. Due to the increase and the complexity of the software system the problem is how to optimally assign the narrow testing resource during the testing phase has become more important and difficult. Traditional Optimal Testing Resource Allocation Problems (OTRAPs) includesin afinest allocation of a limited amount of testing resources with respect to reliability, cost etc. To solve the OTRAPs with Multi-Objective Algorithms called as Hierarchy Particle Swarm Optimization Algorithm (HPSO) is suggested. Especially, organize OTRAPs for two types of multi-objective problems. First one is reliability of the system and the testing cost of the system as two objectives. Second, the total testing resource consumed is also taken into account as the third objective, sensitivity is the fourth objective. The existing algorithms require more time and the both the evolutionary and the NSGA algorithm having more drawbacks. To overcome the drawbacks of the existing algorithm, the proposed HPSO algorithm which is used in this paper, satisfy allthe four objective of this research. Experimental results show that the proposed algorithm is more efficient than the existing algorithms. Keywords---Particle Swarm Optimization algorithm,
(Show Context)

Citation Context

...ry Algorithm II (SPEA2) [32], Pareto Archived Evolution Strategy (PAES) [33], Nondominated Sorting Genetic Algorithm II (NSGA2) [34] and Multi-Objective Differential Evolution Algorithms (MODEs) [35] =-=[36]-=-, are the evolutionary approaches to multiobjective optimization problems.They have been demonstrated to perform well on lots of real-world problems.The MOEAs have been never applied to the TRAP befor...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University