Abstract
In this paper we describe main features of a Strongly Feasible Evolution Program (SFEP) designed to solve non-linear network flow problems. The program can handle non-linearities both in the constraints and in the objective function. The solutions procedure is based on a recombination operator in which all parents in a small mating pool have equal chance of contributing their genetic material to offspring. When offspring is created with better fitness value than that of the worst parent, the worst parent is discarded from the mating pool while the offspring is placed in it. The main contributions are in the massive parallel initialization procedure which creates only feasible solutions with simple heuristic rules that increase chances of creating solutions with good fitness values for the initial mating pool, and the gene therapy procedure which fixes “defective genes” ensuring that the offspring resulting from recombination is always feasible. Both procedures utilize the properties of network flows. The algorithm is capable of handling mixed integer problems with non-linearities in both constraints and the objective function. Tests were conducted on a number of previously published transportation problems with 49 and 100 decision variables, which constitute a subset of network flow problems. Convergence to equal or better solutions was achieved with often less than one tenth of the previous computational efforts.
Similar content being viewed by others
References
Ahuja, R.K., T.L. Magnanti, and J.B. Orlin. (1993). Network Flows. Prentice Hall: Englewood Cliffs, NJ.
Darwin, C. (1859). On the Origin of Species by Natural Selection. John Murray.
Davis, L. (ed.) (1987). Genetic Algorithms and Simulated Annealing. San Mateo, CA: Morgan Kaufmann Publishers.
Fogel, L.J., A.J. Owens, and M.J. Walsh. (1966). Artificial Intelligence Through Simulated Evolution. Chichester, UK: John Wiley.
Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley.
Glover, F. (1999). Scatter Search and Path Relinking. New Methods of Optimization. New York: McGraw Hill. To appear.
Grafenstette, J.J. (1987). Genetic Algorithms and Simulated Annealing. San Mateo, CA: Morgan Kaufmann Publishers. pp. 42–60.
Gunter, R. (1994). “Massively Parallel Simulated Annealing and Its Relation to Evolutionary Algorithms.” Evolutionary Computation 1(4), 361–383.
Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press.
Hunter, A. (1998). “Crossing Over Genetic Algorithms: The Sugal Generalised GA.” Journal of Heuristics 4, 179–192.
Koza, J.R. (1992). Genetic Programming. Cambridge, MA: MIT Press.
Michalewicz, Z. (1994). Genetic Algorithms C Data Structures D Evolutionary Programs. Berlin, Germany: Springer-Verlag, KG.
Michalewicz, Z., G.A. Vignaux, and M. Hobbs. (1991). “A Non-Standard Genetic Algorithm for the Non-Linear Transportation Problem.” ORSA Journal of Computing 3(4), 307–316.
Rechenberg, I. (1965). “Cybernetic Solution Path of an Experimental Problem.” Royal Aircraft Establishment, translation No. 1122, Ministry of Aviation, Farnborough Hants, UK.
Schwefel, H. (1981). Numerical Optimization of Computer Models. Chichester: John Wiley.
Vignaux, G.A. and Z. Michalewicz. (1989). “Genetic Algorithms for the Transportation Problem.” In Proceedings of the Fourth International Symposium on Methodologies for Intelligent Systems. Amsterdam: North Holland. pp. 252–259.
Whitley, D. (1989). “The Genitor Algorithm for Selective Pressure: Why Rank-Based Allocation of Reproductive Trials is the Best.” In Proc. Third Int. Conf. On Genetic Algorithms. Morgan Kaufmann.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ilich, N., Simonovic, S.P. An Evolution Program for Non-Linear Transportation Problems. Journal of Heuristics 7, 145–168 (2001). https://doi.org/10.1023/A:1009609820093
Issue Date:
DOI: https://doi.org/10.1023/A:1009609820093