Skip to main content

Industrial plant pipe-route optimisation with genetic algorithms

  • Applications of Evolutionary Computation Evolutionary Computation in Mechanical, Chemical, Biological, and Optical Engineering
  • Conference paper
  • First Online:

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

Abstract

The pipe-route design problem for heavy industrial plant concerns minimising pipe material cost while satisfying constraints on required interconnections and obstacle avoidance. This process is invariably done by human experts, but modern stochastic iterative search techniques allow the opportunity to automate this process. This study explores the possibility of automated industrial pipe-route design on three test problems, using stochastic hillclimbing, simulated annealing, and genetic algorithms. The representation strategy is explained and discussed, and results are presented which show great promise for genetic algorithms in particular in this application area.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kang Soo Kim. Personal communication with Kang Soo Kim, Executive director in the DAEWOO Heavy Industry Co., Seoul, Korea, August 1994.

    Google Scholar 

  2. Jens Lienig and Holder Brandt. An evolutionary algorithm for the routing of multichip modules. In Manner Davidor, Schwefel, editor, Parallel Problem Solving from Nature — PPSN III, pages 588–597. Springer-Verlag, 1994.

    Google Scholar 

  3. Dragan A. Savic and Godfrey A. Walters. Genetic operations and constraint handling for pipe network optimization. In Proceedings of the AISB workshop. AISB, 1994.

    Google Scholar 

  4. J. Hesser, R. Maenner, and O. Stucky. Optimization of Steiner trees using Genetic Algorithms. In D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 231–236. International Conference on Genetic Algorithms, 1989.

    Google Scholar 

  5. Josep L. Ganley and James P. Cohoon. Optimal Rectilinear Steiner Tree Routing in the Presence of Obstacles. IEEE Transactions of Computer-Aided Design of Integrated Circuits and Systems, 1993.

    Google Scholar 

  6. Frank M. White. Fluid Mechanics. McGraw-Hill Book Company, second edition, 1986.

    Google Scholar 

  7. David E. Goldberg. Genetic Algorithms: in Search, Optimization & Machine Learning. Addison Wesley, 1989.

    Google Scholar 

  8. P. J. M. van Laarhoven and E. H. L. Aarts. Simulated Annealing: Theory and Applications. D. Reidel Publishing Company, 1987.

    Google Scholar 

  9. Darrell Whitley. The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trial is best. In D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms. International Conference on Genetic Algorithms, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hans-Michael Voigt Werner Ebeling Ingo Rechenberg Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, D.G., Corne, D., Ross, P. (1996). Industrial plant pipe-route optimisation with genetic algorithms. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_1064

Download citation

  • DOI: https://doi.org/10.1007/3-540-61723-X_1064

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61723-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics