A genetic algorithm for the linear transportation problem 论文

摘要

Genetic algorithms are adaptive procedures that find solutions to problems by an evolutionary process based on natural selection. The use of alternative genetic algorithms for solving the linear transportation problem is discussed. Using it as an example the relationship between representation structures and genetic operators is investigated for constrained problems, and the value of structures richer than bitstrings is demonstrated.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>