A genetic algorithm for the generalised transportation problem
W Ho, P Ji
International Journal of Computer Applications in Technology | Inderscience | Published : 2005
The generalised transportation problem (GTP) is an extension of the linear Hitchcock transportation problem. However, it does not have the unimodularity property, which means the linear programming solution (like the simplex method) cannot guarantee to be integer. This is a major difference between the GTP and the Hitchcock transportation problem. Although some special algorithms, such as the generalised stepping-stone method, have been developed, but they are based on the linear programming model and the integer solution requirement of the GTP is relaxed. This paper proposes a genetic algorithm (GA) to solve the GTP and a numerical example is presented to show the algorithm and its efficien..View full abstract
Awarded by Hong Kong Polytechnic University
The authors wish to acknowledge the Hong Kong Polytechnic University for the financial support of the project ( No. G-W031).