G. Vivo-truyols et al., A hybrid genetic algorithm with local search: I. Discrete variables: optimisation of complementary mobile phases, CHEM INTELL, 59(1-2), 2001, pp. 89-106
A hybrid genetic algorithm was developed for a combinatorial optimisation p
roblem. The assayed hybridation modifies the reproduction pattern of the ge
netic algorithm through the application of a local search method, which enh
ances each individual in each generation. The method is applied to the opti
misation of the mobile phase composition in liquid chromatography, using tw
o or more mobile phases of complementary behaviour. Each of these phases co
ncerns the optimal separation of certain compounds in the analysed mixture,
while the others can remain overlapped. This optimisation approach may be
useful in situations where full resolution with a single mobile phase is un
feasible. The optimisation is based on a local search method which alternat
es two combinatorial search spaces: one of them defined by combinations of
solutes and the other by combinations of mobile phases. This gives rise to
a protocol, able to interchange and improve data among both search spaces.
An experimental design of algorithm settings was performed to find the opti
mal computation conditions. Lamarckian and Darwinian strategies, binary and
real-value encoding and two ways of establishing the problem (a search spa
ce of solutes or mobile phases) were checked. Two problems involving the se
paration of 10 and 15 solutes with two and three mobile phase experimental
factors were optimised up to reach base-line separation. The method was com
pared with a systematic examination of all candidate solutions and a classi
cal genetic algorithm. The hybrid method, called LOGA (locally optimised ge
netic algorithm), exceeded the performance of both reference methods. (C) 2
001 Elsevier Science B.V. All rights reserved.