基于CAIV 的机械产品设计方案费效权衡优化

针对民用机械产品设计方案选择时,既要考虑客户对产品的功能需求,又要符合企业费用目标约束的问题,采用基于以费用为独立变量(CAIV)的费效权衡优化方法,以混凝土泵车系列产品为研究对象,运用主成分回归和层次分析(AHP)方法分别构建生命周期费用和效能模型,并以费效比为优化目标权衡得到最优方案.研究表明,采用CAIV费效权衡方法选择的设计方案,可以实现产品全生命周期成本目标的有效控制.     

油田措施配置的随机机会约束规划模型

以油田措施增产最大化为目标,兼顾成本、措施量等目标,建立了油田措施配置的随机机会约束规划模型,并给出了模型的混合智能算法。实例表明,该模型理论基础严格,求解方法科学有效,并具有一定的智能性,为油田措施配置提供了新的决策依据。     

含有模糊和随机参数的混合机会约束规划模型

提出一类混合机会约束规划模型，该模型同时含有模糊和随机参数，运用随机模拟与模糊模拟相结合的技术，给出了求解该机会约束规划模型的遗传算法，通过对生产过程最优化决策的典型问题进行分析建模和数值求解，说明了该模型和算法的合理性和有效性。     

求解随机机会约束规划的混合智能算法

随机机会约束规划是一类有着广泛应用背景的随机规划问题,采用随机仿真产生样本训练BP网络以逼近随机函数,然后在微粒群算法中利用神经网络计算适应值和实现检验解的可行性,从而提出了一种求解随机机会约束规划的混合智能算法。最后通过两个实例的仿真结果说明了算法的正确性和有效性。     

基于随机模拟与PSO算法相结合的随机机会约束规划算法

随机机会约束规划作为一类重要的随机规划,广泛存在于许多领域中.为了寻找更有效的求解随机机会约束规划的算法,通过采用随机模拟来逼近随机函数,并在微粒群算法PSO(Particle Swarm Optimization)中利用随机模拟实现估计适应值和检验解的可行性,从而给出了求解随机机会约束规划的新算法,最后,测试其性能并与遗传算法进行了比较,实例结果表明该算法的正确性和有效性.     

求解随机机会约束规划的混合智能算法及应用

为更有效地求解随机机会约束规划问题,提出一种基于克隆选择算法(CSA)、随机模拟技术及神经网络的混合智能算法。采用随机模拟技术产生随机变量样本矩阵训练反向传播(BP)网络以逼近不确定函数,之后在CSA中利用神经网络检验个体的可行性、计算适应度,从而得到优化问题的最优解。为保证算法搜索的快速性和有效性,CSA采用双克隆和双变异策略。仿真结果表明,与已有算法相比,混合智能算法在500代时已取得比较满意的结果,且其精度在单目标优化问题中提高了2.2%,在多目标优化问题中提高了65%;将该算法应用于求解水库优化调度的难题上,结果也表明所建立的模型及算法的可行性和有效性。     

托盘共用系统调度两阶段随机机会约束规划模型研究

根据托盘共用系统调度的特点,建立了以托盘共用系统调度总成本最小为目标的两阶段随机机会约束规划模型．该模型综合考虑了需求随机、供给随机、运输能力随机、装卸能力随机等因素;采用机会约束规划方法对模型进行了确定性等价转换;通过算例进行了数值求解和数值分析,验证了模型的可行性和有效性．     

产品开发方案优化的模糊机会约束规划模型及求解

为解决项目网络计划中产品开发方案的时间、成本、质量的不确定优化问题,在模糊机会约束规划的框架下分别建立了基于关键路线的项目周期优化模型、基于资源使用的项目周期-成本优化模型和基于质量功能展开(QFD)的产品周期-质量优化模型,在此基础上构建了项目周期-成本-质量多目标优化模型;在使用模糊模拟技术处理3个目标函数约束的过程中,构建了一个基于遗憾度的适应度函数,然后利用离散微粒群算法对多目标优化模型进行求解.最后,以滚珠丝杆副产品开发项目的方案优化为例验证了文中模型的合理性和算法的有效性;实验结果表明,周期-成本-质量多目标优化模型的求解得到的方案能够取得时间、成本和质量的平衡优化,为产品开发项目的规划提供了定量、可靠的决策依据.     

应用带补偿的机会约束规划策略优化精馏过程的研究

精馏过程优化存在许多不确定变量,其对优化结果的影响是不可忽略的,所以需要找到真实反映不确定变最的数学模型,找到最优的求解方法得到精确解,进而得到最优的优化结果.本研究通过分析随机规划策略和不确定因素的特性及其对精馏优化过程的影响,对不确定因素进行分类,应用带补偿的随机规划和机会约束规划实现不确定因素对优化目标和约束的影响.对于模型中的机会约束,由于不确定输入变量和不确定输出变量间存在单调关系,所以可以通过对不确定输入变量的多重积分将机会约束转化为等价地确定性非线性约束,此时模型转化为含有非线性约束的带补偿的随机规划模型,此模型通过改进的蒙特卡罗(Monte Carlo)积分和含有序列2次规划(SQP)的Benders分解相结合的混合算法有效的求解.所提出的求解方法借助于Matlab软件能够得到比较精确的结果.采用本文所提出的模型及求解方法对精馏塔操作的模拟实验过程进行优化研究,可以看出带补偿的机会约束规划模型能够很好地反映不确定变量对优化过程的影响.所以本文提出的模型和求解方法是有效可行的,且对于以后的不确定优化研究具有很好的指导意义.     

求解随机相关机会规划的有效算法

随机相关机会规划作为一类重要的随机规划,存在于许多领域中.为了寻找更为有效的求解随机相关机会规划的算法,采用随机仿真来逼近机会函数,在微粒群算法中利用随机仿真估计适应值,提出一种将随机仿真与微粒群算法相结合的随机相关机会规划算法.通过实例仿真测试该算法的性能,并与遗传算法进行比较,结果表明本算法具有一定的优势.     

Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation

Hazardous materials transportation is an important and hot issue of public safety. Based on the shortest path model, this paper presents a fuzzy multi-objective programming model that minimizes the transportation risk to life, travel time and fuel consumption. First, we present the risk model, travel time model and fuel consumption model. Furthermore, we formulate a chance-constrained programming model within the framework of credibility theory, in which the lengths of arcs in the transportation network are assumed to be fuzzy variables. A hybrid intelligent algorithm integrating fuzzy simulation and genetic algorithm is designed for finding a satisfactory solution. Finally, some numerical examples are given to demonstrate the efficiency of the proposed model and algorithm.     

Adaptive sampling immune algorithm solving joint chance-constrained programming

This work investigates one immune optimization algorithm in uncertain environments, solving linear or nonlinear joint chance-constrained programming with a general distribution of the random vector. In this algorithm, an a priori lower bound estimate is developed to deal with one joint chance constraint, while the scheme of adaptive sampling is designed to make empirically better antibodies in the current population acquire larger sample sizes in terms of our sample-allocation rule. Relying upon several simplified immune metaphors in the immune system, we design two immune operators of dynamic proliferation and adaptive mutation. The first picks up those diverse antibodies to achieve proliferation according to a dynamical suppression radius index, which can ensure empirically potential antibodies more clones, and reduce noisy influence to the optimized quality, and the second is a module of genetic diversity, which exploits those valuable regions and finds those diverse and excellent antibodies. Theoretically, the proposed approach is demonstrated to be convergent. Experimentally, the statistical results show that the approach can obtain satisfactory performances including the optimized quality, noisy suppression and efficiency.     

再制造/制造系统集成物流网络模糊机会约束规划模型

在再制造/制造(R/M)系统集成物流网络中,回收产品的数量具有不确定性.根据这一特点,将各消费区域废旧产品的回收数量看成是模糊参数,提出了该集成物流网络的模糊机会约束规划模型.通过把模型中模糊机会约束清晰化,将模型转化为确定性的混合整数规划模型.利用实例数据,针对不同的置信水平对模型进行分析,其结果为该集成物流网络的设计提供了依据.     

考虑混合型号托盘的托盘共用调度随机规划模型

如何将托盘科学地在系统内调度是目前托盘共用系统管理者们亟待解决的问题。面对各类参数的随机性和多种多样的托盘,管理者很难仅凭经验做出科学的决策。利用随机机会约束规划的方法,构建了考虑混合型号托盘的托盘共用系统调度随机规划模型,使用确定性等价转化的方法将机会约束转化为了其确定等价形式,通过算例进行了数值求解和分析,验证了模型的有效性,提出了决策策略建议。     

Genetic algorithm-based fuzzy goal programming for class of chance-constrained programming problems

This paper presents a procedure for solving a multiobjective chance-constrained programming problem. Random variables appearing on both sides of the chance constraint are considered as discrete random variables with a known probability distribution. The literature does not contain any deterministic equivalent for solving this type of problem. Therefore, classical multiobjective programming techniques are not directly applicable. In this paper, we use a stochastic simulation technique to handle randomness in chance constraints. A fuzzy goal programming formulation is developed by using a stochastic simulation-based genetic algorithm. The most satisfactory solution is obtained from the highest membership value of each of the membership goals. Two numerical examples demonstrate the feasibility of the proposed approach.     

碳税政策下的班轮船队随机规划及模型价值

针对已经存在的集装箱班轮运输企业,研究其在碳税不确定情景下的船队规划问题,以辅助企业作出风险中立决策,避免碳税不确定性可能给企业带来的极端风险。利用二维情景树描述碳税实施时间和税率的未来情景,采用随机规划方法建立考虑此碳税结构的船队规划模型,加入不可预见性约束条件以保证决策步骤与碳税情景结构一致。从行业搜集数据并设计算例,实验结果表明该模型能够求解实际问题,其决策过程能灵活地根据碳税实现情景进行阶段性调整。通过与同样情景下的确定性模型决策结果相比较,发现本随机模型能实现更高的船队营运收益和更低的船队碳排放量。     

Optimizing modular product design for reconfigurable manufacturing

The problem of optimizing modular products in a reconfigurable manufacturing system is addressed. The problem is first posed as a generalized subset selection problem where the best subsets of module instances of unknown sizes are determined by minimizing an objective function that represents a trade-off between the quality loss due to modularization and the cost of reconfiguration while satisfying the problem constraints. The problem is then formulated and solved as an integer nonlinear programming problem with binary variables. The proposed method is applied to the production of a modular drive system composed of a DC motor and a ball screw. The study is a first attempt toward developing a systematic methodology for manufacturing modular products in a reconfigurable manufacturing system.     

Solution of Nonconvex Nonsmooth Stochastic Optimization Problems

Different classes of nonconvex nonsmooth stochastic optimization problems are analyzed, their generalized differentiability properties and necessary optimality conditions are studied, and a technique for calculating stochastic gradients is developed. For each class of the problems, corresponding solution methods are proposed, in particular, generalizations of the stochastic quasigradient method.