An engineering method for complex structural optimization involving both size and topology design variables

This work presents an engineering method for optimizing structures made of bars, beams, plates, or a combination of those components. Corresponding problems involve both continuous (size) and discrete (topology) variables. Using a branched multipoint approximate function, which involves such mixed variables, a series of sequential approximate problems are constructed to make the primal problem explicit. To solve the approximate problems, genetic algorithm (GA) is utilized to optimize discrete variables, and when calculating individual fitness values in GA, a second-level approximate problem only involving retained continuous variables is built to optimize continuous variables. The solution to the second-level approximate problem can be easily obtained with dual methods. Structural analyses are only needed before improving the branched approximate functions in the iteration cycles. The method aims at optimal design of discrete structures consisting of bars, beams, plates, or other components. Numerical examples are given to illustrate its effectiveness, including frame topology optimization, layout optimization of stiffeners modeled with beams or shells, concurrent layout optimization of beam and shell components, and an application in a microsatellite structure. Optimization results show that the number of structural analyses is dramatically decreased when compared with pure GA while even comparable to pure sizing optimization.     

A multi-start central force optimization for global optimization

Central force optimization (CFO) is an efficient and powerful population-based intelligence algorithm for optimization problems. CFO is deterministic in nature, unlike the most widely used metaheuristics. CFO, however, is not completely free from the problems of premature convergence. One way to overcome local optimality is to utilize the multi-start strategy. By combining the respective advantages of CFO and the multi-start strategy, a multi-start central force optimization (MCFO) algorithm is proposed in this paper. The performance of the MCFO approach is evaluated on a comprehensive set of benchmark functions. The experimental results demonstrate that MCFO not only saves the computational cost, but also performs better than some state-of-the-art CFO algorithms. MCFO is also compared with representative evolutionary algorithms. The results show that MCFO is highly competitive, achieving promising performance.     

Optimal scheduling of single stage batch plants with direct heat integration

This paper addresses the multi-objective optimization problem arising in the operation of heat integrated batch plants, where makespan and utility consumption are the two conflicting objectives. A new continuous-time MILP formulation with general precedence variables is proposed to simultaneously handle decisions related to timing, product sequencing, heat exchanger matches (selected from a two-stage superstructure) and their heat loads. It features a complex set of timing constraints to synchronize heating and cooling tasks, derived from Generalized Disjunctive Programming. Through the solution of an industrial case study from a vegetable oil refinery, we show that major savings in utilities can be achieved while generating the set of Pareto optimal solutions through the ɛ-constraint method.     

金属配合物与核酸作用机理的理论计算

通过计算机模拟金属配合物与核酸作用机理,对其理论模型能量计算和结构优化。在不同的化学环境条件下得到不同的实验模拟结果,对真实的化学反应过程有重要的指导意义和参考意义。通过Gaussian03,Gauss View等软件的结合应用,分别应用于优化计算和理论建模,熟悉了对化学软件操作应用。     

基于聚类的数据加权优化在犯罪预测中的应用

近年来，我国传统暴力犯罪与成年人犯罪呈下降态势，但是，犯罪案由层出不穷。为有效提升公安实践工作中犯罪预测能力，打击各类违法犯罪事件,本文针对犯罪数据，提出一种新型犯罪预测模型。利用密度聚类分析方法将犯罪数据分类，然后进行数据降维提取关键属性生成特征数据，继而对特征数据进行加权优化并采用机器学习的方式对特征数据进行学习，从而预测犯罪案由。实验结果表明，与传统方法相比，本文方法具有更好的预测效果，为公安实践工作中类似案件的侦破和预防，提供新的路径支撑。     

浅议我国上市公司内部控制环境优化

控制环境是内部控制框架的基础,由于我国目前上市公司内部控制体系建设尚处于初级阶段,决定了其内部控制环境呈现出固有弊端.分析了我国上市公司在控制环境方面存在的缺陷,并提出了相应的优化措施,以期能对内部控制环境的完善起到一定的作用.