Direct representation and variation operators for the fixed charge transportation problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2439, Issue , 2002, Pages 77-87

  Eckert, Christoph ^a   Gottlieb, Jens ^a  

^a SAP RESEARCH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BASIC SOLUTIONS; EVOLUTIONARY ALGORITHMS (EAS); FIXED CHARGE TRANSPORTATION; SOLUTION QUALITY; VARIATION OPERATOR;

TABU SEARCH;

EID: 84944312478     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45712-7_8     Document Type: Conference Paper

References (12)

1. B. Freisleben and P. Merz. New genetic local search operators for the traveling salesman problem. In Proc. of PPSN IV, 890-899, 1996
2. J. Gottlieb and C. Eckert. A comparison of two representations for the fixed charge transportation problem. In Proc. of PPSN VI, 345-354, 2000
3. 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
4. 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
5. 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
6. 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
7. 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
8. G. L. Nemhauser and L. A. Wolsey. Integer and combinatorial optimization. Wiley, 1998
9. C. C. Palmer and A. Kershenbaum. Representing trees in genetic algorithms. In Proc. of 1st IEEE Conf. on Evolutionary Computation, 379-384, 1994
10. 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
11. 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
12. 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