A Reputation-based Distributed District Scheduling Algorithm for Smart Grids

Abstract

In this paper we develop and test a distributed algorithm providing Energy Consumption Schedules (ECS) in smart grids for a residential district. The goal is to achieve a given aggregate load pro le. The NP-hard constrained optimization problem reduces to a distributed unconstrained formulation by means of Lagrangian Relaxation technique, and a meta-heuristic algorithm based on a Quantum inspired Particle Swarm with Levy flights. A centralized iterative reputation-reward mechanism is proposed for end-users to cooperate to avoid power peaks and reduce global overload, based on random distributions simulating human behaviors and penalties on the e ective ECS di ering from the suggested ECS. Numerical results show the protocols e ectiveness.

Keywords

• Distributed Algorithms
• Autonomous Demand Response management
• Energy Consumption Scheduling
• Smart Power Grids
• Reputation algorithm