BICRITERIA TRANSPORTATION PROBLEM BY HYBRID GENETIC ALGORITHM

In this paper, we present a hybrid genetic algorithm to solve the bicr iteria transportation problem. we absorb the concept on spanning tree and adopt the Prufer number as it is capable of equally and uniquely r epresenting all possible basic solutions. We designed the criterion wh ich chromosomes can be always feasibly converted to a transportation t ree. In order to improve the efficiency of evolutionary algorithm, the reduced cost for optimality of a solution was hybridized to genetic a lgorithm. Numerical experiments show the effectiveness and efficiency of the proposed algorithm. Keywords: bicriteria optimization, transpor tation problem, reduced cost, spanning tree, hybrid genetic algorithm( HGA) (C) 1998 Elsevier Science Ltd. All rights reserved.