The lack of systematic and scientific top-level arrangement in the field of civil aircraft flight test leads to the problems of long duration and high cost.Based on the flight test activity,mathematical models of flig...The lack of systematic and scientific top-level arrangement in the field of civil aircraft flight test leads to the problems of long duration and high cost.Based on the flight test activity,mathematical models of flight test duration and cost are established to set up the framework of flight test process.The top-level arrangement for flight test is optimized by multi-objective algorithm to reduce the duration and cost of flight test.In order to verify the necessity and validity of the mathematical models and the optimization algorithm of top-level arrangement,real flight test data is used to make an example calculation.Results show that the multi-objective optimization results of the top-level flight arrangement are better than the initial arrangement data,which can shorten the duration,reduce the cost,and improve the efficiency of flight test.展开更多
The belief rule-based(BRB)system has been popular in complexity system modeling due to its good interpretability.However,the current mainstream optimization methods of the BRB systems only focus on modeling accuracy b...The belief rule-based(BRB)system has been popular in complexity system modeling due to its good interpretability.However,the current mainstream optimization methods of the BRB systems only focus on modeling accuracy but ignore the interpretability.The single-objective optimization strategy has been applied in the interpretability-accuracy trade-off by inte-grating accuracy and interpretability into an optimization objec-tive.But the integration has a greater impact on optimization results with strong subjectivity.Thus,a multi-objective optimiza-tion framework in the modeling of BRB systems with inter-pretability-accuracy trade-off is proposed in this paper.Firstly,complexity and accuracy are taken as two independent opti-mization goals,and uniformity as a constraint to give the mathe-matical description.Secondly,a classical multi-objective opti-mization algorithm,nondominated sorting genetic algorithm II(NSGA-II),is utilized as an optimization tool to give a set of BRB systems with different accuracy and complexity.Finally,a pipeline leakage detection case is studied to verify the feasibility and effectiveness of the developed multi-objective optimization.The comparison illustrates that the proposed multi-objective optimization framework can effectively avoid the subjectivity of single-objective optimization,and has capability of joint optimiz-ing the structure and parameters of BRB systems with inter-pretability-accuracy trade-off.展开更多
In order to improve the performance of multi-objective workflow scheduling in cloud system, a multi-swarm multiobjective optimization algorithm(MSMOOA) is proposed to satisfy multiple conflicting objectives. Inspired ...In order to improve the performance of multi-objective workflow scheduling in cloud system, a multi-swarm multiobjective optimization algorithm(MSMOOA) is proposed to satisfy multiple conflicting objectives. Inspired by division of the same species into multiple swarms for different objectives and information sharing among these swarms in nature, each physical machine in the data center is considered a swarm and employs improved multi-objective particle swarm optimization to find out non-dominated solutions with one objective in MSMOOA. The particles in each swarm are divided into two classes and adopt different strategies to evolve cooperatively. One class of particles can communicate with several swarms simultaneously to promote the information sharing among swarms and the other class of particles can only exchange information with the particles located in the same swarm. Furthermore, in order to avoid the influence by the elastic available resources, a manager server is adopted in the cloud data center to collect the available resources for scheduling. The quality of the proposed method with other related approaches is evaluated by using hybrid and parallel workflow applications. The experiment results highlight the better performance of the MSMOOA than that of compared algorithms.展开更多
In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop pro...In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches.展开更多
A multi-objective optimization model for draft scheduling of hot strip mill was presented, rolling power minimizing, rolling force ratio distribution and good strip shape as the objective functions. A multi-objective ...A multi-objective optimization model for draft scheduling of hot strip mill was presented, rolling power minimizing, rolling force ratio distribution and good strip shape as the objective functions. A multi-objective differential evolution algorithm based on decomposition （MODE/D）. The two-objective and three-objective optimization experiments were performed respectively to demonstrate the optimal solutions of trade-off. The simulation results show that MODE/D can obtain a good Pareto-optimal front, which suggests a series of alternative solutions to draft scheduling. The extreme Pareto solutions are found feasible and the centres of the Pareto fronts give a good compromise. The conflict exists between each two ones of three objectives. The final optimal solution is selected from the Pareto-optimal front by the importance of objectives, and it can achieve a better performance in all objective dimensions than the empirical solutions. Finally, the practical application cases confirm the feasibility of the multi-objective approach, and the optimal solutions can gain a better rolling stability than the empirical solutions, and strip flatness decreases from （0± 63） IU to （0±45） IU in industrial production.展开更多
To determine the onset and duration of contraflow evacuation, a multi-objective optimization(MOO) model is proposed to explicitly consider both the total system evacuation time and the operation cost. A solution algor...To determine the onset and duration of contraflow evacuation, a multi-objective optimization(MOO) model is proposed to explicitly consider both the total system evacuation time and the operation cost. A solution algorithm that enhances the popular evolutionary algorithm NSGA-II is proposed to solve the model. The algorithm incorporates preliminary results as prior information and includes a meta-model as an alternative to evaluation by simulation. Numerical analysis of a case study suggests that the proposed formulation and solution algorithm are valid, and the enhanced NSGA-II outperforms the original algorithm in both convergence to the true Pareto-optimal set and solution diversity.展开更多
For the deep understanding on combustion of ammonia/diesel,this study develops a reduced mechanism of ammonia/diesel with 227 species and 937 reactions.The sub-mechanism on ammonia/interactions of N-based and C-based ...For the deep understanding on combustion of ammonia/diesel,this study develops a reduced mechanism of ammonia/diesel with 227 species and 937 reactions.The sub-mechanism on ammonia/interactions of N-based and C-based species(N—C)/NOx is optimized using the Non-dominated Sorting Genetic Algorithm II(NSGA-II)with 200 generations.The optimized mechanism(named as 937b)is validated against combustion characteristics of ammonia/methane(which is used to examine the accuracy of N—C interactions)and ammonia/diesel blends.The ignition delay times(IDTs),the laminar flame speeds and most of key intermediate species during the combustion of ammonia/methane blends can be accurately simulated by 937b under a wide range of conditions.As for ammonia/diesel blends with various diesel energy fractions,reasonable predictions on the IDTs under pressures from 1.0 MPa to5.0 MPa as well as the laminar flame speeds are also achieved by 937b.In particular,with regard to the IDT simulations of ammonia/diesel blends,937b makes progress in both aspects of overall accuracy and computational efficiency,compared to a detailed ammonia/diesel mechanism.Further kinetic analysis reveals that the reaction pathway of ammonia during the combustion of ammonia/diesel blend mainly differs in the tendencies of oxygen additions to NH_2 and NH with different equivalence ratios.展开更多
Multi-objective optimization(MOO)for the microwave metamaterial absorber(MMA)normally adopts evolutionary algo-rithms,and these optimization algorithms require many objec-tive function evaluations.To remedy this issue...Multi-objective optimization(MOO)for the microwave metamaterial absorber(MMA)normally adopts evolutionary algo-rithms,and these optimization algorithms require many objec-tive function evaluations.To remedy this issue,a surrogate-based MOO algorithm is proposed in this paper where Kriging models are employed to approximate objective functions.An efficient sampling strategy is presented to sequentially capture promising samples in the design region for exact evaluations.Firstly,new sample points are generated by the MOO on surro-gate models.Then,new samples are captured by exploiting each objective function.Furthermore,a weighted sum of the improvement of hypervolume(IHV)and the distance to sampled points is calculated to select the new sample.Compared with two well-known MOO algorithms,the proposed algorithm is vali-dated by benchmark problems.In addition,two broadband MMAs are applied to verify the feasibility and efficiency of the proposed algorithm.展开更多
In terms of tandem cold mill productivity and product quality, a multi-objective optimization model of rolling schedule based on cost fimction was proposed to determine the stand reductions, inter-stand tensions and r...In terms of tandem cold mill productivity and product quality, a multi-objective optimization model of rolling schedule based on cost fimction was proposed to determine the stand reductions, inter-stand tensions and rolling speeds for a specified product. The proposed schedule optimization model consists of several single cost fi.mctions, which take rolling force, motor power, inter-stand tension and stand reduction into consideration. The cost function, which can evaluate how far the rolling parameters are from the ideal values, was minimized using the Nelder-Mead simplex method. The proposed rolling schedule optimization method has been applied successfully to the 5-stand tandem cold mill in Tangsteel, and the results from a case study show that the proposed method is superior to those based on empirical formulae.展开更多
This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-object...This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-objective flexible job-shop scheduling problems(MOFJSPs) to minimize makespan, total machine workload and critical machine workload. An initialization program embedded in opposition-based learning(OBL) is developed for enabling the individuals to scatter in a well-distributed manner in the initial harmony memory(HM). In addition, the recursive halving technique based on opposite number is employed for shrinking the neighbourhood space in the searching phase of the OGHS. From a practice-related standpoint, a type of dual vector code technique is introduced for allowing the OGHS algorithm to adapt the discrete nature of the MOFJSP. Two practical techniques, namely Pareto optimality and technique for order preference by similarity to an ideal solution(TOPSIS), are implemented for solving the MOFJSP.Furthermore, the algorithm performance is tested by using different strategies, including OBL and recursive halving, and the OGHS is compared with existing algorithms in the latest studies.Experimental results on representative examples validate the performance of the proposed algorithm for solving the MOFJSP.展开更多
When the communication time is relatively shorter than the computation time for every task, the task duplication based scheduling (TDS) algorithm proposed by Darbha and Agrawal generates an optimal schedule. Park and ...When the communication time is relatively shorter than the computation time for every task, the task duplication based scheduling (TDS) algorithm proposed by Darbha and Agrawal generates an optimal schedule. Park and Choe also proposed an extended TDS algorithm whose optimality condition is less restricted than that of TDS algorithm, but the condition is very complex and is difficult to satisfy when the number of tasks is large. An efficient algorithm is proposed whose optimality condition is less restricted and simpler than both of the algorithms, and the schedule length is also shorter than both of the algorithms. The time complexity of the proposed algorithm is O(v2), where v represents the number of tasks.展开更多
In a typical discrete manufacturing process,a new type of reconfigurable production line is introduced,which aims to help small-and mid-size enterprises to improve machine utilization and reduce production cost.In ord...In a typical discrete manufacturing process,a new type of reconfigurable production line is introduced,which aims to help small-and mid-size enterprises to improve machine utilization and reduce production cost.In order to effectively handle the production scheduling problem for the manufacturing system,an improved multi-objective particle swarm optimization algorithm based on Brownian motion(MOPSO-BM)is proposed.Since the existing MOPSO algorithms are easily stuck in the local optimum,the global search ability of the proposed method is enhanced based on the random motion mechanism of the BM.To further strengthen the global search capacity,a strategy of fitting the inertia weight with the piecewise Gaussian cumulative distribution function(GCDF)is included,which helps to maintain an excellent convergence rate of the algorithm.Based on the commonly used indicators generational distance(GD)and hypervolume(HV),we compare the MOPSO-BM with several other latest algorithms on the benchmark functions,and it shows a better overall performance.Furthermore,for a real reconfigurable production line of smart home appliances,three algorithms,namely non-dominated sorting genetic algorithm-II(NSGA-II),decomposition-based MOPSO(dMOPSO)and MOPSO-BM,are applied to tackle the scheduling problem.It is demonstrated that MOPSO-BM outperforms the others in terms of convergence rate and quality of solutions.展开更多
This work proposes a novel approach for multi-type optimal placement of flexible AC transmission system(FACTS) devices so as to optimize multi-objective voltage stability problem. The current study discusses a way for...This work proposes a novel approach for multi-type optimal placement of flexible AC transmission system(FACTS) devices so as to optimize multi-objective voltage stability problem. The current study discusses a way for locating and setting of thyristor controlled series capacitor(TCSC) and static var compensator(SVC) using the multi-objective optimization approach named strength pareto multi-objective evolutionary algorithm(SPMOEA). Maximization of the static voltage stability margin(SVSM) and minimizations of real power losses(RPL) and load voltage deviation(LVD) are taken as the goals or three objective functions, when optimally locating multi-type FACTS devices. The performance and effectiveness of the proposed approach has been validated by the simulation results of the IEEE 30-bus and IEEE 118-bus test systems. The proposed approach is compared with non-dominated sorting particle swarm optimization(NSPSO) algorithm. This comparison confirms the usefulness of the multi-objective proposed technique that makes it promising for determination of combinatorial problems of FACTS devices location and setting in large scale power systems.展开更多
The operation variables,including feed rate of ore slurry,caustic solution and live steams in the double-stream alumina digestion process,determine the product quality,process costs and the environment pollution.Previ...The operation variables,including feed rate of ore slurry,caustic solution and live steams in the double-stream alumina digestion process,determine the product quality,process costs and the environment pollution.Previously,they were set by the technical workers according to the offline analysis results and an empirical formula,which leads to unstable process indices and high consumption frequently.So,a multi-objective optimization model is built to maintain the balance between resource consumptions and process indices by taking technical indices and energy efficiency as objectives,where the key technical indices are predicted based on the digestion kinetics of diaspore.A multi-objective state transition algorithm(MOSTA)is improved to solve the problem,in which a self-adaptive strategy is applied to dynamically adjust the operator factors of the MOSTA and dynamic infeasible threshold is used to handle constraints to enhance searching efficiency and ability of the algorithm.Then a rule based strategy is designed to make the final decision from the Pareto frontiers.The method is integrated into an optimal control system for the industrial digestion process and tested in the actual production.Results show that the proposed method can achieve the technical target while reducing the energy consumption.展开更多
The artificial bee colony(ABC) algorithm is improved to construct a hybrid multi-objective ABC algorithm, called HMOABC, for resolving optimal power flow(OPF) problem by simultaneously optimizing three conflicting obj...The artificial bee colony(ABC) algorithm is improved to construct a hybrid multi-objective ABC algorithm, called HMOABC, for resolving optimal power flow(OPF) problem by simultaneously optimizing three conflicting objectives of OPF, instead of transforming multi-objective functions into a single objective function. The main idea of HMOABC is to extend original ABC algorithm to multi-objective and cooperative mode by combining the Pareto dominance and divide-and-conquer approach. HMOABC is then used in the 30-bus IEEE test system for solving the OPF problem considering the cost, loss, and emission impacts. The simulation results show that the HMOABC is superior to other algorithms in terms of optimization accuracy and computation robustness.展开更多
A low-Earth-orbit(LEO)satellite network can provide full-coverage access services worldwide and is an essential candidate for future 6G networking.However,the large variability of the geographic distribution of the Ea...A low-Earth-orbit(LEO)satellite network can provide full-coverage access services worldwide and is an essential candidate for future 6G networking.However,the large variability of the geographic distribution of the Earth’s population leads to an uneven service volume distribution of access service.Moreover,the limitations on the resources of satellites are far from being able to serve the traffic in hotspot areas.To enhance the forwarding capability of satellite networks,we first assess how hotspot areas under different load cases and spatial scales significantly affect the network throughput of an LEO satellite network overall.Then,we propose a multi-region cooperative traffic scheduling algorithm.The algorithm migrates low-grade traffic from hotspot areas to coldspot areas for forwarding,significantly increasing the overall throughput of the satellite network while sacrificing some latency of end-to-end forwarding.This algorithm can utilize all the global satellite resources and improve the utilization of network resources.We model the cooperative multi-region scheduling of large-scale LEO satellites.Based on the model,we build a system testbed using OMNET++to compare the proposed method with existing techniques.The simulations show that our proposed method can reduce the packet loss probability by 30%and improve the resource utilization ratio by 3.69%.展开更多
To solve the resource-constrained project scheduling problem （RCPSP）, a hybrid ant colony optimization （HACO） approach is presented. To improve the quality of the schedules, the HACO is incorporated with an extend...To solve the resource-constrained project scheduling problem （RCPSP）, a hybrid ant colony optimization （HACO） approach is presented. To improve the quality of the schedules, the HACO is incorporated with an extended double justification in which the activity splitting is applied to predict whether the schedule could be improved. The HACO is tested on the set of large benchmark problems from the project scheduling problem library （PSPLIB）. The computational result shows that the proposed algo- rithm can improve the quality of the schedules efficiently.展开更多
The application of multiple UAVs in complicated tasks has been widely explored in recent years.Due to the advantages of flexibility,cheapness and consistence,the performance of heterogeneous multi-UAVs with proper coo...The application of multiple UAVs in complicated tasks has been widely explored in recent years.Due to the advantages of flexibility,cheapness and consistence,the performance of heterogeneous multi-UAVs with proper cooperative task allocation is superior to over the single UAV.Accordingly,several constraints should be satisfied to realize the efficient cooperation,such as special time-window,variant equipment,specified execution sequence.Hence,a proper task allocation in UAVs is the crucial point for the final success.The task allocation problem of the heterogeneous UAVs can be formulated as a multi-objective optimization problem coupled with the UAV dynamics.To this end,a multi-layer encoding strategy and a constraint scheduling method are designed to handle the critical logical and physical constraints.In addition,four optimization objectives:completion time,target reward,UAV damage,and total range,are introduced to evaluate various allocation plans.Subsequently,to efficiently solve the multi-objective optimization problem,an improved multi-objective quantum-behaved particle swarm optimization(IMOQPSO)algorithm is proposed.During this algorithm,a modified solution evaluation method is designed to guide algorithmic evolution;both the convergence and distribution of particles are considered comprehensively;and boundary solutions which may produce some special allocation plans are preserved.Moreover,adaptive parameter control and mixed update mechanism are also introduced in this algorithm.Finally,both the proposed model and algorithm are verified by simulation experiments.展开更多
A mathematical mechanism model was proposed for the description and analysis of the heat-stirring-acid leaching process.The model is proved to be effective by experiment.Afterwards,the leaching problem was formulated ...A mathematical mechanism model was proposed for the description and analysis of the heat-stirring-acid leaching process.The model is proved to be effective by experiment.Afterwards,the leaching problem was formulated as a constrained multi-objective optimization problem based on the mechanism model.A two-stage guide multi-objective particle swarm optimization(TSG-MOPSO) algorithm was proposed to solve this optimization problem,which can accelerate the convergence and guarantee the diversity of pareto-optimal front set as well.Computational experiment was conducted to compare the solution by the proposed algorithm with SIGMA-MOPSO by solving the model and with the manual solution in practice.The results indicate that the proposed algorithm shows better performance than SIGMA-MOPSO,and can improve the current manual solutions significantly.The improvements of production time and economic benefit compared with manual solutions are 10.5% and 7.3%,respectively.展开更多
To cope with the task scheduling problem under multi-task and transportation consideration in large-scale service oriented manufacturing systems(SOMS), a service allocation optimization mathematical model was establis...To cope with the task scheduling problem under multi-task and transportation consideration in large-scale service oriented manufacturing systems(SOMS), a service allocation optimization mathematical model was established, and then a hybrid discrete particle swarm optimization-genetic algorithm(HDPSOGA) was proposed. In SOMS, each resource involved in the whole life cycle of a product, whether it is provided by a piece of software or a hardware device, is encapsulated into a service. So, the transportation during production of a task should be taken into account because the hard-services selected are possibly provided by various providers in different areas. In the service allocation optimization mathematical model, multi-task and transportation were considered simultaneously. In the proposed HDPSOGA algorithm, integer coding method was applied to establish the mapping between the particle location matrix and the service allocation scheme. The position updating process was performed according to the cognition part, the social part, and the previous velocity and position while introducing the crossover and mutation idea of genetic algorithm to fit the discrete space. Finally, related simulation experiments were carried out to compare with other two previous algorithms. The results indicate the effectiveness and efficiency of the proposed hybrid algorithm.展开更多
基金supported by the National Natural Science Foundation of China(62073267,61903305)the Fundamental Research Funds for the Central Universities(HXGJXM202214).
文摘The lack of systematic and scientific top-level arrangement in the field of civil aircraft flight test leads to the problems of long duration and high cost.Based on the flight test activity,mathematical models of flight test duration and cost are established to set up the framework of flight test process.The top-level arrangement for flight test is optimized by multi-objective algorithm to reduce the duration and cost of flight test.In order to verify the necessity and validity of the mathematical models and the optimization algorithm of top-level arrangement,real flight test data is used to make an example calculation.Results show that the multi-objective optimization results of the top-level flight arrangement are better than the initial arrangement data,which can shorten the duration,reduce the cost,and improve the efficiency of flight test.
基金supported by the National Natural Science Foundation of China(71901212)the Science and Technology Innovation Program of Hunan Province(2020RC4046).
文摘The belief rule-based(BRB)system has been popular in complexity system modeling due to its good interpretability.However,the current mainstream optimization methods of the BRB systems only focus on modeling accuracy but ignore the interpretability.The single-objective optimization strategy has been applied in the interpretability-accuracy trade-off by inte-grating accuracy and interpretability into an optimization objec-tive.But the integration has a greater impact on optimization results with strong subjectivity.Thus,a multi-objective optimiza-tion framework in the modeling of BRB systems with inter-pretability-accuracy trade-off is proposed in this paper.Firstly,complexity and accuracy are taken as two independent opti-mization goals,and uniformity as a constraint to give the mathe-matical description.Secondly,a classical multi-objective opti-mization algorithm,nondominated sorting genetic algorithm II(NSGA-II),is utilized as an optimization tool to give a set of BRB systems with different accuracy and complexity.Finally,a pipeline leakage detection case is studied to verify the feasibility and effectiveness of the developed multi-objective optimization.The comparison illustrates that the proposed multi-objective optimization framework can effectively avoid the subjectivity of single-objective optimization,and has capability of joint optimiz-ing the structure and parameters of BRB systems with inter-pretability-accuracy trade-off.
基金Project(61473078)supported by the National Natural Science Foundation of ChinaProject(2015-2019)supported by the Program for Changjiang Scholars from the Ministry of Education,China+1 种基金Project(16510711100)supported by International Collaborative Project of the Shanghai Committee of Science and Technology,ChinaProject(KJ2017A418)supported by Anhui University Science Research,China
文摘In order to improve the performance of multi-objective workflow scheduling in cloud system, a multi-swarm multiobjective optimization algorithm(MSMOOA) is proposed to satisfy multiple conflicting objectives. Inspired by division of the same species into multiple swarms for different objectives and information sharing among these swarms in nature, each physical machine in the data center is considered a swarm and employs improved multi-objective particle swarm optimization to find out non-dominated solutions with one objective in MSMOOA. The particles in each swarm are divided into two classes and adopt different strategies to evolve cooperatively. One class of particles can communicate with several swarms simultaneously to promote the information sharing among swarms and the other class of particles can only exchange information with the particles located in the same swarm. Furthermore, in order to avoid the influence by the elastic available resources, a manager server is adopted in the cloud data center to collect the available resources for scheduling. The quality of the proposed method with other related approaches is evaluated by using hybrid and parallel workflow applications. The experiment results highlight the better performance of the MSMOOA than that of compared algorithms.
基金supported by the National Key R&D Plan(2020YFB1712902)the National Natural Science Foundation of China(52075036).
文摘In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches.
基金Projects(50974039,50634030)supported by the National Natural Science Foundation of China
文摘A multi-objective optimization model for draft scheduling of hot strip mill was presented, rolling power minimizing, rolling force ratio distribution and good strip shape as the objective functions. A multi-objective differential evolution algorithm based on decomposition （MODE/D）. The two-objective and three-objective optimization experiments were performed respectively to demonstrate the optimal solutions of trade-off. The simulation results show that MODE/D can obtain a good Pareto-optimal front, which suggests a series of alternative solutions to draft scheduling. The extreme Pareto solutions are found feasible and the centres of the Pareto fronts give a good compromise. The conflict exists between each two ones of three objectives. The final optimal solution is selected from the Pareto-optimal front by the importance of objectives, and it can achieve a better performance in all objective dimensions than the empirical solutions. Finally, the practical application cases confirm the feasibility of the multi-objective approach, and the optimal solutions can gain a better rolling stability than the empirical solutions, and strip flatness decreases from （0± 63） IU to （0±45） IU in industrial production.
基金Project(ADLT 930-809R)supported by the Alabama Department of Transportation,USA
文摘To determine the onset and duration of contraflow evacuation, a multi-objective optimization(MOO) model is proposed to explicitly consider both the total system evacuation time and the operation cost. A solution algorithm that enhances the popular evolutionary algorithm NSGA-II is proposed to solve the model. The algorithm incorporates preliminary results as prior information and includes a meta-model as an alternative to evaluation by simulation. Numerical analysis of a case study suggests that the proposed formulation and solution algorithm are valid, and the enhanced NSGA-II outperforms the original algorithm in both convergence to the true Pareto-optimal set and solution diversity.
基金the National Natural Science Foundation of China(project code:52202470)Jilin Province Natural Science Foundation(project codes:20220101205JC,20220101212JC)+2 种基金Jilin Province Specific Project of Industrial Technology Research&Development(project code:2020C025-2)2021 Interdisciplinary Integration and Innovation Project of Jilin University(project code:XJRCYB07)Free Exploration Project of Changsha Automotive Innovation Research Institute of Jilin University(project code:CAIRIZT20220202)。
文摘For the deep understanding on combustion of ammonia/diesel,this study develops a reduced mechanism of ammonia/diesel with 227 species and 937 reactions.The sub-mechanism on ammonia/interactions of N-based and C-based species(N—C)/NOx is optimized using the Non-dominated Sorting Genetic Algorithm II(NSGA-II)with 200 generations.The optimized mechanism(named as 937b)is validated against combustion characteristics of ammonia/methane(which is used to examine the accuracy of N—C interactions)and ammonia/diesel blends.The ignition delay times(IDTs),the laminar flame speeds and most of key intermediate species during the combustion of ammonia/methane blends can be accurately simulated by 937b under a wide range of conditions.As for ammonia/diesel blends with various diesel energy fractions,reasonable predictions on the IDTs under pressures from 1.0 MPa to5.0 MPa as well as the laminar flame speeds are also achieved by 937b.In particular,with regard to the IDT simulations of ammonia/diesel blends,937b makes progress in both aspects of overall accuracy and computational efficiency,compared to a detailed ammonia/diesel mechanism.Further kinetic analysis reveals that the reaction pathway of ammonia during the combustion of ammonia/diesel blend mainly differs in the tendencies of oxygen additions to NH_2 and NH with different equivalence ratios.
基金supported by the National Key Research and Development Program(2021YFB3502500).
文摘Multi-objective optimization(MOO)for the microwave metamaterial absorber(MMA)normally adopts evolutionary algo-rithms,and these optimization algorithms require many objec-tive function evaluations.To remedy this issue,a surrogate-based MOO algorithm is proposed in this paper where Kriging models are employed to approximate objective functions.An efficient sampling strategy is presented to sequentially capture promising samples in the design region for exact evaluations.Firstly,new sample points are generated by the MOO on surro-gate models.Then,new samples are captured by exploiting each objective function.Furthermore,a weighted sum of the improvement of hypervolume(IHV)and the distance to sampled points is calculated to select the new sample.Compared with two well-known MOO algorithms,the proposed algorithm is vali-dated by benchmark problems.In addition,two broadband MMAs are applied to verify the feasibility and efficiency of the proposed algorithm.
基金Project(51074051)supported by the National Natural Science Foundation of ChinaProject(N110307001)supported by the Fundamental Research Funds for the Central Universities,China
文摘In terms of tandem cold mill productivity and product quality, a multi-objective optimization model of rolling schedule based on cost fimction was proposed to determine the stand reductions, inter-stand tensions and rolling speeds for a specified product. The proposed schedule optimization model consists of several single cost fi.mctions, which take rolling force, motor power, inter-stand tension and stand reduction into consideration. The cost function, which can evaluate how far the rolling parameters are from the ideal values, was minimized using the Nelder-Mead simplex method. The proposed rolling schedule optimization method has been applied successfully to the 5-stand tandem cold mill in Tangsteel, and the results from a case study show that the proposed method is superior to those based on empirical formulae.
基金supported by the National Key Research and Development Program of China(2016YFD0700605)the Fundamental Research Funds for the Central Universities(JZ2016HGBZ1035)the Anhui University Natural Science Research Project(KJ2017A891)
文摘This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-objective flexible job-shop scheduling problems(MOFJSPs) to minimize makespan, total machine workload and critical machine workload. An initialization program embedded in opposition-based learning(OBL) is developed for enabling the individuals to scatter in a well-distributed manner in the initial harmony memory(HM). In addition, the recursive halving technique based on opposite number is employed for shrinking the neighbourhood space in the searching phase of the OGHS. From a practice-related standpoint, a type of dual vector code technique is introduced for allowing the OGHS algorithm to adapt the discrete nature of the MOFJSP. Two practical techniques, namely Pareto optimality and technique for order preference by similarity to an ideal solution(TOPSIS), are implemented for solving the MOFJSP.Furthermore, the algorithm performance is tested by using different strategies, including OBL and recursive halving, and the OGHS is compared with existing algorithms in the latest studies.Experimental results on representative examples validate the performance of the proposed algorithm for solving the MOFJSP.
文摘When the communication time is relatively shorter than the computation time for every task, the task duplication based scheduling (TDS) algorithm proposed by Darbha and Agrawal generates an optimal schedule. Park and Choe also proposed an extended TDS algorithm whose optimality condition is less restricted than that of TDS algorithm, but the condition is very complex and is difficult to satisfy when the number of tasks is large. An efficient algorithm is proposed whose optimality condition is less restricted and simpler than both of the algorithms, and the schedule length is also shorter than both of the algorithms. The time complexity of the proposed algorithm is O(v2), where v represents the number of tasks.
基金supported by the National Natural Science Foundation of China(71871203,52005447,L1924063)Zhejiang Provincial Natural Science Foundation of China(LY18G010017,LQ21E050014).
文摘In a typical discrete manufacturing process,a new type of reconfigurable production line is introduced,which aims to help small-and mid-size enterprises to improve machine utilization and reduce production cost.In order to effectively handle the production scheduling problem for the manufacturing system,an improved multi-objective particle swarm optimization algorithm based on Brownian motion(MOPSO-BM)is proposed.Since the existing MOPSO algorithms are easily stuck in the local optimum,the global search ability of the proposed method is enhanced based on the random motion mechanism of the BM.To further strengthen the global search capacity,a strategy of fitting the inertia weight with the piecewise Gaussian cumulative distribution function(GCDF)is included,which helps to maintain an excellent convergence rate of the algorithm.Based on the commonly used indicators generational distance(GD)and hypervolume(HV),we compare the MOPSO-BM with several other latest algorithms on the benchmark functions,and it shows a better overall performance.Furthermore,for a real reconfigurable production line of smart home appliances,three algorithms,namely non-dominated sorting genetic algorithm-II(NSGA-II),decomposition-based MOPSO(dMOPSO)and MOPSO-BM,are applied to tackle the scheduling problem.It is demonstrated that MOPSO-BM outperforms the others in terms of convergence rate and quality of solutions.
文摘This work proposes a novel approach for multi-type optimal placement of flexible AC transmission system(FACTS) devices so as to optimize multi-objective voltage stability problem. The current study discusses a way for locating and setting of thyristor controlled series capacitor(TCSC) and static var compensator(SVC) using the multi-objective optimization approach named strength pareto multi-objective evolutionary algorithm(SPMOEA). Maximization of the static voltage stability margin(SVSM) and minimizations of real power losses(RPL) and load voltage deviation(LVD) are taken as the goals or three objective functions, when optimally locating multi-type FACTS devices. The performance and effectiveness of the proposed approach has been validated by the simulation results of the IEEE 30-bus and IEEE 118-bus test systems. The proposed approach is compared with non-dominated sorting particle swarm optimization(NSPSO) algorithm. This comparison confirms the usefulness of the multi-objective proposed technique that makes it promising for determination of combinatorial problems of FACTS devices location and setting in large scale power systems.
基金Project(62073342)supported by the National Natural Science Foundation of ChinaProject(2014 AA 041803)supported by the Hi-tech Research and Development Program of China。
文摘The operation variables,including feed rate of ore slurry,caustic solution and live steams in the double-stream alumina digestion process,determine the product quality,process costs and the environment pollution.Previously,they were set by the technical workers according to the offline analysis results and an empirical formula,which leads to unstable process indices and high consumption frequently.So,a multi-objective optimization model is built to maintain the balance between resource consumptions and process indices by taking technical indices and energy efficiency as objectives,where the key technical indices are predicted based on the digestion kinetics of diaspore.A multi-objective state transition algorithm(MOSTA)is improved to solve the problem,in which a self-adaptive strategy is applied to dynamically adjust the operator factors of the MOSTA and dynamic infeasible threshold is used to handle constraints to enhance searching efficiency and ability of the algorithm.Then a rule based strategy is designed to make the final decision from the Pareto frontiers.The method is integrated into an optimal control system for the industrial digestion process and tested in the actual production.Results show that the proposed method can achieve the technical target while reducing the energy consumption.
基金Projects(61105067,61174164)supported by the National Natural Science Foundation of China
文摘The artificial bee colony(ABC) algorithm is improved to construct a hybrid multi-objective ABC algorithm, called HMOABC, for resolving optimal power flow(OPF) problem by simultaneously optimizing three conflicting objectives of OPF, instead of transforming multi-objective functions into a single objective function. The main idea of HMOABC is to extend original ABC algorithm to multi-objective and cooperative mode by combining the Pareto dominance and divide-and-conquer approach. HMOABC is then used in the 30-bus IEEE test system for solving the OPF problem considering the cost, loss, and emission impacts. The simulation results show that the HMOABC is superior to other algorithms in terms of optimization accuracy and computation robustness.
基金This work was supported by the National Key R&D Program of China(2021YFB2900604).
文摘A low-Earth-orbit(LEO)satellite network can provide full-coverage access services worldwide and is an essential candidate for future 6G networking.However,the large variability of the geographic distribution of the Earth’s population leads to an uneven service volume distribution of access service.Moreover,the limitations on the resources of satellites are far from being able to serve the traffic in hotspot areas.To enhance the forwarding capability of satellite networks,we first assess how hotspot areas under different load cases and spatial scales significantly affect the network throughput of an LEO satellite network overall.Then,we propose a multi-region cooperative traffic scheduling algorithm.The algorithm migrates low-grade traffic from hotspot areas to coldspot areas for forwarding,significantly increasing the overall throughput of the satellite network while sacrificing some latency of end-to-end forwarding.This algorithm can utilize all the global satellite resources and improve the utilization of network resources.We model the cooperative multi-region scheduling of large-scale LEO satellites.Based on the model,we build a system testbed using OMNET++to compare the proposed method with existing techniques.The simulations show that our proposed method can reduce the packet loss probability by 30%and improve the resource utilization ratio by 3.69%.
基金supported by Liaoning BaiQianWan Talents Program(20071866-25)
文摘To solve the resource-constrained project scheduling problem （RCPSP）, a hybrid ant colony optimization （HACO） approach is presented. To improve the quality of the schedules, the HACO is incorporated with an extended double justification in which the activity splitting is applied to predict whether the schedule could be improved. The HACO is tested on the set of large benchmark problems from the project scheduling problem library （PSPLIB）. The computational result shows that the proposed algo- rithm can improve the quality of the schedules efficiently.
基金Project(61801495)supported by the National Natural Science Foundation of China
文摘The application of multiple UAVs in complicated tasks has been widely explored in recent years.Due to the advantages of flexibility,cheapness and consistence,the performance of heterogeneous multi-UAVs with proper cooperative task allocation is superior to over the single UAV.Accordingly,several constraints should be satisfied to realize the efficient cooperation,such as special time-window,variant equipment,specified execution sequence.Hence,a proper task allocation in UAVs is the crucial point for the final success.The task allocation problem of the heterogeneous UAVs can be formulated as a multi-objective optimization problem coupled with the UAV dynamics.To this end,a multi-layer encoding strategy and a constraint scheduling method are designed to handle the critical logical and physical constraints.In addition,four optimization objectives:completion time,target reward,UAV damage,and total range,are introduced to evaluate various allocation plans.Subsequently,to efficiently solve the multi-objective optimization problem,an improved multi-objective quantum-behaved particle swarm optimization(IMOQPSO)algorithm is proposed.During this algorithm,a modified solution evaluation method is designed to guide algorithmic evolution;both the convergence and distribution of particles are considered comprehensively;and boundary solutions which may produce some special allocation plans are preserved.Moreover,adaptive parameter control and mixed update mechanism are also introduced in this algorithm.Finally,both the proposed model and algorithm are verified by simulation experiments.
基金Project(2006AA060201) supported by the National High Technology Research and Development Program of China
文摘A mathematical mechanism model was proposed for the description and analysis of the heat-stirring-acid leaching process.The model is proved to be effective by experiment.Afterwards,the leaching problem was formulated as a constrained multi-objective optimization problem based on the mechanism model.A two-stage guide multi-objective particle swarm optimization(TSG-MOPSO) algorithm was proposed to solve this optimization problem,which can accelerate the convergence and guarantee the diversity of pareto-optimal front set as well.Computational experiment was conducted to compare the solution by the proposed algorithm with SIGMA-MOPSO by solving the model and with the manual solution in practice.The results indicate that the proposed algorithm shows better performance than SIGMA-MOPSO,and can improve the current manual solutions significantly.The improvements of production time and economic benefit compared with manual solutions are 10.5% and 7.3%,respectively.
基金Project(2012B091100444)supported by the Production,Education and Research Cooperative Program of Guangdong Province and Ministry of Education,ChinaProject(2013ZM0091)supported by Fundamental Research Funds for the Central Universities of China
文摘To cope with the task scheduling problem under multi-task and transportation consideration in large-scale service oriented manufacturing systems(SOMS), a service allocation optimization mathematical model was established, and then a hybrid discrete particle swarm optimization-genetic algorithm(HDPSOGA) was proposed. In SOMS, each resource involved in the whole life cycle of a product, whether it is provided by a piece of software or a hardware device, is encapsulated into a service. So, the transportation during production of a task should be taken into account because the hard-services selected are possibly provided by various providers in different areas. In the service allocation optimization mathematical model, multi-task and transportation were considered simultaneously. In the proposed HDPSOGA algorithm, integer coding method was applied to establish the mapping between the particle location matrix and the service allocation scheme. The position updating process was performed according to the cognition part, the social part, and the previous velocity and position while introducing the crossover and mutation idea of genetic algorithm to fit the discrete space. Finally, related simulation experiments were carried out to compare with other two previous algorithms. The results indicate the effectiveness and efficiency of the proposed hybrid algorithm.
