基于微正则退火的频率分配方法

为了提高蜂窝移动通信网中频率资源的利用效率，提出了一种基于微正则退火算法的频率分配方法. 该方法将电磁干扰作为系统能量函数，通过一只虚拟妖在状态空间中的随机行走实现频率配置的优化. 仿真表明，在可分配频点资源充分时，该算法与模拟退火算法性能相当. 当频点资源紧张时，微正则退火算法的优越性得以体现，其搜索成功率远高于模拟退火算法，能更快地得到最优解. 仿真中典型的优化轨迹也证明了微正则退火算法具有快速收敛的特点.     

应用溶剂热组合化学方法研究过渡金属对层状磷酸铝化合物[C6N4H21][Al3P4O16]的影响

利用组合化学方法研究了不同过渡金属及用量对化合物[C6N4H21][Al3P4O16]合成的影响．实验结果显示，铁、锌、钴、锰等二价化合物的存在会使三乙烯四胺（TETA）发生异构化，转变为4，（2-乙胺基）二乙基三胺（TREN），从而导致3-D开放骨架磷酸铝[C24N16H91][Al9-xMx（PO4）12]·nH2O的生成（M=Zn^2＋，Mn^2＋，Fe^2＋，Co^2＋）．     

THE PHASE WEB PARADIGM

We describe an information-oriented, computational physical theory based on expressing knowledge of the world via patterns of synchronization. The systems this theory describes are self-organizing, display emergent phenomena, and can be expressed in terms both of Clifford algebras and algebraic topology, and practical running programs.     

热轧板坯出库问题的树搜索算法

热轧板坯的出库问题是连铸-热轧生产中一个重要的组合优化问题, 然而在学术界还很少见到对该问题的研究. 对此, 提出了热轧板坯出库问题总移动次数的一个下界, 开发了一个极小化总移动次数的树搜索算法. 该算法包括一个生成初始解的贪婪算法和一个基于复合移动的递归搜索. 大量的实验和分析表明, 该树搜索算法能在较短的时间内给出板坯出库问题的满意解, 具有重要的理论意义和应用价值.

     

蚁群算法参数分析与组合优化设置研究

文章对蚁群算法中影响算法性能的参数进行了分析、研究和仿真,通过分析与仿真得出了算法中各参数的最佳取值范围和组合优化设置,参数的组合优化设置有助于提高蚁群算法的收敛速度,缩短蚁群算法的计算时间,以达到优化算法性能的目的.     

Remarks on stability of solutions of the property domination problem

A class of combinatorial problems is considered whose investigation and solution require the notions of the theory of fuzzy sets. The necessary and sufficient conditions of stability are given. Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 36–40, July–August, 1999.     

3-D Container Packing Heuristics

In this paper, we study the 3-D container packing problem. The problem is divided into box selection, space selection, box orientation and new space generation sub-problems. As a first step, a basic heuristic is devised. From results using this heuristic, problems are categorized as homogeneous and heterogeneous. Two augmenting heuristics are then formulated to deal with these categories. They are complementary in their capabilities in dealing with a range of practical problems, and in terms of their computational consumption. Results using our algorithmsexceed the benchmark by 4.5% on average.     

Stability criteria in vector combinatorial bottleneck problems in terms of binary relations

The paper considers a vector (multiobjective) path problem with minimax partial criteria. Solving this problem means finding a Pareto set. Binary relations on a set of paths are used to formulate the necessary and sufficient conditions for five types of problem stability against perturbations of the parameters of a vector criterion. Some sufficient stability conditions in terms of Pareto, Smale, and Slater sets are obtained as corollaries. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 103–111, May–June 2008.     

Work stealing with private integer–vector–matrix data structure for multi‐core branch‐and‐bound algorithms

In this paper, the focus is put on multi‐core branch‐and‐bound algorithms for solving large‐scale permutation‐based optimization problems. We investigate five work stealing (WS) strategies with a new data structure called integer–vector–matrix (IVM). In these strategies, each thread has a private IVM allowing the local management of a set of subproblems enumerated using a factorial system. The WS strategies differ in the way the victim thread is selected and the granularity of stolen work units (intervals of factoradics). To assess the efficiency of the private IVM‐based WS approach, the five WS strategies have been extensively experimented on the flowshop scheduling permutation problem and compared with their conventional linked‐list‐based counterparts. The obtained results demonstrate that the IVM‐based WS outperforms the linked‐list‐based one in terms of CPU time, memory usage and number of performed WS operations. Copyright © 2016 John Wiley & Sons, Ltd.     

基于组合式测量的手持式三维激光扫描系统数学模型研究

为了解决大尺度空间内复杂物体的形貌尺寸测量问题,提出了一种快速三维数字化精确测量的方法,该方法采用全局测量和终端测量相结合的方式,消除了大型工件整体尺寸大与局部空间复杂的矛盾。首先在分析线结构光测量原理的基础上,提出一种基于局域空间定位的手持式激光扫描测量方法,并构建测量数学模型;其次对手持测量头的空间姿态给出相应的数学建模过程;最后给出完备的组合式三维测量数学模型。该方法可用于各种大范围场景三维精确测量和重构,为三维实体资源快速重构数字化模型提供准确的理论依据。