Energy-Saving Distributed Flexible Job Shop Scheduling Optimization with Dual Resource Constraints Based on Integrated Q-Learning Multi-Objective Grey Wolf Optimizer

The distributed flexible job shop scheduling problem(DFJSP)has attracted great attention with the growth of the global manufacturing industry.General DFJSP research only considers machine constraints and ignores worker constraints.As one critical factor of production,effective utilization of worker resources can increase productivity.Meanwhile,energy consumption is a growing concern due to the increasingly serious environmental issues.Therefore,the distributed flexible job shop scheduling problem with dual resource constraints(DFJSP-DRC)for minimizing makespan and total energy consumption is studied in this paper.To solve the problem,we present a multi-objective mathematical model for DFJSP-DRC and propose a Q-learning-based multi-objective grey wolf optimizer(Q-MOGWO).In Q-MOGWO,high-quality initial solutions are generated by a hybrid initialization strategy,and an improved active decoding strategy is designed to obtain the scheduling schemes.To further enhance the local search capability and expand the solution space,two wolf predation strategies and three critical factory neighborhood structures based on Q-learning are proposed.These strategies and structures enable Q-MOGWO to explore the solution space more efficiently and thus find better Pareto solutions.The effectiveness of Q-MOGWO in addressing DFJSP-DRC is verified through comparison with four algorithms using 45 instances.The results reveal that Q-MOGWO outperforms comparison algorithms in terms of solution quality.

An Optimal Dynamic Generation Scheduling for a Wind-Thermal Power System

In this paper, a dynamic generation scheduling model is formulated, aiming at minimizing the costs of power generation and taking into account the constraints of thermal power units and spinning reserve in wind power integrated systems. A dynamic solving method blended with particle swarm optimization algorithm is proposed. In this method, the solution space of the states of unit commitment is created and will be updated when the status of unit commitment changes in a period to meet the spinning reserve demand. The thermal unit operation constrains are inspected in adjacent time intervals to ensure all the states in the solution space effective. The particle swarm algorithm is applied in the procedure to optimize the load distribution of each unit commitment state. A case study in a simulation system is finally given to verify the feasibility and effectiveness of this dynamic optimization algorithm.

Short-term power generation scheduling rules for cascade hydropower stations based on hybrid algorithm

Power generation dispatching is a large complex system problem with multi-dimensional and nonlinear characteristics. A mathematical model was established based on the principle of reservoir operation. A large quantity of optimal scheduling processes were obtained by calculating the daily runoff process within three typical years, and a large number of simulated daily runoff processes were obtained using the progressive optimality algorithm （POA） in combination with the genetic algorithm （GA）. After analyzing the optimal scheduling processes, the corresponding scheduling rules were determined, and the practical formulas were obtained. These rules can make full use of the rolling runoff forecast and carry out the rolling scheduling. Compared with the optimized results, the maximum relative difference of the annual power generation obtained by the scheduling rules is no more than 1%. The effectiveness and practical applicability of the scheduling rules are demonstrated by a case study. This study provides a new perspective for formulating the rules of power generation dispatching.

Learning to branch in the generation maintenance scheduling problem

To maximize the reliability index of a power system,this study modeled a generation maintenance scheduling problem that considers the network security constraints and rationality constraints of the generation maintenance practice in a power system.In view of the computational complexity of the generation maintenance scheduling model,a variable selection method based on a support vector machine(SVM)is proposed to solve the 0-1 mixed integer programming problem(MIP).The algorithm observes and collects data from the decisions made by strong branching(SB)and then learns a surrogate function that mimics the SB strategy using a support vector machine.The learned ranking function is then used for variable branching during the solution process of the model.The test case showed that the proposed variable selection algorithm-based on the features of the proposed generation maintenance scheduling problem during branch-and-bound-can increase the solution efficiency of the generation-scheduling model on the premise of guaranteed accuracy.

ENERGY-SAVING SCHEDULING FOR LTE MULTICAST SERVICES

In the Long Term Evolution(LTE)downlink multicast scheduling,Base Station(BS)usually allocates transmit power equally among all Resource Blocks(RBs),it may cause the waste of transmit power.To avoid it,this paper put forward a new algorithm for LTE multicast downlink scheduling called the Energy-saving based Inter-group Proportional Fair(EIPF).The basic idea of EIPF is to calculate an appropriate transmitting power for each group according to its data rate respectively,and then follow the inter-group proportional fair principle to allocate RBs among multicast groups.The results of EIPF simulation show that the proposed algorithm not only can reduce the transmit power of BS effectively but also improve the utilization rate of energy.

A bi-objective model for job-shop scheduling problem to minimize both energy consumption and makespan

The issue of reducing energy consumption for the job-shop scheduling problem in machining systems is addressed, whose dual objectives are to minimize both the energy consumption and the makespan. First, the bi- objective model for the job-shop scheduling problem is proposed. The objective function value of the model represents synthesized optimization of energy consumption and makespan. Then, a heuristic algorithm is developed to locate the optimal or near optimal solutions of the model based on the Tabu search mechanism. Finally, the experimental case is presented to demonstrate the effectiveness of the proposed model and the algorithm.

Non-dominated sorting culture differential evolution algorithm for multi-objective optimal operation of Wind-Solar-Hydro complementary power generation system

Due to the intermittency and instability of Wind-Solar energy and easy compensation of hydropower, this study proposes a Wind-Solar-Hydro power optimal scheduling model. This model is aimed at maximizing the total system power generation and the minimum ten-day joint output. To effectively optimize the multi-objective model, a new algorithm named non-dominated sorting culture differential evolution algorithm(NSCDE) is proposed. The feasibility of NSCDE was verified through several well-known benchmark problems. It was then applied to the Jinping Wind-Solar-Hydro complementary power generation system. The results demonstrate that NSCDE can provide decision makers a series of optimized scheduling schemes.

Performance Evaluation of Scheduling Algorithms for 4G (LTE)

Long Term Evolution (LTE) is designed to revolutionize mobile broadband technology with key considerations of higher data rate, improved power efficiency, low latency and better quality of service. This work analyzes the impact of resource scheduling algorithms on the performance of LTE (4G) and WCDMA (3G) networks. In this paper, a full illustration of LTE system is given together with different scheduling algorithms. Thereafter, 3G WCDMA and 4G LTE networks were simulated using Simulink simulator embedded in MATLAB and performance evaluations were carried out. The performance metrics used for the evaluations are average system throughput, packet delay, latency and allocation of fairness using Round Robin, Best CQI and Proportional fair Packet Scheduling Algorithms. The results of the evaluations on both networks were analysed. The results showed that 4G LTE network performs better than 3G WCDMA network in all the three scheduling algorithms used.

A Chance Constrained Optimal Reserve Scheduling Approach for Economic Dispatch Considering Wind Penetration

The volatile wind power generation brings a full spectrum of problems to power system operation and management, ranging from transient system frequency fluctuation to steady state supply and demand balancing issue. In this paper, a novel wind integrated power system day-ahead economic dispatch model, with the consideration of generation and reserve cost is modelled and investigated. The proposed problem is first formulated as a chance constrained stochastic nonlinear programming U+0028 CCSNLP U+0029, and then transformed into a deterministic nonlinear programming U+0028 NLP U+0029. To tackle this NLP problem, a three-stage framework consists of particle swarm optimization U+0028 PSO U+0029, sequential quadratic programming U+0028 SQP U+0029 and Monte Carlo simulation U+0028 MCS U+0029 is proposed. The PSO is employed to heuristically search the line power flow limits, which are used by the SQP as constraints to solve the NLP problem. Then the solution from SQP is verified on benchmark system by using MCS. Finally, the verified results are feedback to the PSO as fitness value to update the particles. Simulation study on IEEE 30-bus system with wind power penetration is carried out, and the results demonstrate that the proposed dispatch model could be effectively solved by the proposed three-stage approach. © 2017 Chinese Association of Automation.

Deep Cutting Plane Inequalities for Stochastic Non-Preemptive Single Machine Scheduling Problem

We study the classical single machine scheduling problem but with uncertainty. A robust optimization model is presented, and an effective deep cut is derived. Numerical experiments show effectiveness of the derived cut.

An Improved Genetic Algorithm for Berth Scheduling at Bulk Terminal

Berth and loading and unloading machinery are not only the mainfactors that affecting the terminal operation, but also the main starting point ofenergy saving and emission reduction. In this paper, a genetic Algorithm Framework is designed for the berth allocation with low carbon and high efficiency atbulk terminal. In solving the problem, the scheduler’s experience is transformedinto a regular way to obtain the initial solution. The individual is represented as achromosome, and the sub-chromosomes are encoded as integers, the roulettewheel method is used for selection, the two-point crossing method is used forcross, and the exchange variation method is used for variation in the procedureof designing the Algorithm. Considering the complexity of berth schedulingproblem and the diversity of constraints and boundary conditions, the geneticalgorithm combines with system simulation to get the final scheme of berthallocation. This model and algorithm are verified to be practical by analyzingmultiple sets of examples of shorelines with different lengths. When comparedwith the traditional algorithms in three aspects which includes berth offsetdistance, departure delay cost and energy consumption of portal crane, the resultindicates that the improved algorithm is more effective and feasible. The studywill help to lower energy consumption and resource waste, reduce environmentalpollution, and provide a reference for low-carbon, green and sustainable development of the terminal.

A branch and price algorithm for the robust WSOS scheduling problem

To analyze and optimize the weapon system of systems(WSOS)scheduling process,a new method based on robust capabilities for WSOS scheduling optimization is proposed.First,we present an activity network to represent the military mission.The member systems need to be reasonably assigned to perform different activities in the mission.Then we express the problem as a set partitioning formulation with novel columns(activity flows).A heuristic branch-and-price algorithm is designed based on the model of the WSOS scheduling problem(WSOSSP).The algorithm uses the shortest resource-constrained path planning to generate robust activity flows that meet the capability requirements.Finally,we discuss this method in several test cases.The results show that the solution can reduce the makespan of the mission remarkably.

A Novel Particle Swarm Optimization for Optimal Scheduling of Hydrothermal System

A fuzzy adaptive particle swarm optimization (FAPSO) is presented to determine the optimal operation of hydrothermal power system. In order to solve the shortcoming premature and easily local optimum of the standard particle swarm optimization (PSO), the fuzzy adaptive criterion is applied for inertia weight based on the evolution speed factor and square deviation of fitness for the swarm, in each iteration process, the inertia weight is dynamically changed using the fuzzy rules to adapt to nonlinear optimization process. The performance of FAPSO is demonstrated on hydrothermal system comprising 1 thermal unit and 4 hydro plants, the comparison is drawn in PSO, FAPSO and genetic algorithms (GA) in terms of the solution quality and computational efficiency. The experiment showed that the proposed approach has higher quality solutions and strong ability in global search.

Research on the Model of Long Term Generation Planning in Power Market Reform

With the deepening of China’s power market, bilateral transactions will continue to grow in large scale. The release of bilateral transactions locked more regulatory resources of the power grid, will directly affect the operation mode of the unit and the implementation of planned electricity. In the paper, considering the large-scale bilateral trade effect on the peak regulation of power grid, energy saving and emission reduction, power system security and other factors, and then putting forward the method of long term generation planning and annual planning model to adapt to the safe operation of power grid in China. In the model, the target is minimizing the monthly load rate deviation and the annual electric quantity deviation rate, the latter includes the capacity factor. In addition, the constraints include the monthly quantity of electricity, adjustable utilization rate deviation, load rate, reserve and key sections, etc. Through an example to verify the correctness of the model, the planning and power transaction results can satisfy the peak regulation of load, energy saving and emission reduction and safety operation of the power grid requirements.

Study on a Comprehensive Energy-Saving Sail by CFD Method

A comprehensive energy-saving sail (CES) has been proposed in order to promote energy saving and emission reduction from shipping. Wind energy is harvested for propulsion and electrical generator at the same time by a unique structure of CES. A CFD (Computational Fluid Dynamics) code is verified by a case of arc wind sail, and it is used to simulate the pressure and velocity around the CES. The results show that the outlet velocity of air tunnel Vo and wind velocity Vi serve as an equation Vo ≈ 1.31Vi, which means the CES can effectively improve the conversion efficiency. In addition, it is found that Vo increases with the tunnel diameter to some extend over which it will keep almost constant.

Robust coordination of interdependent electricity and natural gas systems in day-ahead scheduling for facilitating volatile renewable generations via power-to-gas technology

The increasing interdependency of electricity and natural gas systems promotes coordination of the two systems for ensuring operational security and economics.This paper proposes a robust day-ahead scheduling model for the optimal coordinated operation of integrated energy systems while considering key uncertainties of the power system and natural gas system operation cost. Energy hub,with collocated gas-fired units, power-to-gas(Pt G) facilities, and natural gas storages, is considered to store or convert one type of energy(i.e., electricity or natural gas)into the other form, which could analogously function as large-scale electrical energy storages. The column-andconstraint generation(C&CG) is adopted to solve the proposed integrated robust model, in which nonlinear natural gas network constraints are reformulated via a set of linear constraints. Numerical experiments signify the effectiveness of the proposed model for handling volatile electrical loads and renewable generations via the coordinated scheduling of electricity and natural gas systems.

An Energy-Saving Task Scheduling Strategy Based on Vacation Queuing Theory in Cloud Computing

High energy consumption is one of the key issues of cloud computing systems. Incoming jobs in cloud computing environments have the nature of randomness, and compute nodes have to be powered on all the time to await incoming tasks. This results in a great waste of energy. An energy-saving task scheduling algorithm based on the vacation queuing model for cloud computing systems is proposed in this paper. First, we use the vacation queuing model with exhaustive service to model the task schedule of a heterogeneous cloud computing system.Next, based on the busy period and busy cycle under steady state, we analyze the expectations of task sojourn time and energy consumption of compute nodes in the heterogeneous cloud computing system. Subsequently, we propose a task scheduling algorithm based on similar tasks to reduce the energy consumption. Simulation results show that the proposed algorithm can reduce the energy consumption of the cloud computing system effectively while meeting the task performance.

Generation maintenance scheduling based on multiple objectives and their relationship analysis

In a market environment of power systems, each producer pursues its maximal profit while the independent system operator is in charge of the system reliability and the minimization of the total generation cost when generating the generation maintenance scheduling(GMS). Thus, the GMS is inherently a multi-objective optimization problem as its objectives usually conflict with each other. This paper proposes a multi-objective GMS model in a market environment which includes three types of objectives, i.e., each producer's profit, the system reliability, and the total generation cost. The GMS model has been solved by the group search optimizer with multiple producers(GSOMP) on two test systems. The simulation results show that the model is well solved by the GSOMP with a set of evenly distributed Pareto-optimal solutions obtained. The simulation results also illustrate that one producer's profit conflicts with another one's, that the total generation cost does not conflict with the profit of the producer possessing the cheapest units while the total generation cost conflicts with the other producers' profits, and that the reliability objective conflicts with the other objectives.

Economic Scheduling of Gaseous-liquid Hydrogen Generation and Storage Plants Considering Complementarity of Multiple Products

The accessible and convenient hydrogen supply is the foundation of successful materialization for hydrogen-powered vehicles(HVs).This paper proposes a novel optimal scheduling model for gaseous-liquid hydrogen generation and storage plants powered by renewable energy to enhance the economic feasibility of investment.The gaseous-liquid hydrogen generation and storage plant can be regarded as an energy hub to supply concurrent service to both the transportation sector and ancillary market.In the proposed model,the power to multi-state hydrogen(P2MH)process is analyzed in detail to model the branched hydrogen flow constraints and the corresponding energy conversion relationship during hydrogen generation,processing,and storage.To model the coupling and interaction of diverse modules in the system,the multi-energy coupling matrix is developed,which can exhibit the mapping of power from the input to the output.Based on this,a multi-product optimal scheduling(MPOS)algorithm considering complementarity of different hydrogen products is further formulated to optimize dispatch factors of the energy hub system to maximize the profit within limited resources.The demand response signals are incorporated in the algorithm to further enhance the operation revenue and the scenario-based method is deployed to consider the uncertainty.The proposed methodology has been fully tested and the results demonstrate that the proposed MPOS can lead to a higher rate of return for the gaseous-liquid hydrogen generation and storage plant.

Optimal generation scheduling in power system using frequency prediction through ANN under ABT environment

In a competitive and deregulated power scenario, the utilities try to maintain their real electric power generation in balance with the load demand, which creates a need for the precise real time generation scheduling （GS）. In this paper, the GS problem is solved to perform the unit commitment （UC） based on frequency prediction by using artificial neural network （ANN） with the objective to minimize the overall system cost of the state utility. The introduction of availability-based tariff （ABT） signifies the importance of frequency in GS. Under- prediction or over-prediction will result in an unnecessary commitment of generating units or buying power from central generating units at a higher cost. Therefore, an accurate frequency prediction is the first step toward optimal GS. The dependency of frequency on various parameters such as actual generation, load demand, wind power and power deficit has been considered in this paper. The proposed technique provides a reliable solution for the input parameter different from the one presented in the training data. The performance of the frequency predictor model has been evaluated based on the absolute percentage error （APE） and the mean absolute percentage error （MAPE）. The proposed predicted frequency sensitive GS model is applied to the system of Indian state of Tamilnadu, which reduces the overall system cost of the state utility by keeping off the dearer units selected based on the predicted frequency.