Greedy algorithm for local heating problem
From MaRDI portal
Abstract: This paper studies a planning problem for supplying hot water in domestic environment. Hereby, boilers (e.g. gas or electric boilers, heat pumps or microCHPs) are used to heat water and store it for domestic demands. We consider a simple boiler which is either turned on or turned off and is connected to a buffer of limited capacity. The energy needed to run the boiler has to be bought e.g. on a day-ahead market, so we are interested in a planning which minimizes the cost to supply the boiler with energy in order to fulfill the given heat demand. We present a greedy algorithm for this heating problem whose time complexity is O(T {alpha}(T )) where T is the number of time intervals and {alpha} is the inverse of Ackermann function.
Recommendations
- The algorithmic structure of a decision support system for a design of a district heating network
- scientific article; zbMATH DE number 4019111
- On the Greedy Solution of Ordering Problems
- A greedy algorithm for solving ordinary transportation problem with capacity constraints
- scientific article; zbMATH DE number 1054934
Cites work
- A linear-time algorithm for finding optimal vehicle refueling policies
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Computational Complexity of the Capacitated Lot Size Problem
- Deterministic Production Planning: Algorithms and Complexity
- Dynamic version of the economic lot size model
- Introduction to algorithms
- Inventory control.
- Lot sizing and scheduling -- survey and extensions
- Single item lot sizing problems
- The vehicle routing problem: An overview of exact and approximate algorithms
This page was built for publication: Greedy algorithm for local heating problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019427)
