The FUELGEN alternative: an evolutionary approach. The architecture

This paper introduces a few architectural concepts from FUELGEN, that generates a "cloud" of reload patterns, like the generator in the FUELCON expert system, but unlike that generator, is based on a genetic algorithm. There are indications FUELGEN may outperform FUELCON and other tools as reported in the literature, in well-researched case studies, but careful comparisons have to be carried out. This paper complements the information in two other recent papers on FUELGEN. Moreover, a sequel project is outlined.

FUELGEN: effective evolutionary design of refuellings for pressurized water reactors

The paper describes the design of an efficient and robust genetic algorithm for the nuclear fuel loading problem (i.e., refuellings: the in-core fuel management problem) - a complex combinatorial, multimodal optimisation., Evolutionary computation as performed by FUELGEN replaces heuristic search of the kind performed by the FUELCON expert system (CAI 12/4), to solve the same problem. In contrast to the traditional genetic algorithm which makes strong requirements on the representation used and its parameter setting in order to be efficient, the results of recent research results on new, robust genetic algorithms show that representations unsuitable for the traditional genetic algorithm can still be used to good effect with little parameter adjustment. The representation presented here is a simple symbolic one with no linkage attributes, making the genetic algorithm particularly easy to apply to fuel loading problems with differing core structures and assembly inventories. A nonlinear fitness function has been constructed to direct the search efficiently in the presence of the many local optima that result from the constraint on solutions.

A combined evolutionary search and multilevel optimisation approach to graph-partitioning

The graph-partitioning problem is to divide a graph into several pieces so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges is minimised. Important applications of the problem arise, for example, in parallel processing where data sets need to be distributed across the memory of a parallel machine. Very effective heuristic algorithms have been developed for this problem which run in real-time, but it is not known how good the partitions are since the problem is, in general, NP-complete. This paper reports an evolutionary search algorithm for finding benchmark partitions. A distinctive feature is the use of a multilevel heuristic algorithm to provide an effective crossover. The technique is tested on several example graphs and it is demonstrated that our method can achieve extremely high quality partitions significantly better than those found by the state-of-the-art graph-partitioning packages.

Chaetopterid tubes from vent and seep sites: Implications for fossil record and evolutionary history of vent and seep annelids

Vestimentiferan tube worms living at deep-sea hydrothermal vents and cold seeps have been considered as a clade with a long and continuing evolutionary history in these ecosystems. Whereas the fossil record appears to support this view, molecular age estimates do not. The two main features that are used to identify vestimentiferan tubes in the fossil record are longitudinal ridges on the tube's surface and a tube wall constructed of multiple layers. It is shown here that chaetopterid tubes from modern vents and seeps—as well as a number of fossil tubes from shallow-water environments—also show these two features. This calls for a more cautious interpretation of tubular fossils from ancient vent and seep deposits. We suggest that: current estimates for a relatively young evolutionary age based on molecular clock methods may be more reliable than the inferences of ancient “vestimentiferans” based on putative fossils of these worms; not all of these putative fossils actually belong to this group; and that tubes from fossil seeps should be investigated for chitinous remains to substantiate claims of their potential siboglinid affinities.