Abstract
In this paper, we introduce the genetic algorithm approach to the generalized transportation problem (GTP) and GTP with a fixed charge (fc-GTP). We focus on the use of Prüfer number encoding based on a spanning tree, which is adopted because it is capable of equally and uniquely representing all possible trees. From this point, we also design the criteria by which chromosomes can always be converted to a GTP tree. The genetic crossover and mutation operators are designed to correspond to the genetic representations. With the spanning-tree-based genetic algorithm, less memory space will be used than in the matrix-based genetic algorithm for solving the problem; thereby computing time will also be saved. In order to improve the efficiency of the genetic algorithm, we use the reduced cost for the optimality of a solution and the genetic algorithm to avoid degeneration of the evolutionary process. A comparison of results of numerical experiments between the matrix-based genetic algorithm and the spanning-tree-based genetic algorithm for solving GTP and fc-GTP problems is given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balas E, Ivanescu PL (1964) On the generalized transportation problem. Manage Sci 11:188–202
Janice RL (1964) Topology and computation of the generalized transportation problem. Manage Sci 11:177–187
Moustapha D (1991) Successive linear approximation procedure for generalized fixed-charge transportation problems. J Opl Res Soc 42:991–1001
Dossey J, Otto L, Spence L, et al. (1993) Discrete mathemetics. Harper Collins
Gen M, Cheng R (1997) Genetic algorithm and engineering design. Wiley, New York.
Palmer CC, Kershenbaum A (1995) An approach to a problem in network design using genetic algorithms. Networks 26:151–163
Gen M, Cheng R (2000) Genetic algorithms and engineering optimization, Wiley, New York.
Michalewicz Z (1996) Genetic algorithms+data structure=evolution program, 3rd edn. Springer, London
Schwefel H (1994) Evolution and optimum seeking. Wiley New York
Gen M, Li Y (1998) Solving the multi-objective transportation problem by spanning tree-based genetic algorithm. In: Parmee I (ed) Adaptive computing in design and manufacture. Springer, London, pp 95–108
Li YZ, Gen M (1997) Improved genetic algorithm for solving multiobjective solid transportation problem with fuzzy numbers. J Jpn Soc Fuzzy Theory Syst 9:239–250
Li YZ, Gen M (1997) Spanning tree-based genetic algorithm for bicriteria transportation problem with coefficients. Aust J Intell Inf Process Syst 4:220–229
Zhou G, Gen M (1997) Approach to degree-constrained minimum spanning tree problem using genetic algorithm. Eng Des Autom 3:157–165
Zhou G, Gen M (1998) An effective genetic algorithm approach to the quandratic minimum spanning tree problem. Comput Oper Res 25:229–237
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Gen, M., Choi, J. & Ida, K. Improved genetic algorithm for generalized transportation problem. Artif Life Robotics 4, 96–102 (2000). https://doi.org/10.1007/BF02480863
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02480863