A new Crossover Operator for Treating Transportation Problems

- Fayed F .Ghaleb-Osama A .Ghoneim ; Khamis, Soheir 


This paper introduces a genetic algorithm for solving transportation problems. A simple form of the problem is a discussion of a single commodity transported from a set of sources to a set of destinations. The transportation cost from a particular source to a particular destination is not fixed, since it depends on the transported units from a source to a destination. To solve this problem using genetic algorithm, authors give a new crossover operator matching matrix representation which models the problem. The given crossover has an important advantage; producing valid offspring which don't need any repairs. According to this advantage, the execution time of the designed genetic algorithm is very fast. Combining the given crossover with a specified relevant mutation of matrix representation (MMR), [5], [8], leads to finding best solutions to the underlying problem. Furthermore, the results of the given genetic algorithm affect with the changing values of the probability of mutation pmute. So, the study includes the relation between the optimal solutions and number of generations with respect to various values of pmute for some examples.

Other data

Keywords : linear transportation problem; genetic algorithm; crossover; mutation; probability of mutation.
Issue Date 22-Mar-2010
Conference Seventh International Scientific Conference Environment, Development, and Nanotechnology Faculty of Science, Al-Azhar University 22 – 24 March 2010 Cairo, Egypt 
URI http://research.asu.edu.eg/123456789/1128

Recommend this item

CORE Recommender

Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.