Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Pareto genetic algorithm

Sortuj według:

Ogranicz wyniki do:

Multi-species Pareto frontiers in preliminary submarine design

Thomas M. W.

Foundations of Computing and Decision Sciences

2000

Vol. 25, No. 4

273-289

A preliminary design code for submarines is used as the evaluator for a Pareto genetic algorithm. The algorithm seeks the code's Pareto (nondominated) frontier in terms of hull volume and propulsive efficiency, in order to investigate the feasibility of so-called "full stern" submarines. Three different selection schemes--two ranking methods and a tournament method--are installed in the algorithm and compared in terms of their ability to locate and define the frontier. A new concept in evolutionary computation--non-interbreeding competitive species--is introduced, allowing simultaneous optimization of four incompatible propulsor configurations. This produces a feasibility frontier with optimal propulsor configuration as a function of stern fullness.