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.展开更多
In this paper, a multi-objective particle swarm optimization （MOPSO） algorithm and a nondominated sorting genetic algorithm II （NSGA-II） are used to optimize the operating parameters of a 1.6 L, spark ignition （S...In this paper, a multi-objective particle swarm optimization （MOPSO） algorithm and a nondominated sorting genetic algorithm II （NSGA-II） are used to optimize the operating parameters of a 1.6 L, spark ignition （SI） gasoline engine. The aim of this optimization is to reduce engine emissions in terms of carbon monoxide （CO）, hydrocarbons （HC）, and nitrogen oxides （NOx）, which are the causes of diverse environmental problems such as air pollution and global warming. Stationary engine tests were performed for data generation, covering 60 operating conditions. Artificial neural networks （ANNs） were used to predict exhaust emissions, whose inputs were from six engine operating parameters, and the outputs were three resulting exhaust emissions. The outputs of ANNs were used to evaluate objective functions within the optimization algorithms： NSGA-II and MOPSO. Then a decision-making process was conducted, using a fuzzy method to select a Pareto solution with which the best emission reductions can be achieved. The NSGA-II algorithm achieved reductions of at least 9.84%, 82.44%, and 13.78% for CO, HC, and NOx, respectively. With a MOPSO algorithm the reached reductions were at least 13.68%, 83.80%, and 7.67% for CO, HC, and NOx, respectively.展开更多
This paper states a new metaheuristic based on Deterministic Finite Automata （DFA） for the multi - objective optimization of combinatorial problems. First, a new DFA named Multi - Objective Deterministic Finite Auto...This paper states a new metaheuristic based on Deterministic Finite Automata （DFA） for the multi - objective optimization of combinatorial problems. First, a new DFA named Multi - Objective Deterministic Finite Automata （MDFA） is defined. MDFA allows the representation of the feasible solutions space of combinatorial problems. Second, it is defined and implemented a metaheuritic based on MDFA theory. It is named Metaheuristic of Deterministic Swapping （MODS）. MODS is a local search strategy that works using a MDFA. Due to this, MODS never take into account unfeasible solutions. Hence, it is not necessary to verify the problem constraints for a new solution found. Lastly, MODS is tested using well know instances of the Bi-Objective Traveling Salesman Problem （TSP） from TSPLIB. Its results were compared with eight Ant Colony inspired algorithms and two Genetic algorithms taken from the specialized literature. The comparison was made using metrics such as Spacing, Generational Distance, Inverse Generational Distance and No-Dominated Generation Vectors. In every case, the MODS results on the metrics were always better and in some of those cases, the superiority was 100%.展开更多
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].展开更多
Besides economics and controllability, waste minimization has now become an objective in designing chemical processes, and usually leads to high costs of investment and operation. An attempt was made to minimize waste...Besides economics and controllability, waste minimization has now become an objective in designing chemical processes, and usually leads to high costs of investment and operation. An attempt was made to minimize waste discharged from chemical reaction processes during the design and modification process while the operation conditions were also optimized to meet the requirements of technology and economics. Multiobjectives decision nonlinear programming (NLP) was employed to optimize the operation conditions of a chemical reaction process and reduce waste. A modeling language package-SPEEDUP was used to simulate the process. This paper presents a case study of the benzene production process. The flowsheet factors affecting the economics and waste generation were examined. Constraints were imposed to reduce the number of objectives and carry out optimal calculations easily. After comparisons of all possible solutions, best-compromise approach was applied to meet technological requirements and minimize waste.展开更多
To performance efficient searching for an operator-supervised mobile robot, a multiple objectives route planning approach is proposed considering timeliness and path cost. An improved fitness function for route planni...To performance efficient searching for an operator-supervised mobile robot, a multiple objectives route planning approach is proposed considering timeliness and path cost. An improved fitness function for route planning is proposed based on the multi-objective genetic algorithm （MOGA） for multiple objectives traveling salesman problem （MOTSP）. Then, the path between two route nodes is generated based on the heuristic path planning method A ＊. A simplified timeliness function for route nodes is proposed to represent the timeliness of each node. Based on the proposed timeliness function, experiments are conducted using the proposed two-stage planning method. The experimental results show that the proposed MOGA with improved fitness function can perform the searching function well when the timeliness of the searching task needs to be taken into consideration.展开更多
Cutting parameters have a significant impact on the machining effect.In order to reduce the machining time and improve the machining quality,this paper proposes an optimization algorithm based on Bp neural networkImpr...Cutting parameters have a significant impact on the machining effect.In order to reduce the machining time and improve the machining quality,this paper proposes an optimization algorithm based on Bp neural networkImproved Multi-Objective Particle Swarm(Bp-DWMOPSO).Firstly,this paper analyzes the existing problems in the traditional multi-objective particle swarm algorithm.Secondly,the Bp neural network model and the dynamic weight multi-objective particle swarm algorithm model are established.Finally,the Bp-DWMOPSO algorithm is designed based on the established models.In order to verify the effectiveness of the algorithm,this paper obtains the required data through equal probability orthogonal experiments on a typical Computer Numerical Control(CNC)turning machining case and uses the Bp-DWMOPSO algorithm for optimization.The experimental results show that the Cutting speed is 69.4 mm/min,the Feed speed is 0.05 mm/r,and the Depth of cut is 0.5 mm.The results show that the Bp-DWMOPSO algorithm can find the cutting parameters with a higher material removal rate and lower spindle load while ensuring the machining quality.This method provides a new idea for the optimization of turning machining parameters.展开更多
Using generalized univex functions, a nondifferentiable multiple-objective optimization problem is considered.Kuhn-Tucker type sufficient optimality conditions are obtained for a feasible point to be an efficient or p...Using generalized univex functions, a nondifferentiable multiple-objective optimization problem is considered.Kuhn-Tucker type sufficient optimality conditions are obtained for a feasible point to be an efficient or properly efficient solution. Mond-Weir type duality programming is constructed,the weak and strong duality theorems are proved.展开更多
With the development of the economic and low⁃carbon society,high⁃performance building(HPB)design plays an increasingly important role in the architectural area.The performance of buildings usually includes the buildin...With the development of the economic and low⁃carbon society,high⁃performance building(HPB)design plays an increasingly important role in the architectural area.The performance of buildings usually includes the building energy consumption,building interior natural daylighting,building surface solar radiation,and so on.Building performance simulation(BPS)and multiple objective optimizations(MOO)are becoming the main methods for obtaining a high performance building in the design process.Correspondingly,the BPS and MOO are based on the parametric tools,like Grasshopper and Dynamo.However,these tools are lacking the data analysis module for designers to select the high⁃performance building more conveniently.This paper proposes a toolkit“GPPre”developed based on the Grasshopper platform and Python language.At the end of this paper,a case study was conducted to verify the function of GPPre,which shows that the combination of the sensitivity analysis(SA)and MOO module in the GPPre could aid architects to design the buildings with better performance.展开更多
Land use structural optimization is an effective approach to realize land sustainable utilization and allocate limited land resource rationally.Grey multiple objectives programming(GMOP)model based on China terrestria...Land use structural optimization is an effective approach to realize land sustainable utilization and allocate limited land resource rationally.Grey multiple objectives programming(GMOP)model based on China terrestrial ecosystem service value was constructed and applied to Lilin town.The result shows that GMOP model has more practical applicability and takes ecologic,social and comprehensive benefit into consideration.There are three programs after optimization.ProgramⅠis comprehensive improvement and constructing ecological economy type,programⅡis gross cultivated land dynamic balance type and programⅢis compromise type.There are still problems in programsⅡandⅢ,such as distribution in disorder,land left unused or abandoned.Based on the benefits above,ProgramⅠ>ProgramⅢ>ProgramⅡ.ProgramⅠis the optimal case.Its comprehensive benefit is 8.43208×107 RMB yuan/a.展开更多
A fuzzy multi-objective bi-level optimization problem is proposed to model the planning of energy storage system(ESS) in active distribution systems(ADS). The proposed model enables us to take into account how optimal...A fuzzy multi-objective bi-level optimization problem is proposed to model the planning of energy storage system(ESS) in active distribution systems(ADS). The proposed model enables us to take into account how optimal operation strategy of ESS in the lower level can affect and be affected by the optimal allocation of ESS in the upper level. The power characteristic model of micro-grid(MG)and typical daily scenarios are established to take full consideration of time-variable nature of renewable energy generations(REGs) and load demand while easing the burden of computation. To solve the bi-level mixed integer problem, a multi-subgroup hierarchical chaos hybrid algorithm is introduced based on differential evolution(DE) and particle swarm optimization(PSO). The modified IEEE-33 bus benchmark distribution system is utilized to investigate the availability and effectiveness of the proposed model and the hybrid algorithm. Results indicate that the planningmodel gives an adequate consideration to the optimal operation and different roles of ESS, and has the advantages of objectiveness and reasonableness.展开更多
To expand mission capabilities needed without a proportional increase in cost or risk for exploration of the solar system,the multiple objective trajectory using low-thrust propulsion and gravity-assist technique is c...To expand mission capabilities needed without a proportional increase in cost or risk for exploration of the solar system,the multiple objective trajectory using low-thrust propulsion and gravity-assist technique is considered.However,low-thrust,gravity-assist trajectories pose significant optimization challenges because of their large design space.Here,the planets are selected as primal scientific mission goals,while the asteroids are selected as secondary scientific mission goals,and a global trajectory optimization problem is introduced and formulated.This multi-objective decision making process is transformed into a bi-level programming problem,where the targets like planets with small subsamples but high weight are optimized in up level,and targets like asteroids with large subsamples but low weight are optimized in down level.Then,the selected solutions for bi-level programming are optimized thanks to a cooperative Differential Evolution(DE) algorithm that is developed from the original DE algorithm;in addition,an sequential quadratic programming(SQP) method is used in low-thrust optimization.This solution approach is successfully applied to the simulation case of the multi-objective trajectory design problem.The results obtained are presented and discussed.展开更多
In this paper we use a compromise approach to identify a lexicographic optimal solution of a multiple objective programming (MOP) problem. With this solution concept, we first find the maximization of each objection f...In this paper we use a compromise approach to identify a lexicographic optimal solution of a multiple objective programming (MOP) problem. With this solution concept, we first find the maximization of each objection function as the ideal value. Then, we construct a lexicographic order for the compromise (differences) between the ideal values and objective functions. Based on the usually lexicographic optimality structure, we discuss some theoretical properties about our approach and derive a constructing algorithm to compute such a lexicographic optimal solution.展开更多
文摘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.
文摘In this paper, a multi-objective particle swarm optimization （MOPSO） algorithm and a nondominated sorting genetic algorithm II （NSGA-II） are used to optimize the operating parameters of a 1.6 L, spark ignition （SI） gasoline engine. The aim of this optimization is to reduce engine emissions in terms of carbon monoxide （CO）, hydrocarbons （HC）, and nitrogen oxides （NOx）, which are the causes of diverse environmental problems such as air pollution and global warming. Stationary engine tests were performed for data generation, covering 60 operating conditions. Artificial neural networks （ANNs） were used to predict exhaust emissions, whose inputs were from six engine operating parameters, and the outputs were three resulting exhaust emissions. The outputs of ANNs were used to evaluate objective functions within the optimization algorithms： NSGA-II and MOPSO. Then a decision-making process was conducted, using a fuzzy method to select a Pareto solution with which the best emission reductions can be achieved. The NSGA-II algorithm achieved reductions of at least 9.84%, 82.44%, and 13.78% for CO, HC, and NOx, respectively. With a MOPSO algorithm the reached reductions were at least 13.68%, 83.80%, and 7.67% for CO, HC, and NOx, respectively.
文摘This paper states a new metaheuristic based on Deterministic Finite Automata （DFA） for the multi - objective optimization of combinatorial problems. First, a new DFA named Multi - Objective Deterministic Finite Automata （MDFA） is defined. MDFA allows the representation of the feasible solutions space of combinatorial problems. Second, it is defined and implemented a metaheuritic based on MDFA theory. It is named Metaheuristic of Deterministic Swapping （MODS）. MODS is a local search strategy that works using a MDFA. Due to this, MODS never take into account unfeasible solutions. Hence, it is not necessary to verify the problem constraints for a new solution found. Lastly, MODS is tested using well know instances of the Bi-Objective Traveling Salesman Problem （TSP） from TSPLIB. Its results were compared with eight Ant Colony inspired algorithms and two Genetic algorithms taken from the specialized literature. The comparison was made using metrics such as Spacing, Generational Distance, Inverse Generational Distance and No-Dominated Generation Vectors. In every case, the MODS results on the metrics were always better and in some of those cases, the superiority was 100%.
基金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].
文摘Besides economics and controllability, waste minimization has now become an objective in designing chemical processes, and usually leads to high costs of investment and operation. An attempt was made to minimize waste discharged from chemical reaction processes during the design and modification process while the operation conditions were also optimized to meet the requirements of technology and economics. Multiobjectives decision nonlinear programming (NLP) was employed to optimize the operation conditions of a chemical reaction process and reduce waste. A modeling language package-SPEEDUP was used to simulate the process. This paper presents a case study of the benzene production process. The flowsheet factors affecting the economics and waste generation were examined. Constraints were imposed to reduce the number of objectives and carry out optimal calculations easily. After comparisons of all possible solutions, best-compromise approach was applied to meet technological requirements and minimize waste.
基金Supported by the National Natural Science Foundation of China(9112001591120010)
文摘To performance efficient searching for an operator-supervised mobile robot, a multiple objectives route planning approach is proposed considering timeliness and path cost. An improved fitness function for route planning is proposed based on the multi-objective genetic algorithm （MOGA） for multiple objectives traveling salesman problem （MOTSP）. Then, the path between two route nodes is generated based on the heuristic path planning method A ＊. A simplified timeliness function for route nodes is proposed to represent the timeliness of each node. Based on the proposed timeliness function, experiments are conducted using the proposed two-stage planning method. The experimental results show that the proposed MOGA with improved fitness function can perform the searching function well when the timeliness of the searching task needs to be taken into consideration.
文摘Cutting parameters have a significant impact on the machining effect.In order to reduce the machining time and improve the machining quality,this paper proposes an optimization algorithm based on Bp neural networkImproved Multi-Objective Particle Swarm(Bp-DWMOPSO).Firstly,this paper analyzes the existing problems in the traditional multi-objective particle swarm algorithm.Secondly,the Bp neural network model and the dynamic weight multi-objective particle swarm algorithm model are established.Finally,the Bp-DWMOPSO algorithm is designed based on the established models.In order to verify the effectiveness of the algorithm,this paper obtains the required data through equal probability orthogonal experiments on a typical Computer Numerical Control(CNC)turning machining case and uses the Bp-DWMOPSO algorithm for optimization.The experimental results show that the Cutting speed is 69.4 mm/min,the Feed speed is 0.05 mm/r,and the Depth of cut is 0.5 mm.The results show that the Bp-DWMOPSO algorithm can find the cutting parameters with a higher material removal rate and lower spindle load while ensuring the machining quality.This method provides a new idea for the optimization of turning machining parameters.
基金Shandong Science Development Plan Foundation ( NO.JOOP 55)
文摘Using generalized univex functions, a nondifferentiable multiple-objective optimization problem is considered.Kuhn-Tucker type sufficient optimality conditions are obtained for a feasible point to be an efficient or properly efficient solution. Mond-Weir type duality programming is constructed,the weak and strong duality theorems are proved.
文摘With the development of the economic and low⁃carbon society,high⁃performance building(HPB)design plays an increasingly important role in the architectural area.The performance of buildings usually includes the building energy consumption,building interior natural daylighting,building surface solar radiation,and so on.Building performance simulation(BPS)and multiple objective optimizations(MOO)are becoming the main methods for obtaining a high performance building in the design process.Correspondingly,the BPS and MOO are based on the parametric tools,like Grasshopper and Dynamo.However,these tools are lacking the data analysis module for designers to select the high⁃performance building more conveniently.This paper proposes a toolkit“GPPre”developed based on the Grasshopper platform and Python language.At the end of this paper,a case study was conducted to verify the function of GPPre,which shows that the combination of the sensitivity analysis(SA)and MOO module in the GPPre could aid architects to design the buildings with better performance.
基金Project(2006BAJ05A14)supported by the National Science and Technology Pillar Program During the 11th Five-year Plan Period,ChinaProject(112400430057)supported by the Soft Science Research Program of Henan Province,ChinaProject(B2010-87)supported by the Foundation for Doctorate Research of Henan Polytechnic University,China
文摘Land use structural optimization is an effective approach to realize land sustainable utilization and allocate limited land resource rationally.Grey multiple objectives programming(GMOP)model based on China terrestrial ecosystem service value was constructed and applied to Lilin town.The result shows that GMOP model has more practical applicability and takes ecologic,social and comprehensive benefit into consideration.There are three programs after optimization.ProgramⅠis comprehensive improvement and constructing ecological economy type,programⅡis gross cultivated land dynamic balance type and programⅢis compromise type.There are still problems in programsⅡandⅢ,such as distribution in disorder,land left unused or abandoned.Based on the benefits above,ProgramⅠ>ProgramⅢ>ProgramⅡ.ProgramⅠis the optimal case.Its comprehensive benefit is 8.43208×107 RMB yuan/a.
基金supported by Application Technology Research and Engineering Demonstration Program of National Energy Administration in China (No. NY20150301)
文摘A fuzzy multi-objective bi-level optimization problem is proposed to model the planning of energy storage system(ESS) in active distribution systems(ADS). The proposed model enables us to take into account how optimal operation strategy of ESS in the lower level can affect and be affected by the optimal allocation of ESS in the upper level. The power characteristic model of micro-grid(MG)and typical daily scenarios are established to take full consideration of time-variable nature of renewable energy generations(REGs) and load demand while easing the burden of computation. To solve the bi-level mixed integer problem, a multi-subgroup hierarchical chaos hybrid algorithm is introduced based on differential evolution(DE) and particle swarm optimization(PSO). The modified IEEE-33 bus benchmark distribution system is utilized to investigate the availability and effectiveness of the proposed model and the hybrid algorithm. Results indicate that the planningmodel gives an adequate consideration to the optimal operation and different roles of ESS, and has the advantages of objectiveness and reasonableness.
基金supported by the Open Research Foundation of Science and Technology on Aerospace Flight Dynamics Laboratory of China (Grant No. 2012afdl005)
文摘To expand mission capabilities needed without a proportional increase in cost or risk for exploration of the solar system,the multiple objective trajectory using low-thrust propulsion and gravity-assist technique is considered.However,low-thrust,gravity-assist trajectories pose significant optimization challenges because of their large design space.Here,the planets are selected as primal scientific mission goals,while the asteroids are selected as secondary scientific mission goals,and a global trajectory optimization problem is introduced and formulated.This multi-objective decision making process is transformed into a bi-level programming problem,where the targets like planets with small subsamples but high weight are optimized in up level,and targets like asteroids with large subsamples but low weight are optimized in down level.Then,the selected solutions for bi-level programming are optimized thanks to a cooperative Differential Evolution(DE) algorithm that is developed from the original DE algorithm;in addition,an sequential quadratic programming(SQP) method is used in low-thrust optimization.This solution approach is successfully applied to the simulation case of the multi-objective trajectory design problem.The results obtained are presented and discussed.
文摘In this paper we use a compromise approach to identify a lexicographic optimal solution of a multiple objective programming (MOP) problem. With this solution concept, we first find the maximization of each objection function as the ideal value. Then, we construct a lexicographic order for the compromise (differences) between the ideal values and objective functions. Based on the usually lexicographic optimality structure, we discuss some theoretical properties about our approach and derive a constructing algorithm to compute such a lexicographic optimal solution.
