A genetic algorithm for the generalised transportation problem
Source: International Journal of Computer Applications in Technology, Volume 22, Number 4, 27 April 2005 , pp. 190-197(8)
Publisher: Inderscience Publishers
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.
Document Type: Research Article
Affiliations: 1: Department of Manufacturing Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong. 2: Department of Manufacturing Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Publication date: 2005-04-27
- The International Journal of Computer Applications in Technology addresses issues of computer applications, information and communication systems, software engineering and management, CAD/CAM/CAE, numerical analysis and simulations, finite element methods and analyses, robotics, computer applications in multimedia and new technologies, computer aided learning and training.