Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 6 of 6
Full-Text Articles in Engineering
Feedback Control For Multi-Modal Optimization Using Genetic Algorithms, Jun Shi, Ole J. Mengshoel, Dipan K. Pal
Feedback Control For Multi-Modal Optimization Using Genetic Algorithms, Jun Shi, Ole J. Mengshoel, Dipan K. Pal
Ole J Mengshoel
Age-Layered Expectation Maximization For Parameter Learning In Bayesian Networks, Avneesh Saluja, Priya Sundararajan, Ole J. Mengshoel
Age-Layered Expectation Maximization For Parameter Learning In Bayesian Networks, Avneesh Saluja, Priya Sundararajan, Ole J. Mengshoel
Ole J Mengshoel
Generalized Crowding For Genetic Algorithms, Ole J. Mengshoel, Severino F. Galan
Generalized Crowding For Genetic Algorithms, Ole J. Mengshoel, Severino F. Galan
Ole J Mengshoel
Constraint Handling Using Tournament Selection: Abductive Inference In Partly Deterministic Bayesian Network, Severino F. Galan, Ole J. Mengshoel
Constraint Handling Using Tournament Selection: Abductive Inference In Partly Deterministic Bayesian Network, Severino F. Galan, Ole J. Mengshoel
Ole J Mengshoel
Constraints occur in many application areas of interest to evolutionary computation. The area considered here is Bayesian networks (BNs), which is a probability-based method for representing and reasoning with uncertain knowledge. This work deals with constraints in BNs and investigates how tournament selection can be adapted to better process such constraints in the context of abductive inference. Abductive inference in BNs consists of finding the most probable explanation given some evidence. Since exact abductive inference is NP-hard, several approximate approaches to this inference task have been developed. One of them applies evolutionary techniques in order to find optimal or close-to-optimal …
The Crowding Approach To Niching In Genetic Algorithms, Ole J. Mengshoel, David E. Goldberg
The Crowding Approach To Niching In Genetic Algorithms, Ole J. Mengshoel, David E. Goldberg
Ole J Mengshoel
A wide range of niching techniques have been investigated in evolutionary and genetic algorithms. In this article, we focus on niching using crowding techniques in the context of what we call local tournament algorithms. In addition to deterministic and probabilistic crowding, the family of local tournament algorithms includes the Metropolis algorithm, simulated annealing, restricted tournament selection, and parallel recombinative simulated annealing. We describe an algorithmic and analytical framework which is applicable to a wide range of crowding algorithms. As an example of utilizing this framework, we present and analyze the probabilistic crowding niching algorithm. Like the closely related deterministic crowding …
Probabilistic Crowding: Deterministic Crowding With Probabilistic Replacement, Ole J. Mengshoel, David E. Goldberg
Probabilistic Crowding: Deterministic Crowding With Probabilistic Replacement, Ole J. Mengshoel, David E. Goldberg
Ole J Mengshoel
This paper presents a novel niching algorithm, probabilistic crowding. Like its predecessor deterministic crowding, probabilistic crowding is fast, simple, and requires no parameters beyond that of the classical GA. In probabilistic crowding, subpopulations are maintained reliably, and we analyze and predict how this maintenance takes place.
This paper also identifies probabilistic crowding as a member of a family of algorithms, which we call integrated tournament algorithms. Integrated tournament algorithms also include deterministic crowding, restricted tournament selection, elitist recombination, parallel recombinative simulated annealing, the Metropolis algorithm, and simulated annealing.