Solving bicriteria solid transportation problem by genetic algorithm

This paper describes an implementation of genetic algorithm to solve bicriteria solid transportation problem (BSTP), which is the extension of our previous work. The criteria space approach for bicriteria linear program is embedded in the structure of genetic algorithms (GA) for finding the nondominated points in the criteria space. The proposed algorithm is coded with C language. The computation results show that the proposed algorithms is efficient for solving the bicriteria solid transportation problem.<
>