Economic Power Dispatching from Distributed Generations: Review of Optimization Techniques

In the increasingly decentralized energy environment,economical power dispatching from distributed generations(DGs)is crucial to minimizing operating costs,optimizing resource utilization,and guaranteeing a consistent and sustainable supply of electricity.A comprehensive review of optimization techniques for economic power dispatching from distributed generations is imperative to identify the most effective strategies for minimizing operational costs while maintaining grid stability and sustainability.The choice of optimization technique for economic power dispatching from DGs depends on a number of factors,such as the size and complexity of the power system,the availability of computational resources,and the specific requirements of the application.Optimization techniques for economic power dispatching from distributed generations(DGs)can be classified into two main categories:(i)Classical optimization techniques,(ii)Heuristic optimization techniques.In classical optimization techniques,the linear programming(LP)model is one of the most popular optimization methods.Utilizing the LP model,power demand and network constraints are met while minimizing the overall cost of generating electricity from DGs.This approach is efficient in determining the best DGs dispatch and is capable of handling challenging optimization issues in the large-scale system including renewables.The quadratic programming(QP)model,a classical optimization technique,is a further popular optimization method,to consider non-linearity.The QP model can take into account the quadratic cost of energy production,with consideration constraints like network capacity,voltage,and frequency.The metaheuristic optimization techniques are also used for economic power dispatching from DGs,which include genetic algorithms(GA),particle swarm optimization(PSO),and ant colony optimization(ACO).Also,Some researchers are developing hybrid optimization techniques that combine elements of classical and heuristic optimization techniques with the incorporation of droop control,predictive control,and fuzzy-based methods.These methods can deal with large-scale systems with many objectives and non-linear,non-convex optimization issues.The most popular approaches are the LP and QP models,while more difficult problems are handled using metaheuristic optimization techniques.In summary,in order to increase efficiency,reduce costs,and ensure a consistent supply of electricity,optimization techniques are essential tools used in economic power dispatching from DGs.

Decision model and algorithm for traffic rescue resource dispatching on expressway

In order to solve the problems of potential incident rescue on expressway networks, the opportunity cost-based method is used to establish a resource dispatch decision model. The model aims to dispatch the rescue resources from the regional road networks and to obtain the location of the rescue depots and the numbers of service vehicles assigned for the potential incidents. Due to the computational complexity of the decision model, a scene decomposition algorithm is proposed. The algorithm decomposes the dispatch problem from various kinds of resources to a single resource, and determines the original scene of rescue resources based on the rescue requirements and the resource matrix. Finally, a convenient optimal dispatch scheme is obtained by decomposing each original scene and simplifying the objective function. To illustrate the application of the decision model and the algorithm, a case of the expressway network is studied on areas around Nanjing city in China and the results show that the model used and the algorithm proposed are appropriate.

Optimal dispatching method of traffic incident rescue resource for freeway network

An optimal resource dispatching method is proposed to solve the multiple-response problem under the conditions of potential incidents on freeway networks.Travel time of the response vehicle is selected instead of route distance as the weight to reflect the impact of traffic conditions on the decisions of rescue resources.According to the characteristics of different types of rescue vehicles the dispatching decision-making time is revised to show the heterogeneity among different rescue vehicle dispatching modes. The genetic algorithm is used to obtain the solutions to the rescue resources dispatching model. A case study shows that the proposed method can accurately reveal the impact of potential incidents on the costs of rescues according to the variations in the types and quantities of rescue resources and the optimal dispatching plan with respect to potential incidents can be obtained.The proposed method is applicable in real world scenarios.

New dispatching rule in furniture production scheduling for reducing weather impacts

In order to reduce the possibility that quality problems occur resulting from “ bad ” weather, a new dispatching rule is designed for the job sequencing problem in the machine shop of a wood furniture factory. First, two indices including risky duration and risk magnitude are established to characterize the weather conditions. Based on these two indices, the job suitability under the future air state is derived by the fuzzy decision method, and integrated with atraditional heuristic to compute the dispatching priority of each job. Then, a new measure matching degree is constructed to evaluate the effectiveness of the dispatching rule. The greater the matching degree, the smaller the possibility that the quality problems of wood products occur. Finally, simulation experiments show that the dispatching rule can greatly increase the matching degree while maintaining low weighted tardiness.

GPS/GIS based vehicle dispatching for opencast mines

An integrated GPS and GIS based vehicle dispatching system was presented. The system uses GIS technology for the development of digital mine map database and GPS for vehicle positioning. The system consists of five modules: position module incorporated GPS and dead reckoning (DR); a map database structure for displaying and guidance purposes; a routing module based on the map database is able to give out the best route for the vehicles; map matching and route guidance module put the vehicle position to its exact location on the road despite of errors in positioning and map data; and the client-server module allows client exchange information between driver and control centre. The system can be operated in client-server level in which users can request routing and guidance with devices such as hand phone and PDA by communicating their current positions to the server or runs in autonomous mode when users cannot reach the server.

Modeling and Performance Analysis of Dispatching Policies in Dispatcher-Based Web Server Cluster

There are two kinds of dispatching policies in content-aware web server cluster; segregation dispatching policy and mixture dispatching policy. Traditional scheduling algorithms all adopt mixture dispatching policy. They do not consider that dynamic requests＇ serving has the tendency to slow down static requests＇ serving, and that different requests have different resource demands, so they can not use duster＇s resource reasonably and effectively. This paper uses stochastic reward net （SRN） to model and analyze the two dispatching policies, and uses stochastic Petri net package （SPNP） to simulate the models. The simulation results and practical tests both show that segregation dispatching policy is better than mixture dispatching policy. The principle of segregation dispatching policy can guide us to design efficient scheduling algorithm.

Large-Scale Distributed Photovoltaic Power Dispatching and Operation Management Review

Distributed photovoltaic power (PV) is the main development model of distributed generation. It is necessary to research on dispatching and operation management with large-scale distributed PV connected. This paper analyzes development status, technical requirement and dispatching and operation management situation of distributed PV in Germany and China. Then introduce the preparation of distributed PV dispatching and operation management criterion. Through summarizing the experiences and lessons of large-scale distributed PV development in Germany, it gives advice to the development of distributed PV dispatching and operation management in China.

Collective Entity Alignment for Knowledge Fusion of Power Grid Dispatching Knowledge Graphs

Knowledge graphs(KGs)have been widely accepted as powerful tools for modeling the complex relationships between concepts and developing knowledge-based services.In recent years,researchers in the field of power systems have explored KGs to develop intelligent dispatching systems for increasingly large power grids.With multiple power grid dispatching knowledge graphs(PDKGs)constructed by different agencies,the knowledge fusion of different PDKGs is useful for providing more accurate decision supports.To achieve this,entity alignment that aims at connecting different KGs by identifying equivalent entities is a critical step.Existing entity alignment methods cannot integrate useful structural,attribute,and relational information while calculating entities’similarities and are prone to making many-to-one alignments,thus can hardly achieve the best performance.To address these issues,this paper proposes a collective entity alignment model that integrates three kinds of available information and makes collective counterpart assignments.This model proposes a novel knowledge graph attention network(KGAT)to learn the embeddings of entities and relations explicitly and calculates entities’similarities by adaptively incorporating the structural,attribute,and relational similarities.Then,we formulate the counterpart assignment task as an integer programming(IP)problem to obtain one-to-one alignments.We not only conduct experiments on a pair of PDKGs but also evaluate o ur model on three commonly used cross-lingual KGs.Experimental comparisons indicate that our model outperforms other methods and provides an effective tool for the knowledge fusion of PDKGs.

Real-time OHT Dispatching Mechanism for the Interbay Automated Material Handling System with Shortcuts and Bypasses

As a key to improve the performance of the interbay automated material handling system （AMHS） in 300 mm semiconductor wafer fabrication system, the real- time overhead hoist transport （OHT） dispatching problem has received much attention. This problem is first formu- lated as a special form of assignment problem and it is proved that more than one solution will be obtained by Hungarian algorithm simultaneously. Through proposing and strictly proving two propositions related to the char- acteristics of these solutions, a modified Hungarian algo- rithm is designed to distinguish these solutions. Finally, a new real-time OHT dispatching method is carefully designed by implementing the solution obtained by the modified Hungarian algorithm. The experimental results of discrete event simulations show that, compared with con- ventional Hungarian algorithm dispatching method, the proposed dispatching method that chooses the solution with the maximum variance respectively reduces on average 4 s of the average waiting time and average lead time of wafer lots, and its performance is rather stable in multiple dif- ferent scenarios of the interbay AMHS with different quantities of shortcuts. This research provides an efficient real-time OHT dispatching mechanism for the interbay AMHS with shortcuts and bypasses.

Jointly Optimized Request Dispatching and Service Placement for MEC in LEO Network

Integrating Multi-access Edge Computing(MEC) in Low Earth Orbit(LEO) network is an important way to provide globally seamless low-delay service. In this paper, we consider the scenario that MEC platforms with computation and storage resource are deployed on LEO satellites, which is called "LEO-MEC". Service request dispatching decision is very important for resource utilization of the whole LEO-MEC system and Qo E of MEC users. Another important problem is service placement that is closely coupled with request dispatching. This paper models the joint service request dispatching and service placement problem as an optimization problem, which is a Mixed Integer Linear Programming(MILP). Our proposed mechanism solves this problem and uses the solved decision variables to dispatch requests and place services. Simulation results show that our proposed mechanism can achieve better performance in terms of ratio of served users and average hop count compared with baseline mechanism.

Optimal dispatching method for integrated energy system based on robust economic model predictive control considering source-load power interval prediction

Effective source-load prediction and reasonable dispatching are crucial to realize the economic and reliable operations of integrated energy systems(IESs).They can overcome the challenges introduced by the uncertainties of new energies and various types of loads in the IES.Accordingly,a robust optimal dispatching method for the IES based on a robust economic model predictive control(REMPC)strategy considering source-load power interval prediction is proposed.First,an operation model of the IES is established,and an interval prediction model based on the bidirectional long short-term memory network optimized by beetle antenna search and bootstrap is formulated and applied to predict the photovoltaic power and the cooling,heating,and electrical loads.Then,an optimal dispatching scheme based on REMPC is devised for the IES.The source-load interval prediction results are used to improve the robustness of the REPMC and reduce the influence of source-load uncertainties on dispatching.An actual IES case is selected to conduct simulations;the results show that compared with other prediction techniques,the proposed method has higher prediction interval coverage probability and prediction interval normalized averaged width.Moreover,the operational cost of the IES is decreased by the REMPC strategy.With the devised dispatching scheme,the ability of the IES to handle the dispatching risk caused by prediction errors is enhanced.Improved dispatching robustness and operational economy are also achieved.

Optimal Dispatching of Large-scale Water Supply System

This paper deals with the use of optimal control techniques in large-scale water distribution networks. According to the network characteristics and actual state of the water supply system in China, the implicit model, which may be solved by utilizing the hierarchical optimization method, is established. In special, based on the analyses of the water supply system containing variable-speed pumps, a software tool has been developed successfully. The application of this model to the city of Shenyang (China) is compared to experiential strategy. The results of this study show that the developed model is a very promising optimization method to control the large-scale water supply systems.

Wind farm active power dispatching algorithm based on Grey Incidence

This study proposes a wind farm active power dispatching(WFAPD) algorithm based on the grey incidence method, which does not rely on an accurate mathematical model of wind turbines. Based on the wind turbine start-stop data at different wind speeds, the weighting coefficients, which are the participation degrees of a variable speed system and a variable pitch system in power regulation, are obtained using the grey incidence method. The incidence coefficient curve is fitted by the B-spline function at a full range of wind speeds, and the power regulation capacity of all wind turbines is obtained. Finally, the WFAPD algorithm, which is based on the regulating capacity of each wind turbine, is compared with the wind speed weighting power dispatching(WSWPD) algorithm in MATLAB. The simulation results show that the active power fluctuation of the wind farm is smaller, the rotating speed of wind turbines is smoother, and the fatigue load of highspeed turbines is effectively reduced.

Optimal Resources Dispatching Technology of Distribution Network Rush-Repairing

Confronted with the requirement of higher efficiency and higher quality of distribution network fault rush-repair, the subject addressed in this paper is the optimal resource dispatching issue of the distribution network rush-repair when single resource center cannot meet the emergent resource demands. A multi-resource and multi-center dispatching model is established with the objective of “the shortest repair start-time” and “the least number of the repair centers”. The optimal and worst solutions of each objective are both obtained, and a “proximity degree method” is used to calculate the optimal resource dispatching plan. The feasibility of the proposed algorithm is illustrated by an example of a distribution network fault. The proposed method provides a practical technique for efficiency improvement of fault rush-repair work of distribution network, and thus mostly abbreviates power recovery time and improves the management level of the distribution network.

Multi-timescale robust dispatching for coordinated automatic generation control and energy storage

The increasing penetration of renewable energy into power grids is reducing the regulation capacity of automatic generation control(AGC).Thus,there is an urgent demand to coordinate AGC units with active equipment such as energy storage.Current dispatch decision-making methods often ignore the intermittent effects of renewable energy.This paper proposes a two-stage robust optimization model in which energy storage is used to compensate for the intermittency of renewable energy for the dispatch of AGC units.This model exploits the rapid adjustment capability of energy storage to compensate for the slow response speed of AGC units,improve the adjustment potential,and respond to the problems of intermittent power generation from renewable energy.A column and constraint generation algorithm is used to solve the model.In an example analysis,the proposed model was more robust than a model that did not consider energy storage at eliminating the effects of intermittency while offering clear improvements in economy and efficiency.

Digitalization of mine operations:Scenarios to benefit in real-time truck dispatching

One of the key factors in a profitable open-pit mine is the efficiency of the waste disposal system. Using GPS-technology, the truck-dispatching decisions can be made in real-time but the chosen strategy has a crucial role. Therefore, finding the optimal dispatching strategy for truck-shovel operations is extremely important. Dispatching strategies have been reported in the literature, but the comparison of these strategies is still missing. This paper illustrates the differences between the strategies by conducting a stochastic simulation study based on the data gathered from an actual mine. The findings underline the importance of the global vision in dispatching decisions.

A Deadlock-Avoidance Dispatching Method for Multiple-Load AGVs Based Transportation System

In recent years,multiple-load automatic guided vehicle(AGV)is increasingly used in the logistics transportation fields,owing to the advantages of smaller fleet size and fewer occurrences of traffic congestion.However,one main challenge lies in the deadlock-avoidance for the dispatching process of a multiple-load AGV system.To prevent the system from falling into a deadlock,a strategy of keeping the number of jobs in the system(NJIS)at a low level is adopted in most existing literatures.It is noteworthy that a low-level NJIS will make the processing machine easier to be starved,thereby reducing the system efficiency unavoidably.The motivation of the paper is to develop a deadlock-avoidance dispatching method for a multiple-load AGV system operating at a high NJIS level.Firstly,the deadlock-avoidance dispatching method is devised by incorporating a deadlock-avoidance strategy into a dispatching procedure that contains four sub-problems.In this strategy,critical tasks are recognized according to the status of workstation buffers,and then temporarily forbidden to avoid potential deadlocks.Secondly,three multiattribute dispatching rules are designed for system efficiency,where both the traveling distance and the buffer status are taken into account.Finally,a simulation system is developed to evaluate the performance of the proposed deadlock-avoidance strategy and dispatching rules at different NJIS levels.The experimental results demonstrate that our deadlock-avoidance dispatching method can improve the system efficiency at a high NJIS level and the adaptability to various system settings,while still avoiding potential deadlocks.

Multimedia Technology for Monitoring Dispatching and Production Commanding System

This paper describes the multimedia technology applied to the safety monitoring, management dispatching and production commanding system in the coal mine, analyzes and studies the methods of compression hased on model data. In the system a multimedia computer is used to control a subsystem of safety monitoring, a subsystem of attendance management. and a subsystem of industrial TV. The multimedia computer will process the information of graphs. texts, sounds, pictures and images etc. It has the functions of real-time monitoring, emergency rescuing and accident analyzing.

DYNAMIC REQUEST DISPATCHING ALGORITHM FOR WEB SERVER CLUSTER

Distributed architectures support increased load on popular web sites by dispatching client requests transparently among multiple servers in a cluster. Packet Single-Rewriting technology and client address hashing algorithm in ONE-IP technology which can ensure application-session-keep have been analyzed, an improved request dispatching algorithm which is simple, effective and supports dynamic load balance has been proposed. In this algorithm, dispatcher evaluates which server node will process request by applying a hash function to the client IP address and comparing the result with its assigned identifier subset; it adjusts the size of the subset according to the performance and current load of each server, so as to utilize all servers' resource effectively. Simulation shows that the improved algorithm has better performance than the original one.

Key technologies and applications of intelligent dispatching command for high-speed railway in China

Purpose–The intelligent Central Traffic Control(CTC)system plays a vital role in establishing an intelligent high-speed railway(HSR)system.As the core of HSR transportation command,the intelligent CTC system is a new HSR dispatching command system that integrates the widely used CTC in China with the practical service requirements of intelligent dispatching.This paper aims to propose key technologies and applications for intelligent dispatching command in HSR in China.Design/methodology/approach–This paper first briefly introduces the functions and configuration of the intelligent CTC system.Some new servers,terminals and interfaces are introduced,which are plan adjustment server/terminal,interface for automatic train operation(ATO),interface for Dynamic Monitoring System of Train Control Equipment(DMS),interface for Power Supervisory Control and Data Acquisition(PSCADA),interface for Disaster Monitoring,etc.Findings–The key technologies applied in the intelligent CTC system include automatic adjustment of train operation plans,safety control of train routes and commands,traffic information data platform,integrated simulation of traffic dispatching and ATO function.These technologies have been applied in the Beijing-Zhangjiakou HSR,which commenced operations at the end of 2019.Implementing these key intelligent functions has improved the train dispatching command capacity,ensured the safe operation of intelligent HSR,reduced the labor intensity of dispatching operators and enhanced the intelligence level of China’s dispatching system.Originality/value–This paper provides further challenges and research directions for the intelligent dispatching command of HSR.To achieve the objectives,new measures need to be conducted,including the development of advanced technologies for intelligent dispatching command,coping with new requirements with the development of China’s railway signaling system,the integration of traffic dispatching and train control and the application of AI and data-driven modeling and methods.