A genetic algorithm for the generalised transportation problem

William Ho, Ping Ji

Research output: Contribution to journalArticle

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, 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 efficiency.
Original languageEnglish
Pages (from-to)190-197
Number of pages8
JournalInternational Journal of Computer Applications in Technology
Volume22
Issue number4
DOIs
Publication statusPublished - 2005

Keywords

  • generalised transportation problem
  • genetic algorithm
  • integer programming.

Fingerprint Dive into the research topics of 'A genetic algorithm for the generalised transportation problem'. Together they form a unique fingerprint.

Cite this