A genetic algorithm for the generalised transportation problem

Abstract

The Generalized 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) can not guarantee to be integer. This is a major difference between the GTP and the Hitchcock transportation problem. Although some special algorithms, such as the generalized 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.

Multi-Objective Optimization using Genetic Algorithms in MOTSP (Co2 Emissions)

“…The genetic algorithms were used to solve several MOP transformed into mono-objective problems: sequencing [7] , generation of chemical structures [8] , conception of filters IIR [9] & [10] , transport [11,12].…”