Abstract
This paper deals with an optimal oil supply problem in which different kinds of oil must be supplied without mixing from the multiple input stations to the multiple output stations of a given pipeline network. The objective function is to minimize the overall transportation time. The genetic algorithm (GA) is applied to solving this problem. The individual description, the decoding rule and the operations of reproduction, crossover and mutation are proposed for this problem. Particularly, our attention is paid to the generation of lethal gene which corresponds to an infeasible solution of the problem. Numerical results show the effect of lethal gene in the algorithm.
