Direct multicriteria clustering algorithms

In a multicriteria clustering problem, optimization over more than one criterion is required. The problem can be treated in different ways: by reduction to a clustering problem with the single criterion obtained as a combination of the given criteria; by constrained clustering algorithms where a selected critetion is considered as the clustering criterion and all others determine the constraints; or by direct algorithms. In this paper two types of direct algorithms for solving multicriteria clustering problem are proposed: the modified relocation algorithm, and the modified agglomerative algorithm. Different elaborations of these two types of algorithms are discussed and compared. Finally, two applications of the proposed algorithms are presented. Elaborated version of the talks presented at the First Conference of the International Federation of Classification Societies, Aachen, 1987, at the International Conference on Social Science Methodology, Dubrovnik, 1988, and at the Second Conference of the International Federation of Classification Societies, Charlottesville, 1989. This work was supported in part by the Research Council of Slovenia.     

Trail-following responses ofLeptogenys diminuta to stereoisomers of 4-methyl-3-heptanol

Behavioral tests carried out with the four stereoisomers of 4-methyl-3-heptanol revealed thatLeptogenys diminuta ants respond specifically only to the (3R, 4S)-isomer.     

不完全投影据图像重建的最小交叉熵算法

提出图像重建的最小交叉熵算法,详细推导了算法的有关公式,并给出程序实现框图.计算机模拟结果表明:最小交叉熵算法的性能优于最大熵算法.     

计算不连续映射不动点或零点的PL同伦算法若干收敛条件

本文证明了几个不连续映射的不动点或零点定理的条件是PL同伦算法收敛的充分条件。     

解约束优化问题的一类广义共轭方向法：一种几何处理

运行微分几何方法将无约束最优化中的共轭方向法推广到约束最优化问题上。在约束子流形上诱导了一类新的仿射联络使原来的约束最优化问题转化为约束流形上的无约束的局部二次规划问题。从而形成了具有广义共轭方向的一种曲搜索算法。     

神经网络处理平面图着四色问题的研究

以Ｈｏｐｆｉｅｌｄ神经网络为基础，提出一种网络模型，可以正确处理平面图着四色问题，它具有结构简单，连接规则，容错性强等优点，并可用电子电路实现，在各个神经元外加激励稍有不同或网络连接权值有偏差的情况下可以得到正确输出，用两种途径进行仿真，其结果与理论分析相吻合。     

基于蚁群并行算法的电气接线路径优化及仿真

继电控制系统中元件的连接关系可以使用网络拓扑图描述，元件间的接线路径优化类似于旅行商(TSP)问题，属于NP完备的组合优化问题。本文将ACS蚁群算法引入接线路径优化，建立了适用于继电系统接线路径优化的计算模型，并在MPI(消息传递界面)的基础上实现了算法的并行化。通过对算法初始参数进行仿真分析，确定了各参数的最佳取值范围，实验结果证明，在参数选择适当的情况下，ACS蚁群算法具有很好的全局搜索能力和较快的收敛速度。     

A Multi-Agent Approach for Solving Traveling Salesman Problem

The traveling salesman problem （TSP） is a classical optimization problem and it is one of a class of NP- Problem. This paper presents a new method named multiagent approach based genetic algorithm and ant colony system to solve the TSP. Three kinds of agents with different function were designed in the multi-agent architecture proposed by this paper. The first kind of agent is ant colony optimization agent and its function is generating the new solution continuously. The second kind of agent is selection agent, crossover agent and mutation agent, their function is optimizing the current solutions group. The third kind of agent is fast local searching agent and its function is optimizing the best solution from the beginning of the trial. At the end of this paper, the experimental results have shown that the proposed hybrid ap proach has good performance with respect to the quality of solution and the speed of computation.     

一种改进的蚁群算法用于灰色约束非线性规划问题求解

针对灰色约束非线性规划问题,设计了一种改进蚁群算法．该算法采用了正反馈机制。在对灰色约束非线性规划问题白化处理后,将罚函数方法引入到目标函数中,同时给出了改进蚁群算法的仿真流程．实例应用表明,将改进后的蚁群算法应用于灰色约束非线性规划问题的求解是可行有效的。     

基于遗传算法的系统辨识方法研究

针对从样本数据进行系统辨识的问题,提出一种由典型数学模型相互组合构成系统模型的新的辨识方法,将系统结构辨识问题转化为组合优化问题,并采用遗传算法同时实现了系统的结构辨识与参数辨识,模拟仿真与实际系统辨识结果验证了系统辨识方法的合理性与求解算法的有效性.