Elitism and sharing are two mechanisms that are believed to improve the performance of an evolutionary multi-criterion optimiser. The relative performance of the two most popular ranking strategies is largely unknown. Using a new empirical inquiry framework, this report studies the effect of elitism, sharing, and ranking design choices using a benchmark suite of two-criterion problems. Performa...

Author Affiliation: Department of Electrical and Electronic Engineering, Nigde University, Nigde, Turkey. Abstract: This letter outlines a hybrid genetic algorithm (HGA) for solving the economic dispatch problem. The algorithm incorporates the solution produced by an improved Hopfield neural network (NN) [1] as a part of its initial population. Elitism, arithmetic crossover, and mutation are us...

This work introduces a new evolutionary approach to solving the problems of multiobjective optimization. Novelty of the proposed method consists in the application of an evolutionary multi-agent system equipped with the mechanism(s) of elitism, instead of its ’classical’ (non-elitist) version. In the paper the model of an elitist evolutionary multi-agent system is described together with its sa...

Abstract The Fields Medal, often referred as the Nobel Prize of mathematics, is awarded to no more than four mathematicians under age 40, every 4 years. In recent years, its conferral has come scrutiny math historians, for rewarding existing elite rather original goal elevating under-represented mathematicians. Prior studies elitism focus on citational practices while a characterization structu...

Élitisme et Dominance Stochastique Résumé La dominance stochastique est traditionnellement associée à la mesure du risque et de l'inégalité et repose sur la concavité de la fonction d'utilité. Nous prétendons que l'approche en terme de dominance stochastique a des implications qui vont au-delà de la mesure du risque et de l'inégalité pour peu que l'on procède à certains ajustements. Nous appliq...

In recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants and memory schemes are two major ones. The random immigrants scheme addresses dynamic environments by maintaining the population diversity while the memory scheme aims to adapt genetic algorithms quickly to new enviro...

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...