Bicriteria transportation problem by hybrid genetic algorithm

In this paper, we present a hybrid genetic algorithm to solve the bicriteria transportation problem. we absorb the concept on spanning tree and adopt the Prüfer number as it is capable of equally and uniquely representing all possible basic solutions. We designed the criterion which chromosomes can be always feasibly converted to a transportation tree. In order to improve the efficiency of evolutionary algorithm, the reduced cost for optimality of a solution was hybridized to genetic algorithm. Numerical experiments show the effectiveness and efficiency of the proposed algorithm.