A genetic algorithm for the generalised transportation problem. (28th April 2005)

• Record Type: Journal Article
• Authors: Ho, W.; Ji, P.
• Is Part Of: International journal of computer applications technology. Volume 22:Number 4(2005)
• Page Start: 190
• Page End: 197
• Publication Date: 2005-04-28
• Subjects: generalised transportation problem -- genetic algorithms -- integer programming; Technology -- Data processing -- Periodicals; 620.00285
• Languages: English
• ISSNs: 0952-8091

Abstract

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, 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 efficiency.