Peter J. Fleming

Peter J. Fleming

Auto-generated profile, based on publicly available information

Peter J. Fleming

The University of Sheffield

Research Focus & Metrics

Academic Career Length

44Years (1983-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 1998 in IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
Verified
Journal Article
Closed access
CFC.M. Fonseca
C.M. Fonseca
PFP.J. Fleming
P.J. Fleming
In optimization, multiple objectives and constraints cannot be handled independently of the underlying optimizer. Requirements such as continuity and differentiability of the cost surface add yet another conflicting element to the decision process. While "better" solutions should be rated higher than "worse" ones, the resulting cost landscape must also comply with such requirements. Evolutionary algorithms (EAs), which have found application in many areas not amenable to optimization by other methods, possess many characteristics desirable in a multiobjective optimizer, most notably the concerted handling of multiple candidate solutions. However, EAs are essentially unconstrained search techniques which require the assignment of a scalar measure of quality, or fitness, to such candidate solutions. After reviewing current revolutionary approaches to multiobjective and constrained optimization, the paper proposes that fitness assignment be interpreted as, or at least related to, a multicriterion decision process. A suitable decision making framework based on goals and priorities is subsequently formulated in terms of a relational operator, characterized, and shown to encompass a number of simpler decision strategies. Finally, the ranking of an arbitrary number of candidates is considered. The effect of preference changes on the cost surface seen by an EA is illustrated graphically for a simple problem. The paper concludes with the formulation of a multiobjective genetic algorithm based on the proposed decision strategy. Niche formation techniques are used to promote diversity among preferable candidates, and progressive articulation of preferences is shown to be possible as long as the genetic algorithm can recover from abrupt changes in the cost landscape.

1 November 2002 in Control Engineering Practice
Verified
Journal Article
Closed access
PFP.J Fleming
P.J Fleming
RPR.C Purshouse
R.C Purshouse

27 November 2007 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
RPRobin C. Purshouse
Robin C. Purshouse
PFPeter J. Fleming
Peter J. Fleming
This study explores the utility of multiobjective evolutionary algorithms (using standard Pareto ranking and diversity-promoting selection mechanisms) for solving optimization tasks with many conflicting objectives. Optimizer behavior is assessed for a grid of mutation and recombination operator configurations. Performance maps are obtained for the dual aims of proximity to, and distribution across, the optimal tradeoff surface. Performance sweet-spots for both variation operators are observed to contract as the number of objectives is increased. Classical settings for recombination are shown to be suitable for small numbers of objectives but correspond to very poor performance for higher numbers of objectives, even when large population sizes are used. Explanations for this behavior are offered via the concepts of dominance resistance and active diversity promotion.

11 June 2012 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
RWRui Wang
Rui Wang
RPRobin C. Purshouse
Robin C. Purshouse
PFPeter J. Fleming
Peter J. Fleming
The simultaneous optimization of many objectives (in excess of 3), in order to obtain a full and satisfactory set of tradeoff solutions to support a posteriori decision making, remains a challenging problem. The concept of coevolving a family of decision-maker preferences together with a population of candidate solutions is studied here and demonstrated to have promising performance characteristics for such problems. After introducing the concept of the preference-inspired coevolutionary algorithm (PICEA), a realization of this concept, PICEA-g, is systematically compared with four of the best-in-class evolutionary algorithms (EAs); random search is also studied as a baseline approach. The four EAs used in the comparison are a Pareto-dominance relation-based algorithm (NSGA-II), an ε-dominance relation-based algorithm [ ε-multiobjective evolutionary algorithm (MOEA)], a scalarizing function-based algorithm (MOEA/D), and an indicator-based algorithm [hypervolume-based algorithm (HypE)]. It is demonstrated that, for bi-objective problems, all of the multi-objective evolutionary algorithms perform competitively. As the number of objectives increases, PICEA-g and HypE, which have comparable performance, tend to outperform NSGA-II, ε-MOEA, and MOEA/D. All the algorithms outperformed random search.

30 May 2006 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
VKV. Kadirkamanathan
V. Kadirkamanathan
KSK. Selvarajah
K. Selvarajah
PFP.J. Fleming
P.J. Fleming
Previous stability analysis of the particle swarm optimizer was restricted to the assumption that all parameters are nonrandom, in effect a deterministic particle swarm optimizer. We analyze the stability of the particle dynamics without this restrictive assumption using Lyapunov stability analysis and the concept of passive systems. Sufficient conditions for stability are derived, and an illustrative example is given. Simulation results confirm the prediction from theory that stability of the particle dynamics requires increasing the maximum value of the random parameter when the inertia factor is reduced.

1 January 1998 in IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
Verified
Journal Article
Closed access
CFC.M. Fonseca
C.M. Fonseca
PFP.J. Fleming
P.J. Fleming
For part I see ibid., 26-37. The evolutionary approach to multiple function optimization formulated in the first part of the paper is applied to the optimization of the low-pressure spool speed governor of a Pegasus gas turbine engine. This study illustrates how a technique such as the multiobjective genetic algorithm can be applied, and exemplifies how design requirements can be refined as the algorithm runs. Several objective functions and associated goals express design concerns in direct form, i.e., as the designer would state them. While such a designer-oriented formulation is very attractive, its practical usefulness depends heavily on the ability to search and optimize cost surfaces in a class much broader than usual, as already provided to a large extent by the genetic algorithm (GA). The two instances of the problem studied demonstrate the need for preference articulation in cases where many and highly competing objectives lead to a nondominated set too large for a finite population to sample effectively. It is shown that only a very small portion of the nondominated set is of practical relevance, which further substantiates the need to supply preference information to the GA. The paper concludes with a discussion of the results