Abstract
In this paper a MILP-based opt imization algorithm for the optimaloperation planning of energy supply systems is presented. For this purpose, the maintasks of optimal operation planning are discussed and th e Priority-Based DynamicSearch Strategy (PBDSS) for the solution of the optimization problem is developed taking into account different acceleration strategies. Exemplary results comparingstandard branch-and-bound algorithm to the new search strategy demonstrate the significant improvement of the optimization process.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beale E. M. L. (1998) Introduction to Optimization. Wiley, Chichester
Hacklander P., Verstege J. F. (1999) Public cogeneration in Liberalized EnergyMarkets: Operation Concepts to Sustain Competitiveness. Euroheat & Power Fernwiirme International, Vol. 29, No. 1/2, pp. 77–85
Illerhaus S. W., Verstege J. F. (1999) Optimal Operation of CHP-based Industrial-Power Systems in Liberalized Energy Markets. In: IEEE (Ed.) Proceedings of the PowerTech ’99 Conference, Budapest, Hungary, BPT99–352-13
Maubach K.-D., Verstege J. F. (1993) Long-Term Operation Planning in Combined Heat and Power Suppy Systems. In: PSCC (Ed.) Proceedings of the 11th Power Systems Computation Conference, Avignon, France, pp. 601–607
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Häcklander, P., Verstege, J.F. (2003). Accelerated MILP-Strategies for the Optimal. In: Leopold-Wildburger, U., Rendl, F., Wäscher, G. (eds) Operations Research Proceedings 2002. Operations Research Proceedings 2002, vol 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55537-4_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-55537-4_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00387-8
Online ISBN: 978-3-642-55537-4
eBook Packages: Springer Book Archive