A class of interactive multi objective decision making method by means of evaluation criterion is proposed for problems with linear value function,in which case,the decision maker(DM) usually has only unwhole infor...A class of interactive multi objective decision making method by means of evaluation criterion is proposed for problems with linear value function,in which case,the decision maker(DM) usually has only unwhole information of weights for objectives. The concept of fault measure of the evaluation criterion is proposed to measure the deviation of the evaluation criterion from the DMs preference structure.The approach to obtain an upper boundary of fault measure of an evaluation criterion,and the approach to modify the evaluation criterion to be one with smaller fault measure,and the approach to obtain a pre optimized objective set by evaluation criterion with certain fault measure are also proposed.展开更多
To address the issues of frequent identity switches(IDs)and degraded identification accuracy in multi object tracking(MOT)under complex occlusion scenarios,this study proposes an occlusion-robust tracking framework ba...To address the issues of frequent identity switches(IDs)and degraded identification accuracy in multi object tracking(MOT)under complex occlusion scenarios,this study proposes an occlusion-robust tracking framework based on face-pedestrian joint feature modeling.By constructing a joint tracking model centered on“intra-class independent tracking+cross-category dynamic binding”,designing a multi-modal matching metric with spatio-temporal and appearance constraints,and innovatively introducing a cross-category feature mutual verification mechanism and a dual matching strategy,this work effectively resolves performance degradation in traditional single-category tracking methods caused by short-term occlusion,cross-camera tracking,and crowded environments.Experiments on the Chokepoint_Face_Pedestrian_Track test set demonstrate that in complex scenes,the proposed method improves Face-Pedestrian Matching F1 area under the curve(F1 AUC)by approximately 4 to 43 percentage points compared to several traditional methods.The joint tracking model achieves overall performance metrics of IDF1:85.1825%and MOTA:86.5956%,representing improvements of 0.91 and 0.06 percentage points,respectively,over the baseline model.Ablation studies confirm the effectiveness of key modules such as the Intersection over Area(IoA)/Intersection over Union(IoU)joint metric and dynamic threshold adjustment,validating the significant role of the cross-category identity matching mechanism in enhancing tracking stability.Our_model shows a 16.7%frame per second(FPS)drop vs.fairness of detection and re-identification in multiple object tracking(FairMOT),with its cross-category binding module adding aboute 10%overhead,yet maintains near-real-time performance for essential face-pedestrian tracking at small resolutions.展开更多
The gears of new energy vehicles are required to withstand higher rotational speeds and greater loads,which puts forward higher precision essentials for gear manufacturing.However,machining process parameters can caus...The gears of new energy vehicles are required to withstand higher rotational speeds and greater loads,which puts forward higher precision essentials for gear manufacturing.However,machining process parameters can cause changes in cutting force/heat,resulting in affecting gear machining precision.Therefore,this paper studies the effect of different process parameters on gear machining precision.A multi-objective optimization model is established for the relationship between process parameters and tooth surface deviations,tooth profile deviations,and tooth lead deviations through the cutting speed,feed rate,and cutting depth of the worm wheel gear grinding machine.The response surface method(RSM)is used for experimental design,and the corresponding experimental results and optimal process parameters are obtained.Subsequently,gray relational analysis-principal component analysis(GRA-PCA),particle swarm optimization(PSO),and genetic algorithm-particle swarm optimization(GA-PSO)methods are used to analyze the experimental results and obtain different optimal process parameters.The results show that optimal process parameters obtained by the GRA-PCA,PSO,and GA-PSO methods improve the gear machining precision.Moreover,the gear machining precision obtained by GA-PSO is superior to other methods.展开更多
The Internet of Things (IoT) integrates diverse devices into the Internet infrastructure, including sensors, meters, and wearable devices. Designing efficient IoT networks with these heterogeneous devices requires the...The Internet of Things (IoT) integrates diverse devices into the Internet infrastructure, including sensors, meters, and wearable devices. Designing efficient IoT networks with these heterogeneous devices requires the selection of appropriate routing protocols, which is crucial for maintaining high Quality of Service (QoS). The Internet Engineering Task Force’s Routing Over Low Power and Lossy Networks (IETF ROLL) working group developed the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) to meet these needs. While the initial RPL standard focused on single-metric route selection, ongoing research explores enhancing RPL by incorporating multiple routing metrics and developing new Objective Functions (OFs). This paper introduces a novel Objective Function (OF), the Reliable and Secure Objective Function (RSOF), designed to enhance the reliability and trustworthiness of parent selection at both the node and link levels within IoT and RPL routing protocols. The RSOF employs an adaptive parent node selection mechanism that incorporates multiple metrics, including Residual Energy (RE), Expected Transmission Count (ETX), Extended RPL Node Trustworthiness (ERNT), and a novel metric that measures node failure rate (NFR). In this mechanism, nodes with a high NFR are excluded from the parent selection process to improve network reliability and stability. The proposed RSOF was evaluated using random and grid topologies in the Cooja Simulator, with tests conducted across small, medium, and large-scale networks to examine the impact of varying node densities. The simulation results indicate a significant improvement in network performance, particularly in terms of average latency, packet acknowledgment ratio (PAR), packet delivery ratio (PDR), and Control Message Overhead (CMO), compared to the standard Minimum Rank with Hysteresis Objective Function (MRHOF).展开更多
Dear Editor,This letter proposes a novel Nash bargaining solution-based multiobjective model predictive control(MPC)scheme to deal with the interaction force control and the path-following problem of the constrained i...Dear Editor,This letter proposes a novel Nash bargaining solution-based multiobjective model predictive control(MPC)scheme to deal with the interaction force control and the path-following problem of the constrained interactive robot.Considering the elastic interaction force model,a mechanical trade-off always exists between the interaction force and position,which means that neither force nor path following can satisfy their desired demands completely.Based on this consideration,two irreconcilable control specifications,the force object function and the position track object function,are proposed,and a new multi-objective MPC scheme is then designed.展开更多
Dear Editor,This letter addresses distributed optimization for resource allocation problems with time-varying objective functions and time-varying constraints.Inspired by the distributed average tracking(DAT)approach,...Dear Editor,This letter addresses distributed optimization for resource allocation problems with time-varying objective functions and time-varying constraints.Inspired by the distributed average tracking(DAT)approach,a distributed control protocol is proposed for optimal resource allocation.The convergence to a time-varying optimal solution within a predefined time is proved.Two numerical examples are given to illustrate the effectiveness of the proposed approach.展开更多
In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the mult...In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.展开更多
The ease of accessing a virtually unlimited pool of resources makes Infrastructure as a Service (IaaS) clouds an ideal platform for running data-intensive workflow applications comprising hundreds of computational tas...The ease of accessing a virtually unlimited pool of resources makes Infrastructure as a Service (IaaS) clouds an ideal platform for running data-intensive workflow applications comprising hundreds of computational tasks. However, executing scientific workflows in IaaS cloud environments poses significant challenges due to conflicting objectives, such as minimizing execution time (makespan) and reducing resource utilization costs. This study responds to the increasing need for efficient and adaptable optimization solutions in dynamic and complex environments, which are critical for meeting the evolving demands of modern users and applications. This study presents an innovative multi-objective approach for scheduling scientific workflows in IaaS cloud environments. The proposed algorithm, MOS-MWMC, aims to minimize total execution time (makespan) and resource utilization costs by leveraging key features of virtual machine instances, such as a high number of cores and fast local SSD storage. By integrating realistic simulations based on the WRENCH framework, the method effectively dimensions the cloud infrastructure and optimizes resource usage. Experimental results highlight the superiority of MOS-MWMC compared to benchmark algorithms HEFT and Max-Min. The Pareto fronts obtained for the CyberShake, Epigenomics, and Montage workflows demonstrate closer proximity to the optimal front, confirming the algorithm’s ability to balance conflicting objectives. This study contributes to optimizing scientific workflows in complex environments by providing solutions tailored to specific user needs while minimizing costs and execution times.展开更多
An uncertain multi-objective programming problem is a special type of mathematical multi-objective programming involving uncertain variables. This type of problem is important because there are several uncertain varia...An uncertain multi-objective programming problem is a special type of mathematical multi-objective programming involving uncertain variables. This type of problem is important because there are several uncertain variables in real-world problems.Therefore, research on the uncertain multi-objective programming problem is highly relevant, particularly those problems whose objective functions are correlated. In this paper, an approach that solves an uncertain multi-objective programming problem under the expected-variance value criterion is proposed. First, we define the basic framework of the approach and review concepts such as a Pareto efficient solution and expected-variance value criterion using an order relation between various uncertain variables.Second, the uncertain multi-objective problem is converted into an uncertain single-objective programming problem via a linear weighted method or ideal point method. Then the problem is transformed into a deterministic single objective programming problem under the expected-variance value criterion. Third, four lemmas and two theorems are proved to illustrate that the optimal solution of the deterministic single-objective programming problem is an efficient solution to the original uncertainty problem. Finally, two numerical examples are presented to validate the effectiveness of the proposed approach.展开更多
In this paper, we present an algorithm to solve the inequality constrained multi-objective programming (MP) by using a penalty function with objective parameters and constraint penalty parameter. First, the penalty fu...In this paper, we present an algorithm to solve the inequality constrained multi-objective programming (MP) by using a penalty function with objective parameters and constraint penalty parameter. First, the penalty function with objective parameters and constraint penalty parameter for MP and the corresponding unconstraint penalty optimization problem (UPOP) is defined. Under some conditions, a Pareto efficient solution (or a weakly-efficient solution) to UPOP is proved to be a Pareto efficient solution (or a weakly-efficient solution) to MP. The penalty function is proved to be exact under a stable condition. Then, we design an algorithm to solve MP and prove its convergence. Finally, numerical examples show that the algorithm may help decision makers to find a satisfactory solution to MP.展开更多
In the calibration of hydrological models, evaluation criteria are explicitly and quantitatively defined as single-or multi-objective functions when utilizing automatic calibration approaches.In most previous studies,...In the calibration of hydrological models, evaluation criteria are explicitly and quantitatively defined as single-or multi-objective functions when utilizing automatic calibration approaches.In most previous studies, there is a general opinion that no single-objective function can represent all important characteristics of even one specific hydrological variable(e.g., streamflow).Thus hydrologists must turn to multi-objective calibration.In this study, we demonstrated that an optimized single-objective function can compromise multi-response modes(i.e., multi-objective functions) of the hydrograph, which is defined as summation of a power function of the absolute error between observed and simulated streamflow with the exponent of power function optimized for specific watersheds.The new objective function was applied to 196 model parameter estimation experiment(MOPEX) watersheds across the eastern United States using the semi-distributed Xinanjiang hydrological model.The optimized exponent value for each watershed was obtained by targeting four popular objective functions focusing on peak flows, low flows, water balance, and flashiness, respectively.Results showed that the optimized single-objective function can achieve a better hydrograph simulation compared to the traditional single-objective function Nash-Sutcliffe efficiency coefficient for most watersheds, and balance high flow part and low flow part of the hydrograph without substantial differences compared to multi-objective calibration.The proposed optimal single-objective function can be practically adopted in the hydrological modeling if the optimal exponent value could be determined a priori according to hydrological/climatic/landscape characteristics in a specific watershed.展开更多
By using the penalty function method with objective parameters, the paper presents an interactive algorithm to solve the inequality constrained multi-objective programming (MP). The MP is transformed into a single obj...By using the penalty function method with objective parameters, the paper presents an interactive algorithm to solve the inequality constrained multi-objective programming (MP). The MP is transformed into a single objective optimal problem (SOOP) with inequality constrains;and it is proved that, under some conditions, an optimal solution to SOOP is a Pareto efficient solution to MP. Then, an interactive algorithm of MP is designed accordingly. Numerical examples show that the algorithm can find a satisfactory solution to MP with objective weight value adjusted by decision maker.展开更多
This paper deals with the optimality conditions and dual theory of multi-objective programming problems involving generalized convexity. New classes of generalized type-I functions are introduced for arcwise connected...This paper deals with the optimality conditions and dual theory of multi-objective programming problems involving generalized convexity. New classes of generalized type-I functions are introduced for arcwise connected functions, and examples are given to show the existence of these functions. By utilizing the new concepts, several sufficient optimality conditions and Mond-Weir type duality results are proposed for non-differentiable multi-objective programming problem.展开更多
Cropping structure has a close relationship with the optimal allocation of agricultural water resources. Based on the analysis of the relationship between agricultural water resources and sustainable development, this...Cropping structure has a close relationship with the optimal allocation of agricultural water resources. Based on the analysis of the relationship between agricultural water resources and sustainable development, this paper presents a multi objective fuzzy optimization model for cropping structure and water allocation, which overcomes the shortcoming of current models that only considered the economic objective,and ignored the social and environmental objectives. During the process, a new method named fuzzy deciding weight is developed to decide the objective weight. A case study shows that the model is reliable, the method is simple and objective, and the results are reasonable. This model is useful for agricultural management and sustainable development.展开更多
This paper presents a modified method to solve multi-objective nonlinear programming problems with fuzzy parameters in its objective functions and these fuzzy parameters are characterized by fuzzy numbers. The modifie...This paper presents a modified method to solve multi-objective nonlinear programming problems with fuzzy parameters in its objective functions and these fuzzy parameters are characterized by fuzzy numbers. The modified method is based on normalized trade-off weights. The obtained stability set corresponding to α-Pareto optimal solution, using our method, is investigated. Moreover, an algorithm for obtaining any subset of the parametric space which has the same corresponding α-Pareto optimal solution is presented. Finally, a numerical example to illustrate our method is also given.展开更多
For dealing with the multi-objective optimization problems of parametric design for aircraft, a novel hybrid parallel multi-objective tabu search （HPMOTS） algorithm is used. First, a new multi-objective tabu search ...For dealing with the multi-objective optimization problems of parametric design for aircraft, a novel hybrid parallel multi-objective tabu search （HPMOTS） algorithm is used. First, a new multi-objective tabu search （MOTS） algorithm is proposed. Comparing with the traditional MOTS algorithm, this proposed algorithm adds some new methods such as the combination of MOTS algorithm and ＂Pareto solution＂, the strategy of ＂searching from many directions＂ and the reservation of good solutions. Second, this article also proposes the improved parallel multi-objective tabu search （PMOTS） algorithm. Finally, a new hybrid algorithm--HPMOTS algorithm which combines the PMOTS algorithm with the non-dominated sorting-based multi-objective genetic algorithm （NSGA） is presented. The computing results of these algorithms are compared with each other and it is shown that the optimal result can be obtained by the HPMOTS algorithm and the computing result of the PMOTS algorithm is better than that of MOTS algorithm.展开更多
In this paper,we propose a hybrid algorithm for finding a set of non dominated solutions of a multi objective optimization problem.In the proposed algorithm,a local search procedure is applied to each solution gener...In this paper,we propose a hybrid algorithm for finding a set of non dominated solutions of a multi objective optimization problem.In the proposed algorithm,a local search procedure is applied to each solution generated by genetic operations.The aim of the proposed algorithm is not to determine a single final solution but to try to find all the non dominated solutions of a multi objective optimization problem.The choice of the final solution is left to the decision makers preference.High search ability of the proposed algorithm is demonstrated by computer simulation.展开更多
In this paper, for multi objective decision making, the defects on the commonly used interactive methods based on the satisfactoriness criterion is studied. Then a class of two stage interactive method based on the...In this paper, for multi objective decision making, the defects on the commonly used interactive methods based on the satisfactoriness criterion is studied. Then a class of two stage interactive method based on the satisfactoriness criterion is proposed for improvement with the satisfactoriness criterion being determined through the collection of the decision makers preference information. An application example is presented for illustration of applicability of the method.展开更多
A transonic airfoil designed by means of classical point-optimization may result in its dramatically inferior performance under off-design conditions. To overcome this shortcoming, robust design is proposed to find ou...A transonic airfoil designed by means of classical point-optimization may result in its dramatically inferior performance under off-design conditions. To overcome this shortcoming, robust design is proposed to find out the optimal profile of an airfoil to maintain its performance in an uncertain environment. The robust airfoil optimization is aimed to minimize mean values and variances of drag coefficients while satisfying the lift and thickness constraints over a range of Mach numbers. A multi-objective estimation of distribution algorithm is applied to the robust airfoil optimization on the base of the RAE2822 benchmark airfoil. The shape of the airfoil is obtained through superposing ten Hick-Henne shape functions upon the benchmark airfoil. A set of design points is selected according to a uniform design table for aerodynamic evaluation. A Kriging model of drag coefficient is constructed with those points to reduce computing costs. Over the Mach range from 0.7 to 0.8, the airfoil generated by the robust optimization has a configuration characterized by supercritical airfoil with low drag coefficients. The small fluctuation in its drag coefficients means that the performance of the robust airfoil is insensitive to variation of Mach number.展开更多
文摘A class of interactive multi objective decision making method by means of evaluation criterion is proposed for problems with linear value function,in which case,the decision maker(DM) usually has only unwhole information of weights for objectives. The concept of fault measure of the evaluation criterion is proposed to measure the deviation of the evaluation criterion from the DMs preference structure.The approach to obtain an upper boundary of fault measure of an evaluation criterion,and the approach to modify the evaluation criterion to be one with smaller fault measure,and the approach to obtain a pre optimized objective set by evaluation criterion with certain fault measure are also proposed.
基金supported by the confidential research grant No.a8317。
文摘To address the issues of frequent identity switches(IDs)and degraded identification accuracy in multi object tracking(MOT)under complex occlusion scenarios,this study proposes an occlusion-robust tracking framework based on face-pedestrian joint feature modeling.By constructing a joint tracking model centered on“intra-class independent tracking+cross-category dynamic binding”,designing a multi-modal matching metric with spatio-temporal and appearance constraints,and innovatively introducing a cross-category feature mutual verification mechanism and a dual matching strategy,this work effectively resolves performance degradation in traditional single-category tracking methods caused by short-term occlusion,cross-camera tracking,and crowded environments.Experiments on the Chokepoint_Face_Pedestrian_Track test set demonstrate that in complex scenes,the proposed method improves Face-Pedestrian Matching F1 area under the curve(F1 AUC)by approximately 4 to 43 percentage points compared to several traditional methods.The joint tracking model achieves overall performance metrics of IDF1:85.1825%and MOTA:86.5956%,representing improvements of 0.91 and 0.06 percentage points,respectively,over the baseline model.Ablation studies confirm the effectiveness of key modules such as the Intersection over Area(IoA)/Intersection over Union(IoU)joint metric and dynamic threshold adjustment,validating the significant role of the cross-category identity matching mechanism in enhancing tracking stability.Our_model shows a 16.7%frame per second(FPS)drop vs.fairness of detection and re-identification in multiple object tracking(FairMOT),with its cross-category binding module adding aboute 10%overhead,yet maintains near-real-time performance for essential face-pedestrian tracking at small resolutions.
基金Projects(U22B2084,52275483,52075142)supported by the National Natural Science Foundation of ChinaProject(2023ZY01050)supported by the Ministry of Industry and Information Technology High Quality Development,China。
文摘The gears of new energy vehicles are required to withstand higher rotational speeds and greater loads,which puts forward higher precision essentials for gear manufacturing.However,machining process parameters can cause changes in cutting force/heat,resulting in affecting gear machining precision.Therefore,this paper studies the effect of different process parameters on gear machining precision.A multi-objective optimization model is established for the relationship between process parameters and tooth surface deviations,tooth profile deviations,and tooth lead deviations through the cutting speed,feed rate,and cutting depth of the worm wheel gear grinding machine.The response surface method(RSM)is used for experimental design,and the corresponding experimental results and optimal process parameters are obtained.Subsequently,gray relational analysis-principal component analysis(GRA-PCA),particle swarm optimization(PSO),and genetic algorithm-particle swarm optimization(GA-PSO)methods are used to analyze the experimental results and obtain different optimal process parameters.The results show that optimal process parameters obtained by the GRA-PCA,PSO,and GA-PSO methods improve the gear machining precision.Moreover,the gear machining precision obtained by GA-PSO is superior to other methods.
文摘The Internet of Things (IoT) integrates diverse devices into the Internet infrastructure, including sensors, meters, and wearable devices. Designing efficient IoT networks with these heterogeneous devices requires the selection of appropriate routing protocols, which is crucial for maintaining high Quality of Service (QoS). The Internet Engineering Task Force’s Routing Over Low Power and Lossy Networks (IETF ROLL) working group developed the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) to meet these needs. While the initial RPL standard focused on single-metric route selection, ongoing research explores enhancing RPL by incorporating multiple routing metrics and developing new Objective Functions (OFs). This paper introduces a novel Objective Function (OF), the Reliable and Secure Objective Function (RSOF), designed to enhance the reliability and trustworthiness of parent selection at both the node and link levels within IoT and RPL routing protocols. The RSOF employs an adaptive parent node selection mechanism that incorporates multiple metrics, including Residual Energy (RE), Expected Transmission Count (ETX), Extended RPL Node Trustworthiness (ERNT), and a novel metric that measures node failure rate (NFR). In this mechanism, nodes with a high NFR are excluded from the parent selection process to improve network reliability and stability. The proposed RSOF was evaluated using random and grid topologies in the Cooja Simulator, with tests conducted across small, medium, and large-scale networks to examine the impact of varying node densities. The simulation results indicate a significant improvement in network performance, particularly in terms of average latency, packet acknowledgment ratio (PAR), packet delivery ratio (PDR), and Control Message Overhead (CMO), compared to the standard Minimum Rank with Hysteresis Objective Function (MRHOF).
基金supported by the National Natural Science Foundation of China(62303095)the Natural Science Foundation of Sichuan Province(2023NSFSC0872).
文摘Dear Editor,This letter proposes a novel Nash bargaining solution-based multiobjective model predictive control(MPC)scheme to deal with the interaction force control and the path-following problem of the constrained interactive robot.Considering the elastic interaction force model,a mechanical trade-off always exists between the interaction force and position,which means that neither force nor path following can satisfy their desired demands completely.Based on this consideration,two irreconcilable control specifications,the force object function and the position track object function,are proposed,and a new multi-objective MPC scheme is then designed.
基金supported by National Key Research and Development Program of China(2024YFE0214000)National Natural Science Foundation of China(62173308)+3 种基金Natural Science Foundation of Zhejiang Province of China(LRG25F030002)Zhejiang Province Leading Geese Plan(2025C01056)Jinhua Science and Technology Project(2022-1-042)Natural Science Foundation of Jiangsu Province(BK20240009).
文摘Dear Editor,This letter addresses distributed optimization for resource allocation problems with time-varying objective functions and time-varying constraints.Inspired by the distributed average tracking(DAT)approach,a distributed control protocol is proposed for optimal resource allocation.The convergence to a time-varying optimal solution within a predefined time is proved.Two numerical examples are given to illustrate the effectiveness of the proposed approach.
文摘In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.
文摘The ease of accessing a virtually unlimited pool of resources makes Infrastructure as a Service (IaaS) clouds an ideal platform for running data-intensive workflow applications comprising hundreds of computational tasks. However, executing scientific workflows in IaaS cloud environments poses significant challenges due to conflicting objectives, such as minimizing execution time (makespan) and reducing resource utilization costs. This study responds to the increasing need for efficient and adaptable optimization solutions in dynamic and complex environments, which are critical for meeting the evolving demands of modern users and applications. This study presents an innovative multi-objective approach for scheduling scientific workflows in IaaS cloud environments. The proposed algorithm, MOS-MWMC, aims to minimize total execution time (makespan) and resource utilization costs by leveraging key features of virtual machine instances, such as a high number of cores and fast local SSD storage. By integrating realistic simulations based on the WRENCH framework, the method effectively dimensions the cloud infrastructure and optimizes resource usage. Experimental results highlight the superiority of MOS-MWMC compared to benchmark algorithms HEFT and Max-Min. The Pareto fronts obtained for the CyberShake, Epigenomics, and Montage workflows demonstrate closer proximity to the optimal front, confirming the algorithm’s ability to balance conflicting objectives. This study contributes to optimizing scientific workflows in complex environments by providing solutions tailored to specific user needs while minimizing costs and execution times.
基金supported by the National Natural Science Foundation of China(71601183 71571190)
文摘An uncertain multi-objective programming problem is a special type of mathematical multi-objective programming involving uncertain variables. This type of problem is important because there are several uncertain variables in real-world problems.Therefore, research on the uncertain multi-objective programming problem is highly relevant, particularly those problems whose objective functions are correlated. In this paper, an approach that solves an uncertain multi-objective programming problem under the expected-variance value criterion is proposed. First, we define the basic framework of the approach and review concepts such as a Pareto efficient solution and expected-variance value criterion using an order relation between various uncertain variables.Second, the uncertain multi-objective problem is converted into an uncertain single-objective programming problem via a linear weighted method or ideal point method. Then the problem is transformed into a deterministic single objective programming problem under the expected-variance value criterion. Third, four lemmas and two theorems are proved to illustrate that the optimal solution of the deterministic single-objective programming problem is an efficient solution to the original uncertainty problem. Finally, two numerical examples are presented to validate the effectiveness of the proposed approach.
文摘In this paper, we present an algorithm to solve the inequality constrained multi-objective programming (MP) by using a penalty function with objective parameters and constraint penalty parameter. First, the penalty function with objective parameters and constraint penalty parameter for MP and the corresponding unconstraint penalty optimization problem (UPOP) is defined. Under some conditions, a Pareto efficient solution (or a weakly-efficient solution) to UPOP is proved to be a Pareto efficient solution (or a weakly-efficient solution) to MP. The penalty function is proved to be exact under a stable condition. Then, we design an algorithm to solve MP and prove its convergence. Finally, numerical examples show that the algorithm may help decision makers to find a satisfactory solution to MP.
基金Under the auspices of National Key Research and Development Program of China(No.2016YFC0402701)National Natural Science Foundation of China(No.51825902)
文摘In the calibration of hydrological models, evaluation criteria are explicitly and quantitatively defined as single-or multi-objective functions when utilizing automatic calibration approaches.In most previous studies, there is a general opinion that no single-objective function can represent all important characteristics of even one specific hydrological variable(e.g., streamflow).Thus hydrologists must turn to multi-objective calibration.In this study, we demonstrated that an optimized single-objective function can compromise multi-response modes(i.e., multi-objective functions) of the hydrograph, which is defined as summation of a power function of the absolute error between observed and simulated streamflow with the exponent of power function optimized for specific watersheds.The new objective function was applied to 196 model parameter estimation experiment(MOPEX) watersheds across the eastern United States using the semi-distributed Xinanjiang hydrological model.The optimized exponent value for each watershed was obtained by targeting four popular objective functions focusing on peak flows, low flows, water balance, and flashiness, respectively.Results showed that the optimized single-objective function can achieve a better hydrograph simulation compared to the traditional single-objective function Nash-Sutcliffe efficiency coefficient for most watersheds, and balance high flow part and low flow part of the hydrograph without substantial differences compared to multi-objective calibration.The proposed optimal single-objective function can be practically adopted in the hydrological modeling if the optimal exponent value could be determined a priori according to hydrological/climatic/landscape characteristics in a specific watershed.
文摘By using the penalty function method with objective parameters, the paper presents an interactive algorithm to solve the inequality constrained multi-objective programming (MP). The MP is transformed into a single objective optimal problem (SOOP) with inequality constrains;and it is proved that, under some conditions, an optimal solution to SOOP is a Pareto efficient solution to MP. Then, an interactive algorithm of MP is designed accordingly. Numerical examples show that the algorithm can find a satisfactory solution to MP with objective weight value adjusted by decision maker.
文摘This paper deals with the optimality conditions and dual theory of multi-objective programming problems involving generalized convexity. New classes of generalized type-I functions are introduced for arcwise connected functions, and examples are given to show the existence of these functions. By utilizing the new concepts, several sufficient optimality conditions and Mond-Weir type duality results are proposed for non-differentiable multi-objective programming problem.
文摘Cropping structure has a close relationship with the optimal allocation of agricultural water resources. Based on the analysis of the relationship between agricultural water resources and sustainable development, this paper presents a multi objective fuzzy optimization model for cropping structure and water allocation, which overcomes the shortcoming of current models that only considered the economic objective,and ignored the social and environmental objectives. During the process, a new method named fuzzy deciding weight is developed to decide the objective weight. A case study shows that the model is reliable, the method is simple and objective, and the results are reasonable. This model is useful for agricultural management and sustainable development.
文摘This paper presents a modified method to solve multi-objective nonlinear programming problems with fuzzy parameters in its objective functions and these fuzzy parameters are characterized by fuzzy numbers. The modified method is based on normalized trade-off weights. The obtained stability set corresponding to α-Pareto optimal solution, using our method, is investigated. Moreover, an algorithm for obtaining any subset of the parametric space which has the same corresponding α-Pareto optimal solution is presented. Finally, a numerical example to illustrate our method is also given.
基金National Science Fund for Distinguished Young Scholars (10425208)Programme of Introducing Talents of Discipline to Universities (B07009)
文摘For dealing with the multi-objective optimization problems of parametric design for aircraft, a novel hybrid parallel multi-objective tabu search （HPMOTS） algorithm is used. First, a new multi-objective tabu search （MOTS） algorithm is proposed. Comparing with the traditional MOTS algorithm, this proposed algorithm adds some new methods such as the combination of MOTS algorithm and ＂Pareto solution＂, the strategy of ＂searching from many directions＂ and the reservation of good solutions. Second, this article also proposes the improved parallel multi-objective tabu search （PMOTS） algorithm. Finally, a new hybrid algorithm--HPMOTS algorithm which combines the PMOTS algorithm with the non-dominated sorting-based multi-objective genetic algorithm （NSGA） is presented. The computing results of these algorithms are compared with each other and it is shown that the optimal result can be obtained by the HPMOTS algorithm and the computing result of the PMOTS algorithm is better than that of MOTS algorithm.
文摘In this paper,we propose a hybrid algorithm for finding a set of non dominated solutions of a multi objective optimization problem.In the proposed algorithm,a local search procedure is applied to each solution generated by genetic operations.The aim of the proposed algorithm is not to determine a single final solution but to try to find all the non dominated solutions of a multi objective optimization problem.The choice of the final solution is left to the decision makers preference.High search ability of the proposed algorithm is demonstrated by computer simulation.
文摘In this paper, for multi objective decision making, the defects on the commonly used interactive methods based on the satisfactoriness criterion is studied. Then a class of two stage interactive method based on the satisfactoriness criterion is proposed for improvement with the satisfactoriness criterion being determined through the collection of the decision makers preference information. An application example is presented for illustration of applicability of the method.
基金National Natural Science Foundation of China (10377015)
文摘A transonic airfoil designed by means of classical point-optimization may result in its dramatically inferior performance under off-design conditions. To overcome this shortcoming, robust design is proposed to find out the optimal profile of an airfoil to maintain its performance in an uncertain environment. The robust airfoil optimization is aimed to minimize mean values and variances of drag coefficients while satisfying the lift and thickness constraints over a range of Mach numbers. A multi-objective estimation of distribution algorithm is applied to the robust airfoil optimization on the base of the RAE2822 benchmark airfoil. The shape of the airfoil is obtained through superposing ten Hick-Henne shape functions upon the benchmark airfoil. A set of design points is selected according to a uniform design table for aerodynamic evaluation. A Kriging model of drag coefficient is constructed with those points to reduce computing costs. Over the Mach range from 0.7 to 0.8, the airfoil generated by the robust optimization has a configuration characterized by supercritical airfoil with low drag coefficients. The small fluctuation in its drag coefficients means that the performance of the robust airfoil is insensitive to variation of Mach number.
