Sebastian Lehnhoff
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Sebastian Lehnhoff has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Jörg Bremer
University of Oldenburg
1 shared publication
Latest Publications
- Open Access
- 19 October 2021
- Published by Springer Nature in Swarm Intelligence
- Vol. 15 (4) , 403-425
Ant colony optimization for feasible scheduling of step-controlled smart grid generation
The electrical energy grid is currently experiencing a paradigm shift in control. In the future, small and decentralized energy resources will have to responsibly perform control tasks like frequency or voltage control. For many use cases, scheduling of energy resources is necessary. In the multi-dimensional discrete case–e.g., for step-controlled devices–this is an NP-hard problem if some sort of intermediate energy buffer is involved. Systematically constructing feasible solutions during optimization, hence, becomes a difficult task. We prove the NP-hardness for the example of co-generation plants and demonstrate the multi-modality of systematically designing feasible solutions. For the example of day-ahead scheduling, a model-integrated solution based on ant colony optimization has already been proposed. By using a simulation model for deciding on feasible branches, artificial ants construct the feasible search graphs on demand. Thus, the exponential growth of the graph in this combinatorial problem is avoided. We present in this extended work additional insight into the complexity and structure of the underlying the feasibility landscape and additional simulation results.
- 19 October 2021
- Published by Springer Nature in Swarm Intelligence
- Vol. 15 (4) , 403-425
Open AccessAnt colony optimization for feasible scheduling of step-controlled smart grid generation
The electrical energy grid is currently experiencing a paradigm shift in control. In the future, small and decentralized energy resources will have to responsibly perform control tasks like frequency or voltage control. For many use cases, scheduling of energy resources is necessary. In the multi-dimensional discrete case–e.g., for step-controlled devices–this is an NP-hard problem if some sort of intermediate energy buffer is involved. Systematically constructing feasible solutions during optimization, hence, becomes a difficult task. We prove the NP-hardness for the example of co-generation plants and demonstrate the multi-modality of systematically designing feasible solutions. For the example of day-ahead scheduling, a model-integrated solution based on ant colony optimization has already been proposed. By using a simulation model for deciding on feasible branches, artificial ants construct the feasible search graphs on demand. Thus, the exponential growth of the graph in this combinatorial problem is avoided. We present in this extended work additional insight into the complexity and structure of the underlying the feasibility landscape and additional simulation results.