The principal-subordinate hierarchical multi-objective programming model of initial water rights allocation was developed based on the principle of coordinated and sustainable development of different regions and wate...The principal-subordinate hierarchical multi-objective programming model of initial water rights allocation was developed based on the principle of coordinated and sustainable development of different regions and water sectors within a basin. With the precondition of strictly controlling maximum emissions rights, initial water rights were allocated between the first and the second levels of the hierarchy in order to promote fair and coordinated development across different regions of the basin and coordinated and efficient water use across different water sectors, realize the maximum comprehensive benefits to the basin, promote the unity of quantity and quality of initial water rights allocation, and eliminate water conflict across different regions and water sectors. According to interactive decision-making theory, a principal-subordinate hierarchical interactive iterative algorithm based on the satisfaction degree was developed and used to solve the initial water rights allocation model. A case study verified the validity of the model.展开更多
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.展开更多
To overcome the defects that the traditional ap-proach for multi-objective programming under uncertain ran-dom environment(URMOP)neglects the randomness and uncer-tainty of the problem and the volatility of the result...To overcome the defects that the traditional ap-proach for multi-objective programming under uncertain ran-dom environment(URMOP)neglects the randomness and uncer-tainty of the problem and the volatility of the results,a new ap-proach is proposed based on expected value-standard devi-ation value criterion(C_(ESD) criterion).Firstly,the effective solution to the URMOP problem is defined;then,by applying sequence relationship between the uncertain random variables,the UR-MOP problem is transformed into a single-objective program-ming(SOP)under uncertain random environment(URSOP),which are transformed into a deterministic counterpart based on the C_(ESD) criterion.Then the validity of the new approach is proved that the optimal solution to the SOP problem is also effi-cient for the URMOP problem;finally,a numerical example and a case application are presented to show the effectiveness of the new approach.展开更多
To improve the efficiency of gate reassignment and optimize the plan of gate reassignment,the concept of disruption management is introduced,and a multi-objective programming model for airport gate reassignment is pro...To improve the efficiency of gate reassignment and optimize the plan of gate reassignment,the concept of disruption management is introduced,and a multi-objective programming model for airport gate reassignment is proposed.Considering the interests of passengers and the airport,the model minimizes the total flight delay,the total passengers′walking distance and the number of flights reassigned to other gates different from the planned ones.According to the characteristics of the gate reassignment,the model is simplified.As the multi-objective programming model is hard to reach the optimal solutions simultaneously,a threshold of satisfactory solutions of the model is set.Then a simulated annealing algorithm is designed for the model.Case studies show that the model decreases the total flight delay to the satisfactory solutions,and minimizes the total passengers′walking distance.The least change of planned assignment is also reached.The results achieve the goals of disruption management.Therefore,the model is verified to be effective.展开更多
According to Hainan Island's biological characteristics, and existing structure of productivity of tropical crops and local climatic conditions, this paper carries on regional division of tropical crops by fuzzy m...According to Hainan Island's biological characteristics, and existing structure of productivity of tropical crops and local climatic conditions, this paper carries on regional division of tropical crops by fuzzy mathematics. Based on calculation of basic parameters for tl1e formation of production, near-tem optimum models of tropical crops structure of each region was established by means of multi-objective programming, and a far-term grey programming model was set up through the above-mentioned near-term model and prediction of future parameters. Conclusion shows that the near-term programming may raise the profit by 5. 1-55.7 percent and far-tem programming by 54-90 percent, both gainingobvious economic benefits.展开更多
This paper estimates the macroeconornic costs of CO2 emission reduction in China employing the input-output analysis with the multi-objective programming approach. The results show that the effect of reducing CO2 emis...This paper estimates the macroeconornic costs of CO2 emission reduction in China employing the input-output analysis with the multi-objective programming approach. The results show that the effect of reducing CO2 emissions on China＇s economy is significant. Under the present conditions, the estimated macroeconomic costs of CO2 emission reduction in 2010 for China are approximately 3,100-4,024 RMB t-1. The stronger the abatement actions, the higher the macroeconomic costs of per unit emission reduction would be. Excavation industry, oil industry, chemical industry, and metal smelting industry have high potential to abate their CO2 emissions.展开更多
In this paper, some necessary and sufficient optimality conditions are obtained for a fractional multiple objective programming involving semilocal E-convex and related functions. Also, some dual results are establish...In this paper, some necessary and sufficient optimality conditions are obtained for a fractional multiple objective programming involving semilocal E-convex and related functions. Also, some dual results are established under this kind of generalized convex functions. Our results generalize the ones obtained by Preda[J Math Anal Appl, 288（2003） 365-382].展开更多
This paper presents the Pareto solutions in continuous multi-objective mathematical programming. We discuss the role of some assumptions on the objective functions and feasible domain, the relationship between them, a...This paper presents the Pareto solutions in continuous multi-objective mathematical programming. We discuss the role of some assumptions on the objective functions and feasible domain, the relationship between them, and compactness, contractibility and fixed point properties of the Pareto sets. The authors have tried to remove the concavity assumptions on the objective functions which are usually used in multi-objective maximization problems. The results are based on constructing a retraction from the feasible domain onto the Pareto-optimal set.展开更多
In this paper, we shall be interested in characterization of efficient solutions for special classes of problems. These classes consider roughly B-invexity of involved functions. Sufficient and necessary conditions fo...In this paper, we shall be interested in characterization of efficient solutions for special classes of problems. These classes consider roughly B-invexity of involved functions. Sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are obtained.展开更多
In this paper, we address bilevel multi-objective programming problems (BMPP) in which the decision maker at each level has multiple objective functions conflicting with each other. Given a BMPP, we show how to constr...In this paper, we address bilevel multi-objective programming problems (BMPP) in which the decision maker at each level has multiple objective functions conflicting with each other. Given a BMPP, we show how to construct two artificial multiobjective programming problems such that any point that is efficient for both the two problems is an efficient solution of the BMPP. Some necessary and sufficient conditions for which the obtained result is applicable are provided. A complete procedure of the implementation of an algorithm for generating efficient solutions for the linear case of BMPP is presented. A numerical example is provided to illustrate how the algorithm operates.展开更多
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.展开更多
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.展开更多
In this paper, we consider a method of centers for solving multi-objective programming problems, where the objective functions involved are concave functions and the set of feasible points is convex. The algorithm is ...In this paper, we consider a method of centers for solving multi-objective programming problems, where the objective functions involved are concave functions and the set of feasible points is convex. The algorithm is defined so that the sub-problems that must be solved during its execution may be solved by finite-step procedures. Conditions are given under which the algorithm generates sequences of feasible points and constraint multiplier vectors that have accumulation points satisfying the KKT conditions. Finally, we establish convergence of the proposed method of centers algorithm for solving multiobjective programming problems.展开更多
An important decision for policy makers is selecting strategic petroleum reserve sites. However, policy makers may not choose the most suitable and efficient locations for strategic petroleum reserve（SPR） due to the...An important decision for policy makers is selecting strategic petroleum reserve sites. However, policy makers may not choose the most suitable and efficient locations for strategic petroleum reserve（SPR） due to the complexity in the choice of sites. This paper proposes a multi-objective programming model to determine the optimal locations for China＇s SPR storage sites. This model considers not only the minimum response time but also the minimum transportation cost based on a series of reasonable assumptions and constraint conditions. The factors influencing SPR sites are identified to determine potential demand points and candidate storage sites. Estimation and suggestions are made for the selection of China＇s future SPR storage sites based on the results of this model. When the number of petroleum storage sites is less than or equals 25 and the maximum capacity of storage sites is restricted to 10 million tonnes, the model＇s result best fit for the current layout scheme selected thirteen storage sites in four scenarios. Considering the current status of SPR in China,Tianjin, Qingdao, Dalian, Daqing and Zhanjiang, Chengdu,Xi＇an, and Yueyang are suggested to be the candidate locations for the third phase of the construction plan. The locations of petroleum storage sites suggested in this work could be used as a reference for decision makers.展开更多
Rural-urban land conversion is an inevitable phenomenon in urbanization arid industrialization. And the decision-making issue about this conversion is multi-objective because the social decision maker （the whole of c...Rural-urban land conversion is an inevitable phenomenon in urbanization arid industrialization. And the decision-making issue about this conversion is multi-objective because the social decision maker （the whole of central government and local authority） has to integrate the requirements of different interest groups （rural collective economic organizations, peasants, urban land users and the ones affected indirectly） and harmonize the sub-objects （economic, social and ecological outcomes） of this land allocation process. This paper established a multi-objective programming model for rural-urban land conversion decision-making and made some social welfare analysis correspondingly. Result shows that the general object of rural-urban land conversion decision-making is to reach the optimal level of social welfare in a certain state of resources allocation, while the preference of social decision makers and the value judgment of interest groups are two crucial factors which determine the realization of the rural-urban land conversion decision-making objects.展开更多
This paper proposes the concepts of generalized αk-major efficient solutions and generalized αk- major optimal solutions for multi-objective programming, and studies their some important properties.
The joint efficient ordering method is a fundamental method of ordering alternatives in group multi-objective programming problems. In this paper, the rational properties of the joint efficient mapping corresponding t...The joint efficient ordering method is a fundamental method of ordering alternatives in group multi-objective programming problems. In this paper, the rational properties of the joint efficient mapping corresponding to the joint efficient ordering method are studied, and some necessary conditions of this mapping are proven.展开更多
The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition...The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search efficiency.First,two update strategies based on decomposition are used to update the evolving population and external archive,respectively.Second,a multiselection strategy is designed.The first strategy is for the subspace without a non-dominated solution.Among the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global search.The second strategy is for the subspace with a non-dominated solution.In the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local search.The third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated solutions.In the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to search.Third,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search efficiency.Finally,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test problems.The results show that the proposed algorithm has better performance.展开更多
Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells c...Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells could be generated from adult mouse fibroblasts is powerful proof that cell fate can be changed.An exciting extension of the discovery of cell fate impermanence is the direct cellular reprogram ming hypothesis-that terminally differentiated cells can be reprogrammed into other adult cell fates without first passing through a stem cell state.展开更多
This paper introduces the Surrogate-assisted Multi-objective Grey Wolf Optimizer(SMOGWO)as a novel methodology for addressing the complex problem of empty-heavy train allocation,with a focus on line utilization balanc...This paper introduces the Surrogate-assisted Multi-objective Grey Wolf Optimizer(SMOGWO)as a novel methodology for addressing the complex problem of empty-heavy train allocation,with a focus on line utilization balance.By integrating surrogate models to approximate the objective functions,SMOGWO significantly improves the efficiency and accuracy of the optimization process.The effectiveness of this approach is evaluated using the CEC2009 multi-objective test function suite,where SMOGWO achieves a superiority rate of 76.67%compared to other leading multi-objective algorithms.Furthermore,the practical applicability of SMOGWO is demonstrated through a case study on empty and heavy train allocation,which validates its ability to balance line capacity,minimize transportation costs,and optimize the technical combination of heavy trains.The research highlights SMOGWO's potential as a robust solution for optimization challenges in railway transportation,offering valuable contributions toward enhancing operational efficiency and promoting sustainable development in the sector.展开更多
基金supported by the Public Welfare Industry Special Fund Project of the Ministry of Water Resources of China (Grant No. 200701028)the Humanities and Social Science Foundation Program of Hohai University (Grant No. 2008421411)
文摘The principal-subordinate hierarchical multi-objective programming model of initial water rights allocation was developed based on the principle of coordinated and sustainable development of different regions and water sectors within a basin. With the precondition of strictly controlling maximum emissions rights, initial water rights were allocated between the first and the second levels of the hierarchy in order to promote fair and coordinated development across different regions of the basin and coordinated and efficient water use across different water sectors, realize the maximum comprehensive benefits to the basin, promote the unity of quantity and quality of initial water rights allocation, and eliminate water conflict across different regions and water sectors. According to interactive decision-making theory, a principal-subordinate hierarchical interactive iterative algorithm based on the satisfaction degree was developed and used to solve the initial water rights allocation model. A case study verified the validity of the model.
基金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.
基金supported by the National Natural Science Foundation of China(72001213)the basic research program of Natural Science of Shaanxi Province,China(2021JQ-369).
文摘To overcome the defects that the traditional ap-proach for multi-objective programming under uncertain ran-dom environment(URMOP)neglects the randomness and uncer-tainty of the problem and the volatility of the results,a new ap-proach is proposed based on expected value-standard devi-ation value criterion(C_(ESD) criterion).Firstly,the effective solution to the URMOP problem is defined;then,by applying sequence relationship between the uncertain random variables,the UR-MOP problem is transformed into a single-objective program-ming(SOP)under uncertain random environment(URSOP),which are transformed into a deterministic counterpart based on the C_(ESD) criterion.Then the validity of the new approach is proved that the optimal solution to the SOP problem is also effi-cient for the URMOP problem;finally,a numerical example and a case application are presented to show the effectiveness of the new approach.
基金Supported by the National Natural Science Foundation of China(71103034)the Natural Science Foundation of Jiangsu Province(bk2011084)
文摘To improve the efficiency of gate reassignment and optimize the plan of gate reassignment,the concept of disruption management is introduced,and a multi-objective programming model for airport gate reassignment is proposed.Considering the interests of passengers and the airport,the model minimizes the total flight delay,the total passengers′walking distance and the number of flights reassigned to other gates different from the planned ones.According to the characteristics of the gate reassignment,the model is simplified.As the multi-objective programming model is hard to reach the optimal solutions simultaneously,a threshold of satisfactory solutions of the model is set.Then a simulated annealing algorithm is designed for the model.Case studies show that the model decreases the total flight delay to the satisfactory solutions,and minimizes the total passengers′walking distance.The least change of planned assignment is also reached.The results achieve the goals of disruption management.Therefore,the model is verified to be effective.
文摘According to Hainan Island's biological characteristics, and existing structure of productivity of tropical crops and local climatic conditions, this paper carries on regional division of tropical crops by fuzzy mathematics. Based on calculation of basic parameters for tl1e formation of production, near-tem optimum models of tropical crops structure of each region was established by means of multi-objective programming, and a far-term grey programming model was set up through the above-mentioned near-term model and prediction of future parameters. Conclusion shows that the near-term programming may raise the profit by 5. 1-55.7 percent and far-tem programming by 54-90 percent, both gainingobvious economic benefits.
基金supported by the National Natural Science Foundation of China under Grant Nos. 70825001 and 70941039
文摘This paper estimates the macroeconornic costs of CO2 emission reduction in China employing the input-output analysis with the multi-objective programming approach. The results show that the effect of reducing CO2 emissions on China＇s economy is significant. Under the present conditions, the estimated macroeconomic costs of CO2 emission reduction in 2010 for China are approximately 3,100-4,024 RMB t-1. The stronger the abatement actions, the higher the macroeconomic costs of per unit emission reduction would be. Excavation industry, oil industry, chemical industry, and metal smelting industry have high potential to abate their CO2 emissions.
基金Foundation item： Supported by Hunan Provincial Natural Science Foundation of China（05JJ40103） Supported by Soft Science Research Fund of Hunan Province（2006ZK3028） Supported by Scientific Research Fund of Hunan Provincial Education Department（105B0707, 08C470）
文摘In this paper, some necessary and sufficient optimality conditions are obtained for a fractional multiple objective programming involving semilocal E-convex and related functions. Also, some dual results are established under this kind of generalized convex functions. Our results generalize the ones obtained by Preda[J Math Anal Appl, 288（2003） 365-382].
文摘This paper presents the Pareto solutions in continuous multi-objective mathematical programming. We discuss the role of some assumptions on the objective functions and feasible domain, the relationship between them, and compactness, contractibility and fixed point properties of the Pareto sets. The authors have tried to remove the concavity assumptions on the objective functions which are usually used in multi-objective maximization problems. The results are based on constructing a retraction from the feasible domain onto the Pareto-optimal set.
文摘In this paper, we shall be interested in characterization of efficient solutions for special classes of problems. These classes consider roughly B-invexity of involved functions. Sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are obtained.
文摘In this paper, we address bilevel multi-objective programming problems (BMPP) in which the decision maker at each level has multiple objective functions conflicting with each other. Given a BMPP, we show how to construct two artificial multiobjective programming problems such that any point that is efficient for both the two problems is an efficient solution of the BMPP. Some necessary and sufficient conditions for which the obtained result is applicable are provided. A complete procedure of the implementation of an algorithm for generating efficient solutions for the linear case of BMPP is presented. A numerical example is provided to illustrate how the algorithm operates.
文摘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.
文摘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.
文摘In this paper, we consider a method of centers for solving multi-objective programming problems, where the objective functions involved are concave functions and the set of feasible points is convex. The algorithm is defined so that the sub-problems that must be solved during its execution may be solved by finite-step procedures. Conditions are given under which the algorithm generates sequences of feasible points and constraint multiplier vectors that have accumulation points satisfying the KKT conditions. Finally, we establish convergence of the proposed method of centers algorithm for solving multiobjective programming problems.
基金supported by the National Natural Science Foundation of China (Nos. 71273277/71373285/71303258)the Philosophy and Social Sciences Major Research Project of the Ministry of Education (No. 11JZD048)
文摘An important decision for policy makers is selecting strategic petroleum reserve sites. However, policy makers may not choose the most suitable and efficient locations for strategic petroleum reserve（SPR） due to the complexity in the choice of sites. This paper proposes a multi-objective programming model to determine the optimal locations for China＇s SPR storage sites. This model considers not only the minimum response time but also the minimum transportation cost based on a series of reasonable assumptions and constraint conditions. The factors influencing SPR sites are identified to determine potential demand points and candidate storage sites. Estimation and suggestions are made for the selection of China＇s future SPR storage sites based on the results of this model. When the number of petroleum storage sites is less than or equals 25 and the maximum capacity of storage sites is restricted to 10 million tonnes, the model＇s result best fit for the current layout scheme selected thirteen storage sites in four scenarios. Considering the current status of SPR in China,Tianjin, Qingdao, Dalian, Daqing and Zhanjiang, Chengdu,Xi＇an, and Yueyang are suggested to be the candidate locations for the third phase of the construction plan. The locations of petroleum storage sites suggested in this work could be used as a reference for decision makers.
基金an achievement of the NSFC (National Natural Science Foundation) project ‘Welfare Changes of Different Interest Groups and the Equilibrium of Their Welfare in the Process of Rural–urban Land Conversion (Grant No. 70773047)
文摘Rural-urban land conversion is an inevitable phenomenon in urbanization arid industrialization. And the decision-making issue about this conversion is multi-objective because the social decision maker （the whole of central government and local authority） has to integrate the requirements of different interest groups （rural collective economic organizations, peasants, urban land users and the ones affected indirectly） and harmonize the sub-objects （economic, social and ecological outcomes） of this land allocation process. This paper established a multi-objective programming model for rural-urban land conversion decision-making and made some social welfare analysis correspondingly. Result shows that the general object of rural-urban land conversion decision-making is to reach the optimal level of social welfare in a certain state of resources allocation, while the preference of social decision makers and the value judgment of interest groups are two crucial factors which determine the realization of the rural-urban land conversion decision-making objects.
文摘This paper proposes the concepts of generalized αk-major efficient solutions and generalized αk- major optimal solutions for multi-objective programming, and studies their some important properties.
基金The research is supported by National Natural Science Foundation of China under Grant No. 70071026 Science Foundation of Wenzhou University and Science Foundation of School of Mathematics and Information Science, Wenzhou University and Zhejiang Province Education Department Scientific Research Item.
文摘The joint efficient ordering method is a fundamental method of ordering alternatives in group multi-objective programming problems. In this paper, the rational properties of the joint efficient mapping corresponding to the joint efficient ordering method are studied, and some necessary conditions of this mapping are proven.
基金supported by National Natural Science Foundations of China(nos.12271326,62102304,61806120,61502290,61672334,61673251)China Postdoctoral Science Foundation(no.2015M582606)+2 种基金Industrial Research Project of Science and Technology in Shaanxi Province(nos.2015GY016,2017JQ6063)Fundamental Research Fund for the Central Universities(no.GK202003071)Natural Science Basic Research Plan in Shaanxi Province of China(no.2022JM-354).
文摘The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search efficiency.First,two update strategies based on decomposition are used to update the evolving population and external archive,respectively.Second,a multiselection strategy is designed.The first strategy is for the subspace without a non-dominated solution.Among the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global search.The second strategy is for the subspace with a non-dominated solution.In the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local search.The third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated solutions.In the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to search.Third,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search efficiency.Finally,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test problems.The results show that the proposed algorithm has better performance.
基金supported by Canada First Research Excellence Fund,Medicine by Design(to CMM)。
文摘Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells could be generated from adult mouse fibroblasts is powerful proof that cell fate can be changed.An exciting extension of the discovery of cell fate impermanence is the direct cellular reprogram ming hypothesis-that terminally differentiated cells can be reprogrammed into other adult cell fates without first passing through a stem cell state.
基金supported by the National Natural Science Foundation of China(Project No.5217232152102391)+2 种基金Sichuan Province Science and Technology Innovation Talent Project(2024JDRC0020)China Shenhua Energy Company Limited Technology Project(GJNY-22-7/2300-K1220053)Key science and technology projects in the transportation industry of the Ministry of Transport(2022-ZD7-132).
文摘This paper introduces the Surrogate-assisted Multi-objective Grey Wolf Optimizer(SMOGWO)as a novel methodology for addressing the complex problem of empty-heavy train allocation,with a focus on line utilization balance.By integrating surrogate models to approximate the objective functions,SMOGWO significantly improves the efficiency and accuracy of the optimization process.The effectiveness of this approach is evaluated using the CEC2009 multi-objective test function suite,where SMOGWO achieves a superiority rate of 76.67%compared to other leading multi-objective algorithms.Furthermore,the practical applicability of SMOGWO is demonstrated through a case study on empty and heavy train allocation,which validates its ability to balance line capacity,minimize transportation costs,and optimize the technical combination of heavy trains.The research highlights SMOGWO's potential as a robust solution for optimization challenges in railway transportation,offering valuable contributions toward enhancing operational efficiency and promoting sustainable development in the sector.
