A genetic algorithm for the generalised transportation problem | Zendy

William Ho | Zendy; Ping Ji | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A genetic algorithm for the generalised transportation problem

Author(s) -

William Ho,

Ping Ji

Publication year - 2005

Publication title -

international journal of computer applications in technology

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.292

H-Index - 27

eISSN - 1741-5047

pISSN - 0952-8091

DOI - 10.1504/ijcat.2005.006959

Subject(s) - simplex algorithm , integer programming , linear programming , transportation theory , simplex , mathematical optimization , genetic algorithm , gtp' , extension (predicate logic) , algorithm , integer (computer science) , computer science , property (philosophy) , mathematics , combinatorics , programming language , biochemistry , chemistry , philosophy , epistemology , enzyme

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.; 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.Department of Industrial and Systems Engineerin

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research