变结构变参数设计方法及其在机械CAD中的应用

提出了一种新颖的机械结构设计思想－变结构变参数设计方法，并结合实例，阐述了变结构变参数设计的概念、原则、实施措施和意义。由此对Ｉ－ｄｅａｓ软件包进行了二次开发，编制了发动机曲轴专用ＣＡＤ软件程序，并用某型号发动机曲轴进行了验证。     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.     

Software for dynamic reconfigurable order picking systems

This paper describes an approach, conceptual framework, and software architecture for dynamic reconfiguration of the order picking system. The research and development project was sponsored by the Material Handling Research Center (MHRC), a National Science Foundation sponsored Cooperative Industry/University Research Center. The storage configuration is assumed to be an in-the-aisle order picking system in which stockkeeping units (SKUs) can occupy variable capacity storage locations and stock-splitting is allowed among zones (clusters). The product mix may include multiple product families with different life cycles, correlated demand within families and commonality of demand across families.     

矩形件排样的一种优化算法

排样问题是一种总体资源分配问题，这里根据矩形件排样的工艺要求，提出了矩形件排样的一种近似算法，将一块板材分成三部分，每部分排一种零件，使得减料方便，提高了劳动生产率。     

Ant colony optimization approach to estimate energy demand of Turkey

This paper attempts to shed light on the determinants of energy demand in Turkey. Energy demand model is first proposed using the ant colony optimization (ACO) approach. It is multi-agent systems in which the behavior of each ant is inspired by the foraging behavior of real ants to solve optimization problem. ACO energy demand estimation (ACOEDE) model is developed using population, gross domestic product (GDP), import and export. All equations proposed here are linear and quadratic. Quadratic_ACOEDE provided better-fit solution due to fluctuations of the economic indicators. The ACOEDE model plans the energy demand of Turkey until 2025 according to three scenarios. The relative estimation errors of the ACOEDE model are the lowest when they are compared with the Ministry of Energy and Natural Resources (MENR) projection.     

黑河右岸溢洪洞左导墙优化试验

黑河水利枢纽右岸溢洪洞为缩短引渠左导墙的长度,减少施工开挖量,降低施工难度,减少工程投资,进行优化试验.通过对7种不同的方案对比分析,选择了合适的体型,满足了工程要求.     

模糊规划在炼油厂生产计划优化中的应用

生产计划的编制是炼油化工企业生产经营管理中的一个关键环节，然而由于市场变化的不确定性，使得企业的长远规划制定受到限制，笔者将模糊数学应用于炼厂生产计划的编制，通过模糊规划对炼油企业生产计划进行优化，使编得的生产计划在一定程度上反映市场的变化并使企业的生产效益最优，为企业管理决策者进行长期规划给予指导，给出了实例来说明该方法的可行性。     

连铸温度场数值模拟及冷却水参数优化

由于用实验方法来研究工艺参数对铸坯温度场的影响较困难,故而提出了一种在冶金冷却条件指导下的启发式GA(遗传算法)数值模拟优化方法,为优化工艺参数提供了理论依据,并在优化基础上采用MIMO(多输入多输出)系统PID(比例积分微分)控制器实现了二冷段配水的优化控制,改善了铸坯的质量.     

Minimum spanning trees made easier via multi-objective optimization

Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate the Pareto front, multi-objective optimization problems are considered as more difficult than single-objective problems. One should not forget that the fitness vector with respect to more than one objective contains more information that in principle can direct the search of evolutionary algorithms. Therefore, it is possible that a single-objective problem can be solved more efficiently via a generalized multi-objective model of the problem. That this is indeed the case is proved by investigating the computation of minimum spanning trees.This work was supported by the Deutsche Forschungsgemeinschaft (DFG) as part of the Collaborative Research Center Computational Intelligence (SFB 531) and by the German-Israeli Foundation (GIF) in the project Robustness Aspects of Algorithms.