Skip to main content

Looking for Alternatives: Optimization of Energy Supply Systems without Superstructure

  • Conference paper
  • First Online:
Applications of Evolutionary Computation (EvoApplications 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8602))

Included in the following conference series:

  • 1795 Accesses

Abstract

We investigate different evolutionary algorithm (EA) variants for structural optimization of energy supply systems and compare them with a deterministic optimization approach. The evolutionary algorithms enable structural optimization avoiding to use an underlying superstructure model. As result of the optimization, we are interested in multiple good alternative designs, instead of the one single best solution only. This problem has three levels: On the top level, we need to fix a structure; based on that structure, we then have to select facility sizes; finally, given the structure and equipment sizing, on the bottom level, the equipment operation has to be specified to satisfy given energy demands. In the presented optimization approach, these three levels are addressed simultaneously. We compare EAs acting on the top level (the lower levels are treated by a mixed-integer linear programming (MILP) solver) against an MILP-only-approach and are highly interested in the ability of both methods to deliver multiple different solutions and the time required for performing this task.

Neither state-of-the-art EA for numerical optimization nor standard measures or visualizations are applicable to the problem. This lack of experience makes it difficult to understand why different EA variants perform as they do (e.g., for stating how different two structures are), we introduce a distance concept for structures. We therefore introduce a short code, and, based on this short code, a distance measure that is employed for a multidimensional scaling (MDS) based visualization. This is meant as first step towards a better understanding of the problem landscape. The algorithm comparison shows that deterministic optimization has advantages if we need to find the global optimum. In contrast, the presented EA variants reliably find multiple solutions very quickly if the required solution accuracy is relaxed. Furthermore, the proposed distance measure enables visualization revealing interesting problem properties.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • 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.

References

  1. Achterberg, T.: SCIP: solving constraint integer programs. Mathematical Programming Computation 1(1), 1–41 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  2. Frangopoulos, C.A., von Spakovsky, M.R., Sciubba, E.: A brief review of methods for the design and synthesis optimization of energy systems. Int. J. Appl. Therm. 5(4), 151–160 (2002)

    Google Scholar 

  3. Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533–549 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  4. Kallrath, J.: Mixed integer optimization in the chemical process industry: Experience, potential and future perspectives. Chem. Eng. Res. Des. 78(6), 809–822 (2000)

    Article  Google Scholar 

  5. Liu, P., Georgiadis, M.C., Pistikopoulos, E.N.: Advances in energy systems engineering. Ind. Eng. Chem. Res. 50(9), 4915–4926 (2011)

    Article  Google Scholar 

  6. Puchinger, J., Raidl, G.R.: Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 41–53. Springer, Heidelberg (2005)

    Google Scholar 

  7. Voll, P., Klaffke, C., Hennen, M., Bardow, A.: Automated superstructure-based synthesis and optimization of distributed energy supply systems. Energy 50, 374–388 (2013)

    Article  Google Scholar 

  8. Voll, P., Lampe, M., Wrobel, G., Bardow, A.: Superstructure-free synthesis and optimization of distributed industrial energy supply systems. Energy 45(1), 424–435 (2012)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mike Preuss .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Preuss, M., Voll, P., Bardow, A., Rudolph, G. (2014). Looking for Alternatives: Optimization of Energy Supply Systems without Superstructure. In: Esparcia-Alcázar, A., Mora, A. (eds) Applications of Evolutionary Computation. EvoApplications 2014. Lecture Notes in Computer Science(), vol 8602. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45523-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45523-4_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45522-7

  • Online ISBN: 978-3-662-45523-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics