Solving bicriteria solid transportation problem by genetic algorithm

Author

Gen, Mitsuo ; Ida, Kenichi ; Li, Yinzhen

Author_Institution

Dept. of Ind. & Syst. Eng., Ashikaga Inst. of Technol., Japan

Volume

2

fYear

1994

fDate

2-5 Oct 1994

Firstpage

1200

Abstract

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

Keywords

genetic algorithms; goods dispatch data processing; goods distribution; linear programming; operations research; transportation; bicriteria linear program; bicriteria solid transportation problem; criteria space; genetic algorithm; goods distribution; operations research; Biological cells; Constraint optimization; Costs; Genetic algorithms; Genetic engineering; Linear programming; Solids; Space technology; Systems engineering and theory; Transportation;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man, and Cybernetics, 1994. Humans, Information and Technology., 1994 IEEE International Conference on

Conference_Location

San Antonio, TX

Print_ISBN

0-7803-2129-4

Type

conf

DOI

10.1109/ICSMC.1994.400008

Filename

400008