This paper explores some simple evolutionary strategies for an elitist, steady-state Pareto-based multi-objective evolutionary algorithm. The experimental framework is based on the SEAMO algorithm which differs from other approaches in its reliance on simple population replacement strategies, rather than sophisticated selection mechanisms. The paper demonstrates that excellent results can be ob...

The Product Replacement Algorithm is a practical algorithm for generating random elements of a finite group. The algorithm can be described as a random walk on a graph whose vertices are the generating k-tuples of the group (for a fixed k). We show that there is a function c(r) such that for any finite simple group of Lie type, with Lie rank r, the Product Replacement Graph of the generating k-...

The two main techniques of improving I/O performance of Object Oriented Database Management Systems(OODBMS) are clustering and buffer replacement. Clustering is the placement of objects accessed near to each other in time into the same page. Buffer replacement involves the selection of a page to be evicted, when the buffer is full. The page evicted ideally should be the page needed least in the...

Genetic Algorithms are biologically inspired optimization algorithms that has been used in a number of NP-hard optimization problems successfully like Travelling salesman, Knapsack problem etc. Performance of genetic algorithms largely depends on type of genetic operators Selection, Crossover, Mutation and Replacement used in it. Replacement operator decides which individuals stay in a populati...

We examine a policy for managing modem pools that disconnects users only if not enough modems are available for other users to connect. Managing the modem pool then becomes a replacement problem, similar to buffer cache management (e.g., in virtual memory systems). When a new connection request is received, the system needs to find a user to “replace”. In this paper we examine such demand-disco...

In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem. The set partitioning problem is an important combinatorial optimisation problem used by many airlines as a mathematical model for ight crew scheduling. We develop a steady-state genetic algorithm in conjunction with a specialised heuristic feasibility operator for solving the set partitioning ...

In this paper, based on Magnetotactic Bacteria Optimization Algorithm(MBOA), magnetotactic bacterium multi-objective optimization algorithm (MBMOA) is proposed for solving multi-objective optimization problems(MOPs). Magnetotactic bacterium optimization algorithm is a novel random research algorithm which simulates the process of magnetotactic bacteria (MTB) producing magnetosomes(MTS) to regul...

In this paper, based on Magnetotactic Bacteria Optimization Algorithm (MBOA), magnetotactic bacterium multi-objective optimization algorithm (MBMOA) is proposed for solving multi-objective optimization problems (MOPs). Magnetotactic bacterium optimization algorithm is a novel random research algorithm which simulate the process of magnetotactic bacteria (MTB) producing magnetosomes(MTS) to regu...

Ochronosis or black joints disorder is a rare autosomal recessive disorder caused by deficiency of homogentisic acidoxidase. Orthopaedic manifestations are common and mostly involve spine and large joints such as knee and hip.Arthropathy is progressive and will eventually leads to arthroplasty. Not being familiar with this disorder might lead todevastating complications. We present a 57 year-ol...