A Comparison of Two Representations for the Fixed Charge Transportation Problem | SpringerLink
Skip to main content
Springer Nature Link
Log in

A Comparison of Two Representations for the Fixed Charge Transportation Problem

  • Conference paper
Parallel Problem Solving from Nature PPSN VI (PPSN 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1917))

Included in the following conference series:

  • 7769 Accesses

Abstract

In the past years several evolutionary algorithms have been applied to the fixed charge transportation problem (FCTP). Although suffering from a lack of locality, the Prüfer number representation has recently been suggested for the FCTP, and — to our surprise — it has been reported to yield good results. Since this disagrees with the common intuition that locality is an important prerequisite of successful evolutionary search, we analyse the Prüfer number representation in greater detail. The results show that the Prüfer number representation is superior to random search but clearly inferior to the permutation representation with respect to solution quality, which is explained by our locality analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. M. Gen and Y. Li. Spanning Tree-based Genetic Algorithm for the Bicriteria Fixed Charge Transportation Problem. In Proceedings of the Congress on Evolutionary Computation, 2265–2271, 1999

    Google Scholar 

  2. J. Gottlieb and L. Paulmann. Genetic Algorithms for the Fixed Charge Transportation Problem. In Proceedings of the 5th IEEE International Conference on Evolutionary Computation, 330–335, 1998

    Google Scholar 

  3. J. Gottlieb and G. R. Raidl. Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem. In Proceedings of Artificial Evolution, 1999

    Google Scholar 

  4. Y. Li, M. Gen and K. Ida. Fixed Charge Transportation Problem by Spanning Tree-based Genetic Algorithm. Beijing Mathematics, Volume 4, No. 2, 239–249, 1998

    Google Scholar 

  5. C. C. Palmer and A. Kershenbaum. Representing trees in genetic algorithms. In Proceedings of the First IEEE Conference on Evolutionary Computation, Volume 1, 379–384, 1994

    Article  Google Scholar 

  6. F. Rothlauf and D. Goldberg. Tree Network Design with Genetic Algorithms — An Investigation in the Locality of the Pruefernumber Encoding. In S. Brave and A. S. Wu (eds.), Late Breaking Papers at the Genetic and Evolutionary Computation Conference, 238–243, 1999

    Google Scholar 

  7. 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, Volume 106, 441–456, 1998

    Article  MATH  Google Scholar 

  8. G. A. Vignaux and Z. Michalewicz. A genetic algorithm for the linear transportation problem. IEEE Transactions on Systems, Man, and Cybernetics, Volume 21, No. 2, 445–452, 1991

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technical University of Clausthal, Julius-Albert-Str. 4, 38678, Clausthal-Zellerfeld, Germany

    Jens Gottlieb & Christoph Eckert

Authors
  1. Jens Gottlieb
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christoph Eckert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CMAP, Ecole Polytechnique, 91128, Palaiseau Cedex, France

    Marc Schoenauer

  2. Dept. of Mechanical Engineering Kanpur Genetic Algorithms Laboratory, Indian Institute of Technology Kanpur, Kanpur, Pin, 208 016, India

    Kalyanmoy Deb

  3. Fachbereich Informatik, Lehrstuhl für Systemanalyse, Universität Dortmund, Joseph-von-Fraunhofer-Str. 20, 44221, Dortmund, Germany

    Günther Rudolph  & Hans-Paul Schwefel  & 

  4. School of Computer Science, The University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK

    Xin Yao

  5. Projet Fractales, INRIA Rocquencourt, BP 105, 78153, Le Chesnay Cedex, France

    Evelyne Lutton

  6. Dept. de Arquitectura y Technologa de los Computadores, GeNeura Team, Universidad de Granada, Campus Fuenetenueva, s/n, Granada

    Juan Julian Merelo

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gottlieb, J., Eckert, C. (2000). A Comparison of Two Representations for the Fixed Charge Transportation Problem. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-45356-3_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41056-0

  • Online ISBN: 978-3-540-45356-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics