Fully Distributed Risk-based Robust Reserve Scheduling for Bulk Hybrid AC-DC Systems

To enhance the cost-effectiveness of bulk hybrid AC-DC power systems and promote wind consumption,this paper proposes a two-stage risk-based robust reserve scheduling(RRRS)model.Different from traditional robust optimization,the proposed model applies an adjustable uncertainty set rather than a fixed one.Thereby,the operational risk is optimized together with the dispatch schedules,with a reasonable admissible region of wind power obtained correspondingly.In addition,both the operational base point and adjustment capacity of tielines are optimized in the RRRS model,which enables reserve sharing among the connected areas to handle the significant wind uncertainties.Based on the alternating direction method of multipliers(ADMM),a fully distributed framework is presented to solve the RRRS model in a distributed way.A dynamic penalty factor adjustment strategy(DPA)is also developed and applied to enhance its convergence properties.Since only limited information needs to be exchanged during the solution process,the communication burden is reduced and regional information is protected.Case studies on the 2-area 12-bus system and 3-area 354-bus system illustrate the effectiveness of the proposed model and approach.

Decomposition-Based Multi-Objective Optimization for Energy-Aware Distributed Hybrid Flow Shop Scheduling with Multiprocessor Tasks

This paper addresses the Energy-Aware Distributed Hybrid Flow Shop Scheduling Problem with Multiprocessor Tasks(EADHFSPMT)by considering two objectives simultaneously,i.e.,makespan and total energy consumption.It consists of three sub-problems,i.e.,job assignment between factories,job sequence in each factory,and machine allocation for each job.We present a mixed inter linear programming model and propose a Novel MultiObjective Evolutionary Algorithm based on Decomposition(NMOEA/D).We specially design a decoding scheme according to the characteristics of the EADHFSPMT.To initialize a population with certain diversity,four different rules are utilized.Moreover,a cooperative search is designed to produce new solutions based on different types of relationship between any solution and its neighbors.To enhance the quality of solutions,two local intensification operators are implemented according to the problem characteristics.In addition,a dynamic adjustment strategy for weight vectors is designed to balance the diversity and convergence,which can adaptively modify weight vectors according to the distribution of the non-dominated front.Extensive computational experiments are carried out by using a number of benchmark instances,which demonstrate the effectiveness of the above special designs.The statistical comparisons to the existing algorithms also verify the superior performances of the NMOEA/D.