Abstract
In this paper, we propose efficient load scheduling based demand side management schemes for the objective of peak load reduction. We propose two heuristic algorithms, named G-MinPeak and LevelMatch, which are based on the generalized two-dimensional strip packing problem, where each of the appliances has their specific timing requirements to be fulfilled. Furthermore, we have proposed some improvement schemes that try to modify the resulted schedule from the proposed heuristic algorithms to reduce the peak. All the proposed algorithms and improvement schemes are experimented using benchmark data sets for performance evaluation. Extensive simulation studies have been conducted using practical data to evaluate the performance of the algorithms in real life. The results obtained show that all the proposed methodologies are thoroughly effective in reducing peak load, resulting in smoother load profiles. Specifically, for the benchmark datasets, the deviation from the optimal values has been about 6% and 7% for LevelMatch and G-MinPeak algorithms respectively and by using the improvement schemes the deviations are further reduced up to 3% in many cases. For the practical datasets, the proposed improvement schemes reduce the peak by 5.21− 7.35 % on top of the peaks obtained by the two proposed heuristic algorithms without much computation overhead.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.