Abstract
The fixed charge transportation problem (FCTP) has been tackled by evolutionary algorithms (EAs) using representations like permutations, Prüfer numbers, or matrices. We present a new direct representation that restricts search to basic solutions and allows using problem- specific variation operators. This representation is compared w. r. t. locality and performance to permutations and Prüfer numbers. It clearly outperforms all other EAs and even reaches the solution quality of tabu search, the most successful heuristic for the FCTP we are aware of.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
B. Freisleben and P. Merz. New genetic local search operators for the traveling salesman problem. In Proc. of PPSN IV, 890–899, 1996
J. Gottlieb and C. Eckert. A comparison of two representations for the fixed charge transportation problem. In Proc. of PPSN VI, 345–354, 2000
J. Gottlieb, B. A. Julstrom, G. R. Raidl and F. Rothlauf. Prüfer numbers: a poor representation of spanning trees for evolutionary search. In Proc. of Genetic and Evolutionary Computation Conference, 343–350, 2001
J. Gottlieb and L. Paulmann. Genetic algorithms for the fixed charge transportation problem. In Proc. of 5th IEEE Int. Conf. on Evol. Comp., 330–335, 1998
J. Gottlieb and G. R. Raidl. Characterizing locality in decoder-based EAs for the multidimensional knapsack problem. In Proc. of Artificial Evolution, 38–52, 1999
G. M. Guisewite and P. M. Pardalos. Minimum concave-cost network flow problems: Applications, complexity, and algorithms. Annals of Operations Research, Vol. 25, 75–100, 1990
Y. Li, M. Gen and K. Ida. Fixed charge transportation problem by spanning treebased genetic algorithm. Beijing Mathematics, Vol. 4, No. 2, 239–249, 1998
G. L. Nemhauser and L. A. Wolsey. Integer and combinatorial optimization. Wiley, 1998
C. C. Palmer and A. Kershenbaum. Representing trees in genetic algorithms. In Proc. of 1st IEEE Conf. on Evolutionary Computation, 379–384, 1994
G. R. Raidl and J. Gottlieb. On the importance of phenotypic duplicate elimination in decoder-based evolutionary algorithms. In Late Breaking Papers at the Genetic and Evolutionary Computation Conference, 204–211, 1999
M. Sun, J. E. Aronson, P. G. McKeown and D. Drinka. A tabu search heuristic procedure for the fixed charge transportation problem. European Journal of Operational Research, Vol. 106, 441–456, 1998
G. A. Vignaux and Z. Michalewicz. A genetic algorithm for the linear transportation problem. IEEE Transactions on Systems, Man, and Cybernetics, Vol. 21, No. 2, 445–452, 1991
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eckert, C., Gottlieb, J. (2002). Direct Representation and Variation Operators for the Fixed Charge Transportation Problem. In: Guervós, J.J.M., Adamidis, P., Beyer, HG., Schwefel, HP., Fernández-Villacañas, JL. (eds) Parallel Problem Solving from Nature — PPSN VII. PPSN 2002. Lecture Notes in Computer Science, vol 2439. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45712-7_8
Download citation
DOI: https://doi.org/10.1007/3-540-45712-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44139-7
Online ISBN: 978-3-540-45712-1
eBook Packages: Springer Book Archive