An extended crowding genetic algorithm (ECGA) is introduced for solvingoptimal pump configuration problem, which was presented by T. Westerlund in 1994. This problem hasbeen found to be non-convex, and the objective f...An extended crowding genetic algorithm (ECGA) is introduced for solvingoptimal pump configuration problem, which was presented by T. Westerlund in 1994. This problem hasbeen found to be non-convex, and the objective function contained several local optima and globaloptimality could not be ensured by all the traditional MINLP optimization method. The concepts ofspecies conserving and composite encoding are introduced to crowding genetic algorithm (CGA) formaintain the diversity of population more effectively and coping with the continuous and/or discretevariables in MINLP problem. The solution of three-levels pump configuration got from DICOPT++software (OA algorithm) is also given. By comparing with the solutions obtained from DICOPT++, ECPmethod, and MIN-MIN method, the ECGA algorithm proved to be very effective in finding the globaloptimal solution of multi-levels pump configuration via using the problem-specific information.展开更多
The purpose of this paper is to study the approximate optimality condition for composite convex optimization problems with a cone-convex system in locally convex spaces,where all functions involved are not necessaril...The purpose of this paper is to study the approximate optimality condition for composite convex optimization problems with a cone-convex system in locally convex spaces,where all functions involved are not necessarily lower semicontinuous.By using the properties of the epigraph of conjugate functions,we introduce a new regularity condition and give its equivalent characterizations.Under this new regularity condition,we derive necessary and sufficient optimality conditions ofε-optimal solutions for the composite convex optimization problem.As applications of our results,we derive approximate optimality conditions to cone-convex optimization problems.Our results extend or cover many known results in the literature.展开更多
使用量子粒子群优化算法(QPSO),将可能的Web服务工作流执行路径看作粒子,按照QPSO算法进行进化,从而解决了基于服务质量(Quality of Service,QoS)约束的Web服务组合问题,此为解决Web服务组合问题提出了一种新的思路.实验表明,使用QPSO...使用量子粒子群优化算法(QPSO),将可能的Web服务工作流执行路径看作粒子,按照QPSO算法进行进化,从而解决了基于服务质量(Quality of Service,QoS)约束的Web服务组合问题,此为解决Web服务组合问题提出了一种新的思路.实验表明,使用QPSO算法求解复杂Web服务组合问题在组合时间上具有一定的优越性.展开更多
基金This project is supported by Provincial Science Foundation of Hebei (No.01213553).
文摘An extended crowding genetic algorithm (ECGA) is introduced for solvingoptimal pump configuration problem, which was presented by T. Westerlund in 1994. This problem hasbeen found to be non-convex, and the objective function contained several local optima and globaloptimality could not be ensured by all the traditional MINLP optimization method. The concepts ofspecies conserving and composite encoding are introduced to crowding genetic algorithm (CGA) formaintain the diversity of population more effectively and coping with the continuous and/or discretevariables in MINLP problem. The solution of three-levels pump configuration got from DICOPT++software (OA algorithm) is also given. By comparing with the solutions obtained from DICOPT++, ECPmethod, and MIN-MIN method, the ECGA algorithm proved to be very effective in finding the globaloptimal solution of multi-levels pump configuration via using the problem-specific information.
基金the National Natural Science Foundation of China(Nos.11471059,11301571,and 11301570)the Chongqing Research Program of Basic Research and Frontier Technology(Nos.cstc2014jcyjA00037,cstc2015jcyjB00001,cstc2015jcyjA00025,and cstc2015jcyjA00002)+2 种基金the Education Committee Project Research Foundation of Chongqing(Nos.KJ1400618 and KJ1500626)the Postdoctoral Science Foundation of China(Nos.2015M580774 and 2016T90837)the Program for University Innovation Team of Chongqing(CXTDX201601026 and CXTDX201601022).
文摘The purpose of this paper is to study the approximate optimality condition for composite convex optimization problems with a cone-convex system in locally convex spaces,where all functions involved are not necessarily lower semicontinuous.By using the properties of the epigraph of conjugate functions,we introduce a new regularity condition and give its equivalent characterizations.Under this new regularity condition,we derive necessary and sufficient optimality conditions ofε-optimal solutions for the composite convex optimization problem.As applications of our results,we derive approximate optimality conditions to cone-convex optimization problems.Our results extend or cover many known results in the literature.
文摘使用量子粒子群优化算法(QPSO),将可能的Web服务工作流执行路径看作粒子,按照QPSO算法进行进化,从而解决了基于服务质量(Quality of Service,QoS)约束的Web服务组合问题,此为解决Web服务组合问题提出了一种新的思路.实验表明,使用QPSO算法求解复杂Web服务组合问题在组合时间上具有一定的优越性.
