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.

Zoning Search With Adaptive Resource Allocating Method for Balanced and Imbalanced Multimodal Multi-Objective Optimization

Maintaining population diversity is an important task in the multimodal multi-objective optimization.Although the zoning search(ZS)can improve the diversity in the decision space,assigning the same computational costs to each search subspace may be wasteful when computational resources are limited,especially on imbalanced problems.To alleviate the above-mentioned issue,a zoning search with adaptive resource allocating(ZS-ARA)method is proposed in the current study.In the proposed ZS-ARA,the entire search space is divided into many subspaces to preserve the diversity in the decision space and to reduce the problem complexity.Moreover,the computational resources can be automatically allocated among all the subspaces.The ZS-ARA is compared with seven algorithms on two different types of multimodal multi-objective problems(MMOPs),namely,balanced and imbalanced MMOPs.The results indicate that,similarly to the ZS,the ZS-ARA achieves high performance with the balanced MMOPs.Also,it can greatly assist a“regular”algorithm in improving its performance on the imbalanced MMOPs,and is capable of allocating the limited computational resources dynamically.

An Air Defense Weapon Target Assignment Method Based on Multi-Objective Artificial Bee Colony Algorithm

With the advancement of combat equipment technology and combat concepts,new requirements have been put forward for air defense operations during a group target attack.To achieve high-efficiency and lowloss defensive operations,a reasonable air defense weapon assignment strategy is a key step.In this paper,a multi-objective and multi-constraints weapon target assignment(WTA)model is established that aims to minimize the defensive resource loss,minimize total weapon consumption,and minimize the target residual effectiveness.An optimization framework of air defense weapon mission scheduling based on the multiobjective artificial bee colony(MOABC)algorithm is proposed.The solution for point-to-point saturated attack targets at different operational scales is achieved by encoding the nectar with real numbers.Simulations are performed for an imagined air defense scenario,where air defense weapons are saturated.The non-dominated solution sets are obtained by the MOABC algorithm to meet the operational demand.In the case where there are more weapons than targets,more diverse assignment schemes can be selected.According to the inverse generation distance(IGD)index,the convergence and diversity for the solutions of the non-dominated sorting genetic algorithm III(NSGA-III)algorithm and the MOABC algorithm are compared and analyzed.The results prove that the MOABC algorithm has better convergence and the solutions are more evenly distributed among the solution space.

Multi-Objective Deep Reinforcement Learning Based Time-Frequency Resource Allocation for Multi-Beam Satellite Communications

Resource allocation is an important problem influencing the service quality of multi-beam satellite communications.In multi-beam satellite communications, the available frequency bandwidth is limited, users requirements vary rapidly, high service quality and joint allocation of multi-dimensional resources such as time and frequency are required. It is a difficult problem needs to be researched urgently for multi-beam satellite communications, how to obtain a higher comprehensive utilization rate of multidimensional resources, maximize the number of users and system throughput, and meet the demand of rapid allocation adapting dynamic changed the number of users under the condition of limited resources, with using an efficient and fast resource allocation algorithm.In order to solve the multi-dimensional resource allocation problem of multi-beam satellite communications, this paper establishes a multi-objective optimization model based on the maximum the number of users and system throughput joint optimization goal, and proposes a multi-objective deep reinforcement learning based time-frequency two-dimensional resource allocation(MODRL-TF) algorithm to adapt dynamic changed the number of users and the timeliness requirements. Simulation results show that the proposed algorithm could provide higher comprehensive utilization rate of multi-dimensional resources,and could achieve multi-objective joint optimization,and could obtain better timeliness than traditional heuristic algorithms, such as genetic algorithm(GA)and ant colony optimization algorithm(ACO).

Dynamic Allocation of Manufacturing Tasks and Resources in Shared Manufacturing

Shared manufacturing is recognized as a new point-to-point manufac-turing mode in the digital era.Shared manufacturing is referred to as a new man-ufacturing mode to realize the dynamic allocation of manufacturing tasks and resources.Compared with the traditional mode,shared manufacturing offers more abundant manufacturing resources and flexible configuration options.This paper proposes a model based on the description of the dynamic allocation of tasks and resources in the shared manufacturing environment,and the characteristics of shared manufacturing resource allocation.The execution of manufacturing tasks,in which candidate manufacturing resources enter or exit at various time nodes,enables the dynamic allocation of manufacturing tasks and resources.Then non-dominated sorting genetic algorithm(NSGA-II)and multi-objective particle swarm optimization(MOPSO)algorithms are designed to solve the model.The optimal parameter settings for the NSGA-II and MOPSO algorithms have been obtained according to the experiments with various population sizes and iteration numbers.In addition,the proposed model’s efficiency,which considers the entries and exits of manufacturing resources in the shared manufacturing environment,is further demonstrated by the overlap between the outputs of the NSGA-II and MOPSO algorithms for optimal resource allocation.

Downlink Resource Allocation with Multi-Objective Optimization in OFDMA Systems

A downlink radio resource allocation algorithm is proposed for orthogonal frequency division multiple access( OFDMA) systems. The resource allocation problem about system throughput and user fairness is formulated based on the multi-objective optimization theory. Then the optimality conditions are derived,according to which a joint subcarrier and power allocation algorithm is proposed. The simulation results show that the proposed algorithm can dynamically achieve arbitrary levels of compromise between throughput and fairness by adjusting the weighting coefficient,outperforming some static algorithms. In comparison,the classic maximum rate algorithm( MRA),max-min algorithm and proportional fairness( PF) algorithm can only achieve tradeoff in a certain level and are all special cases of the proposed algorithm.

Conjunctive Utilization of Water Resources at the Yulin Coal-Mine Base in China

Shortages in water resources and the fragile ecosystem by coal-mine water affect the Yulin coal-mine base in northwest China, so taking coal-mine water into account is an important issue for the sustainable management of water resources. This paper aims to explore how the Yulin coal-mine base can improve its conjunctive utilization of water resources. Integrated utilization is proposed by establishing a multi-objective, multi-water-source, optimal-allocation model;setting up an integrated information platform;and giving very useful measures and policy suggestions to the local government. Finally, this research can also serve as an example of integrated water utilization for other energy bases.

Resource allocation optimization of equipment development task based on MOPSO algorithm

Resource allocation for an equipment development task is a complex process owing to the inherent characteristics,such as large amounts of input resources,numerous sub-tasks,complex network structures,and high degrees of uncertainty.This paper presents an investigation into the influence of resource allocation on the duration and cost of sub-tasks.Mathematical models are constructed for the relationships of the resource allocation quantity with the duration and cost of the sub-tasks.By considering the uncertainties,such as fluctuations in the sub-task duration and cost,rework iterations,and random overlaps,the tasks are simulated for various resource allocation schemes.The shortest duration and the minimum cost of the development task are first formulated as the objective function.Based on a multi-objective particle swarm optimization(MOPSO)algorithm,a multi-objective evolutionary algorithm is constructed to optimize the resource allocation scheme for the development task.Finally,an uninhabited aerial vehicle(UAV)is considered as an example of a development task to test the algorithm,and the optimization results of this method are compared with those based on non-dominated sorting genetic algorithm-II(NSGA-II),non-dominated sorting differential evolution(NSDE)and strength pareto evolutionary algorithm-II(SPEA-II).The proposed method is verified for its scientific approach and effectiveness.The case study shows that the optimization of the resource allocation can greatly aid in shortening the duration of the development task and reducing its cost effectively.

A Dynamic Resource Allocation Strategy with Reinforcement Learning for Multimodal Multi-objective Optimization

Many isolation approaches, such as zoning search, have been proposed to preserve the diversity in the decision space of multimodal multi-objective optimization(MMO). However, these approaches allocate the same computing resources for subspaces with different difficulties and evolution states. In order to solve this issue, this paper proposes a dynamic resource allocation strategy(DRAS)with reinforcement learning for multimodal multi-objective optimization problems(MMOPs). In DRAS, relative contribution and improvement are utilized to define the aptitude of subspaces, which can capture the potentials of subspaces accurately. Moreover, the reinforcement learning method is used to dynamically allocate computing resources for each subspace. In addition, the proposed DRAS is applied to zoning searches. Experimental results demonstrate that DRAS can effectively assist zoning search in finding more and better distributed equivalent Pareto optimal solutions in the decision space.

Multi-objective resource optimization scheduling based on iterative double auction in cloud manufacturing

Cloud manufacturing is a new kind of networked manufacturing model.In this model,manufacturing resources are organized and used on demand as marketoriented services.These services are highly uncertain and focus on users.The information between service demanders and service providers is usually incomplete.These challenges make the resource scheduling more difficult.In this study,an iterative double auction mechanism is proposed based on game theory to balance the individual benefits.Resource demanders and providers act as buyers and sellers in the auction.Resource demanders offer a price according to the budget,the delivery time,preference,and the process of auction.Meanwhile,resource providers ask for a price according to the cost,maximum expected profit,optimal reservation price,and the process of auction.A honest quotation strategy is dominant for a participant in the auction.The mechanism is capable of guaranteeing the economic benefits among different participants in the market with incomplete information.Furthermore,the mechanism is helpful for preventing harmful market behaviors such as speculation,cheating,etc.Based on the iterative double auction mechanism,manufacturing resources are optimally allocated to users with consideration of multiple objectives.The auction mechanism is also incentive compatibility.

Optimization of fixed aviation support resource station configuration for aircraft carrier based on aircraft dispatch mission scheduling

Before the dispatch of the carrier-based aircraft,a series of pre-flight preparation operations need to be completed on the flight deck.Flight deck fixed aviation support resource station configuration has an important impact on operation efficiency and sortie rate.However,the resource station configuration is determined during the aircraft carrier design phase and is rarely modified as required,which may not be suitable for some pre-flight preparation missions.In order to solve the above defects,the joint optimization of flight deck resource station configuration and aircraft carrier pre-flight preparation scheduling is studied in this paper,which is formulated as a two-tier optimization decision-making framework.An improved variable neighborhood search algorithm with four original neighborhood structures is presented.Dispatch mission experiment and algorithm performance comparison experiment are carried out in the computational experiment section.The correlation between the pre-flight preparation time(makespan)and flight deck cabin occupancy percentage is given,and advantages of the proposed algorithm in solving the mathematical model are verified.

Sequential dynamic resource allocation in multi-beam satellite systems:A learning-based optimization method

Multi-beam antenna and beam hopping technologies are an effective solution for scarce satellite frequency resources.One of the primary challenges accompanying with Multi-Beam Satellites(MBS)is an efficient Dynamic Resource Allocation(DRA)strategy.This paper presents a learning-based Hybrid-Action Deep Q-Network(HADQN)algorithm to address the sequential decision-making optimization problem in DRA.By using a parameterized hybrid action space,HADQN makes it possible to schedule the beam pattern and allocate transmitter power more flexibly.To pursue multiple long-term QoS requirements,HADQN adopts a multi-objective optimization method to decrease system transmission delay,loss ratio of data packets and power consumption load simultaneously.Experimental results demonstrate that the proposed HADQN algorithm is feasible and greatly reduces in-orbit energy consumption without compromising QoS performance.

Tradeoffs in Covert Wireless Communication with a Controllable Full-Duplex Receiver

This paper investigates the tradeoff of the communication link and the eavesdropping link in covert communication in the presence of a full-duplex(FD)receiver.When a warden(Willie)attempts to detect the signal transmitted from a legitimate transmitter(Alice),the controllable FD receiver(Bob)can transmit with random power to impose interference uncertainty to Willie and force it to make an incorrect decision.To maximize the average transmission rate(ATR)of Alice-Bob and the average covert probability(ACP)for Willie,we propose a multi-objective optimization framework to optimize Bob’s power uncertainty range(PUR)and spatial position jointly,subject to the sufficient condition for covert communication and the none-deployed-zone(NDZ).Due to the presence of multiple optimization objectives and nonconvex constraints,the nondominated sorting genetic algorithm II(NSGA-II)is utilized to explore the Pareto front and to give a set of solutions that reflect tradeoffs between the two conflicting objectives.Simulation results reveal that the solutions determined by the NSGA-II have larger values for both ATR and ACP than the other two baselines.Simulations also show the positive effect of the width of the PUR of Bob on the Pareto front.

Prediction based dynamic resource allocation method for edge computing first networking

Aiming at the factory with high-complex and multi-terminal in the industrial Internet of things(IIoT),a hierarchical edge networking collaboration(HENC)framework based on the cloud-edge collaboration and computing first networking(CFN)is proposed to improve the capability of task processing with fixed computing resources on the edge effectively.To optimize the delay and energy consumption in HENC,a multi-objective optimization(MOO)problem is formulated.Furthermore,to improve the efficiency and reliability of the system,a resource prediction model based on ridge regression(RR)is proposed to forecast the task size of the next time slot,and an emergency-aware(EA)computing resource allocation algorithm is proposed to reallocate tasks in edge CFN.Based on the simulation result,the EA algorithm is superior to the greedy resource allocation in time delay,energy consumption,quality of service(QoS)especially with limited computing resources.

Quick Hosting Capacity Evaluation Based on Distributed Dispatching for Smart Distribution Network Planning with Distributed Generation

The smart distribution network(SDN)is integrat ing increasing distributed generation(DG)and energy storage(ES).Hosting capacity evaluation is important for SDN plan ning with DG.DG and ES are usually invested by users or a third party,and they may form friendly microgrids(MGs)and operate independently.Traditional centralized dispatching meth od no longer suits for hosting capacity evaluation of SDN.A quick hosting capacity evaluation method based on distributed optimal dispatching is proposed.Firstly,a multi-objective DG hosting capacity evaluation model is established,and the host ing capacity for DG is determined by the optimal DG planning schemes.The steady-state security region method is applied to speed up the solving process of the DG hosting capacity evalua tion model.Then,the optimal dispatching models are estab lished for MG and SDN respectively to realize the operating simulation.Under the distributed dispatching strategy,the dual-side optimal operation of SDN-MGs can be realized by several iterations of power exchange requirement.Finally,an SDN with four MGs is conducted considering multiple flexible resources.It shows that the DG hosting capacity of SDN oversteps the sum of the maximum active power demand and the rated branch capacity.Besides,the annual DG electricity oversteps the maximum active power demand value.

QoS-priority based load balancing algorithm for LTE systems with mixed users

Focusing on the load balancing problem among multi-cells in long term evolution （LTE） networks with mixed users, a new multi-objective optimization modeling strategy, which integrates the guaranteed bit rate （GBR） and the best effort （BE） users, was proposed. In consideration of quality of service （QoS） priorities of different users, a decomposition method was presented to solve the original model. Derivations such as applying Lagrange multiplier method, sub-optimal solutions for mixed users were deduced. Based on derived solutions, including resource allocation schemes, a practical multi-objective load balancing algorithm jointly dealing with mixed users was given. Simulation shows a significant improvement of GBR users＇ satisfaction level and BE users＇ throughput in LTE networks by using the proposed algorithm.