基于蚁群算法的排水管道系统优化设计

引入一种新的优化设计方法——蚁群算法，并将该法应用于排水管道系统的优化设计。通过实例说明了蚁群算法的设计过程，并与遗传算法进行了比较，结果表明蚁群算法在给排水管网设计中有较为广阔的应用前景。     

蚁群优化算法基本原理及研究进展

对蚁群算法的原理及特点进行了论述,进行了算法在几种优化问题上的应用研究,对算法的一些不足进行了分析,提出了几种算法改进的方法,进行了该算法下一步研究的展望。     

蚁群算法在雨水管道系统优化设计中的新尝试

引入一种新的优化设计方法——蚁群算法,并探讨将该法应用于雨水管道系统的优化设计.通过实例说明蚁群算法的过程,并与遗传算法进行比较,表明蚁群算法在给排水管网设计中有较为广阔的应用前景.     

基于改进的蚁群算法的测试数据自动生成方法

本文设计了测试数据自动生成模型,提出一种基于改进的蚁群算法的测试数据自动生成方法。该方法在传统蚁群算法的概率算子中引入相似度影响因子,增加了算法的全局搜索能力。通过三角形判别问题,对改进的算法与传统蚁群算法对比分析。实验结果表明,该算法相较传统蚁群算法具有搜索效率高、全局搜索能力强的特点,在测试数据自动生成问题中具有较强的可行性。     

桁架结构优化设计的改进蚁群算法

通过对已有的优化方法进行分析,针对蚁群算法容易收敛到局部最优解的缺陷,通过遗传算法和禁忌算法来提高增加蚁群算法的全局优化能力,并改进了算法的灵活性和扩展性;将改进的蚁群算法应用到桁架结构优化设计中,提出了桁架结构优化设计的改进蚁群算法,并建立了相应的优化模型;最后,对10杆平面桁架的优化进行了研究和分析,结果表明,提出的改进蚁群算法是科学可行的。     

蚁群算法及其在硐群施工优化中的应用

为解决复杂的组合优化问题，近来提出了一种新的模拟进化算法－－蚁群算法。从原理，算法实现等方面详细介绍了该算法，并针对有序组合优化问题，改进了原算法。把改进算法应用于地下工程中的一类组合优化问题－硐群施工顺序优化。一个大型地下硐室群工程的施工顺序优化结果表明，蚁群算法的应用效果良好，是解决岩土工程中的组合优化问题的一种好方法。     

改进的蚁群算法在TSP问题中的应用

应用基本蚁群算法来求解TSP问题,在算法中引入去交叉策略,降低其计算复杂度,仿真算例表明,该方法能有效加快局部搜索能力,加快了大规模TSP问题的求解。     

物流配送路径安排问题的混合蚁群算法

本文针对物流配送路径选择问题 ,提出了一种混合蚁群算法 ,以克服经典蚁群算法时间复杂性过大的难点。论文还研究了该算法解的二次优化方法以更适合实际情况。实证表明论文算法的求解效果良好。     

群体智能优化算法的研究进展与展望

针对群体智能算法在结构优化设计领域中的应用，介绍了当前存在的一些群体智能算法，包括蚁群算法、鱼群算法和粒子群算法，阐述了其工作原理和特点，同时，对该算法在结构优化设计中的应用发展进行了展望。     

基于改进蚁群算法的冰鲜水产品配送路径优化方法研究

为研究冰鲜水产品最优配送路径的优化方法,在传统蚁群算法基础上提出一种改进的蚁群算法,先后分别采用局部最优和全局最优两种方式对传统蚁群算法的信息素更新方式加以扩大至最优解寻觅范围,并对启发因子的函数定义范围加以扩展至初始节点,利用2-opt算法进行局部优化。实例仿真结果表明,在相同配送条件下,改进后的蚁群算法与避圈法、传统蚁群算法相比较,其配送时间分别缩短31.64%和8.15%,其配送路径长度分别缩短21.89%和16.94%。研究表明,改进的蚁群算法可用于冰鲜水产品最优配送路径的计算,该方法可在实际应用中有效提高冰鲜水产品的物流运输效率。     

Constrained Ant Colony Optimisation Algorithm for the layout and size optimisation of sanitary sewer networks

The incremental solution building capability of Ant Colony Optimisation Algorithm (ACOA) is used in this paper for the efficient layout and pipe size optimisation of sanitary sewer network. Layout and pipe size optimisation of sanitary sewer networks requires optimal determination of pipe locations, pipe diameters and pipe slopes leading to a highly constrained mixed-integer nonlinear programming (MINLP) problem presenting a challenge even to the modern heuristic search methods. A constrained version of ACOA equipped with a Tree Growing Algorithm (TGA) is proposed in this paper for the simultaneous layout and pipe size determination of sewer networks. The method is based on the assumption that a base layout including all possible links of the network is available. The TGA algorithm is used in an incremental manner to construct feasible tree-like layouts out of the base layout, while the constrained ACOA is used to optimally determine the cover depths of the constructed layout. Proposed formulation is used to solve three hypothetical test examples of different scales and the results are presented and compared with those produced by a conventional application of ACOA in which an ad-hoc engineering concept is used for layout determination. The results indicate the effectiveness and efficiency of the proposed method to optimally solve the problem of layout and size determination of sewer networks.     

蚁群算法在GIS最短路径求解中应用的初步研究

最短路径的求解是GIS应用中的主要问题之一。在传统的最短路径求解算法中,Dijkstra算法和启发式搜索算法-A＊算法具有较好的效果,得到了广泛的应用。蚁群算法是由意大利学者Dorigo等人于20世纪90年代初期通过模拟自然界中蚂蚁集体寻径的行为而提出的一种基于种群的启发式仿生进化系统。蚁群算法最早成功应用于解决著名的旅行商问题,该算法采用了分布式正反馈并行计算机制,易于与其他方法结合,而且具有较强的鲁棒性,是一种很有前途的仿生优化算法。本文将对该算法应用于GIS中最短路径的求解方面的问题进行初步的研究。     

用复合蚁群算法确定边坡临界滑动面

阐述了蚁群算法基本原理，针对蚁群算法局部搜索能力不强等问题进行探讨，把单纯形加速度法引入蚁群算法中构成复合蚁群算法，可加强局域空间的探索，通过工程实例进行了验证。计算表明，在边坡临界滑动面确定中，复合蚁群算法对改善搜索效率、确保计算精确度具有明显效果。     

非线性最小二乘估计的蚁群遗传融合算法

基于对遗传算法和蚁群算法的分析,提出把蚁群算法和遗传算法相结合的混合算法,有效避免了两种算法的不足之处,并将该混合遗传算法用于非线性最小二乘参数估计中,算例验证了该算法的可行性和有效,性。     

Evaluation of a novel Asymmetric Genetic Algorithm to optimize the structural design of 3D regular and irregular steel frames

We propose a new algorithm, named Asymmetric Genetic Algorithm (AGA), for solving optimization problems of steel frames. The AGA consists of a developed penalty function, which helps to find the best generation of the population. The objective function is to minimize the weight of the whole steel structure under the constraint of ultimate loads defined for structural steel buildings by the American Institute of Steel Construction (AISC). Design variables are the cross-sectional areas of elements (beams and columns) that are selected from the sets of side-flange shape steel sections provided by the AISC. The finite element method (FEM) is utilized for analyzing the behavior of steel frames. A 15-storey three-bay steel planar frame is optimized by AGA in this study, which was previously optimized by algorithms such as Particle Swarm Optimization (PSO), Particle Swarm Optimizer with Passive Congregation (PSOPC), Particle Swarm Ant Colony Optimization (HPSACO), Imperialist Competitive Algorithm (ICA), and Charged System Search (CSS). The results of AGA such as total weight of the structure and number of analyses are compared with the results of these algorithms. AGA performs better in comparison to these algorithms with respect to total weight and number of analyses. In addition, five numerical examples are optimized by AGA, Genetic Algorithm (GA), and optimization modules of SAP2000, and the results of them are compared. The results show that AGA can decrease the time of analyses, the number of analyses, and the total weight of the structure. AGA decreases the total weight of regular and irregular steel frame about 11.1% and 26.4% in comparing with the optimized results of SAP2000, respectively.     

Construction imitating ants: Resource-unconstrained scheduling with artificial ants

The paper presents a methodology to arrive at critical path calculations in construction networks by imitating the natural selection processes utilized by real-life ants in search of shortest paths to a food source, and by using Ant Colony Optimization (ACO) algorithms. Ant Colony Optimization is a population-based, artificial multi-agent, general-search technique for the solution of difficult combinatorial problems with its theoretical roots based on the behavior of real ant colonies. The fundamental mathematical background of the ACO method is outlined and a suggested possible implementation strategy is described for solving for longest (critical) paths in construction schedule networks. The ACO methodology should be of interest to both researchers and practitioners since it provides an alternative method to critical path calculations, with a wide range of applications. The described ACO virtual multi-agent approach is supplemented by a sample case study as well as algorithms for the solution of resource-unconstrained construction schedules.     

基于改进型蚁群算法的结构优化设计

结构优化设计中通常含有离散设计变量,本文探讨了如何将改进型蚁群算法应用于含离散设计变量的结构优化问题。以十杆桁架结构离散设计变量优化问题为例进行仿真,仿真结果表明蚁群算法能比较有效地解决含离散设计变量的优化问题。     

最优解算法综述

本文研究了钢筋下料优化的离散组合最优化问题,并对组合优化中常用的遗传算法、模拟退火算法、启发式算法进行了综述,探讨了各自的特点并进行比较。最后根据近几年国内外的文献发现,单独的某个算法找到最优解存在随机性,且得到最优解会花费大量时间。解决这一问题的方法是将几种算法根据具体工况进行组合,组合后的算法的效率更高。     

建筑曲线与群体设计

群体建筑整体形象的优劣对于城市空间环境质量具有重大意义。在建筑创作中恰当地运用曲线可以使群体的建筑形象及空间形态在整体统一中更赋于变化,同时还能够在更高层次上实现对人的心理关怀。在建筑创作中对曲线形式的运用已经成为建筑师追求人性化的建筑形象和空间效果的一种有效方法和手段。