共查询到11条相似文献,搜索用时 15 毫秒
1.
李光辉 《电脑与微电子技术》2013,(22):24-27
主要针对离散型数学模型的优化问题,分析使用遗传和蚁群算法的优缺点,并克服遗传算法、蚁群算法各自的局限性,发挥其优势,通过遗传-蚁群融合算法进行优化计算。在研究过程中,采用C#语言实现融合算法,并定义标准输入和输出结构。利用油田措施优化应用案例进行了对比实验验证,结果表明,融合算法能有效地发挥遗传、蚁群算法的优点,运算速度及求解效率均较理想。 相似文献
2.
A survey: Ant Colony Optimization based recent research and implementation on several engineering domain 总被引:1,自引:0,他引:1
Ant Colony Optimization (ACO) is a Swarm Intelligence technique which inspired from the foraging behaviour of real ant colonies. The ants deposit pheromone on the ground in order to mark the route for identification of their routes from the nest to food that should be followed by other members of the colony. This ACO exploits an optimization mechanism for solving discrete optimization problems in various engineering domain. From the early nineties, when the first Ant Colony Optimization algorithm was proposed, ACO attracted the attention of increasing numbers of researchers and many successful applications are now available. Moreover, a substantial corpus of theoretical results is becoming available that provides useful guidelines to researchers and practitioners in further applications of ACO. This paper review varies recent research and implementation of ACO, and proposed a modified ACO model which is applied for network routing problem and compared with existing traditional routing algorithms. 相似文献
3.
Load balanced transaction scheduling problem is an important issue in distributed computing environments including grid system. This problem is known to be NP-hard and can be solved by using heuristic as well as any meta-heuristic method. We ponder over the problem of the load balanced transaction scheduling in a grid processing system by using an Ant Colony Optimization for load balancing. The problem that we consider is to achieve good execution characteristics for a given set of transactions that has to be completed within their given deadline. We propose a transaction processing algorithm based on Ant Colony Optimization (ACO) for load balanced transaction scheduling. We modify two meta-heuristic along with ACO and three heuristic scheduling algorithms for the purpose of comparison with our proposed algorithm. The results of the comparison show that the proposed algorithm provides better results for the load balanced transaction scheduling in the grid processing system. 相似文献
4.
Hybridization in optimization methods plays a very vital role to make it effective and efficient. Different optimization methods have different search tendency and it is always required to experiment the effect of hybridizing different search tendency of the optimization algorithm with each other. This paper presents the effect of hybridizing Biogeography-Based Optimization (BBO) technique with Artificial Immune Algorithm (AIA) and Ant Colony Optimization (ACO) in two different ways. So, four different variants of hybrid BBO, viz. two variants of hybrid BBO with AIA and two with ACO, are developed and experimented in this paper. All the considered optimization techniques have altogether a different search tendency. The proposed hybrid method is tested on many benchmark problems and real life problems. Friedman test and Holm–Sidak test are performed to have the statistical validity of the results. Results show that proposed hybridization of BBO with ACO and AIA is effective over a wide range of problems. Moreover, the proposed hybridization is also effective over other proposed hybridization of BBO and different variants of BBO available in the literature. 相似文献
5.
Juan Rada-Vilela Manuel Chica Óscar Cordón Sergio Damas 《Applied Soft Computing》2013,13(11):4370-4382
Assembly lines for mass manufacturing incrementally build production items by performing tasks on them while flowing between workstations. The configuration of an assembly line consists of assigning tasks to different workstations in order to optimize its operation subject to certain constraints such as the precedence relationships between the tasks. The operation of an assembly line can be optimized by minimizing two conflicting objectives, namely the number of workstations and the physical area these require. This configuration problem is an instance of the TSALBP, which is commonly found in the automotive industry. It is a hard combinatorial optimization problem to which finding the optimum solution might be infeasible or even impossible, but finding a good solution is still of great value to managers configuring the line. We adapt eight different Multi-Objective Ant Colony Optimization (MOACO) algorithms and compare their performance on ten well-known problem instances to solve such a complex problem. Experiments under different modalities show that the commonly used heuristic functions deteriorate the performance of the algorithms in time-limited scenarios due to the added computational cost. Moreover, even neglecting such a cost, the algorithms achieve a better performance without such heuristic functions. The algorithms are ranked according to three multi-objective indicators and the differences between the top-4 are further reviewed using statistical significance tests. Additionally, these four best performing MOACO algorithms are favourably compared with the Infeasibility Driven Evolutionary Algorithm (IDEA) designed specifically for industrial optimization problems. 相似文献
6.
7.
Energy consumption is a key parameter when highly computational tasks should be performed in a multiprocessor system. In this case, in order to reduce total energy consumption, task scheduling and low-power methodology should be combined in an efficient way. This paper proposes an algorithm for off-line communication-aware task scheduling and voltage selection using Ant Colony Optimization. The proposed algorithm minimizes total energy consumption of an application executing on a homogeneous multiprocessor system. The artificial agents explore the search space based on stochastic decision-making using global heuristic information with total energy consumption and local heuristic information with interprocessor communication volume. In search space exploration, both voltage selection and the dependencies between tasks are considered. The pheromone trails are updated by normalizing the total energy consumption. The pheromone trails represent the global heuristic information in order to utilize all entire energy consumption information from previous evaluated solutions. Experimental results show that the proposed algorithm outperforms traditional communication-aware task scheduling and task scheduling using genetic algorithms in terms of total energy consumption. 相似文献
8.
Nattapat Attiratanasunthron 《Information Processing Letters》2008,105(3):88-92
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. More specifically, we show that the expected number of iterations required for an ACO-based algorithm with n ants is for graphs with n nodes and m edges, where ρ is an evaporation rate. This result can be modified to show that an ACO-based algorithm for One-Max with multiple ants converges in expected iterations, where n is the number of variables. This result stands in sharp contrast with that of Neumann and Witt, where a single-ant algorithm is shown to require an exponential running time if ρ=O(n−1−ε) for any ε>0. 相似文献
9.
This paper concerns with the Job Shop Scheduling Problem (JSSP) considering the transportation times of the jobs from one machine to another. The goal of a basic JSSP is to determine starting and ending times for each job in which the objective function can be optimized. In here, several Automated Guided Vehicles (AGVs) have been employed to transfer the jobs between machines and warehouse located at the production environment. Unlike the advantages of implemented automatic transportation system, if they are not controlled along the routes, it is possible that the production system encounters breakdown. Therefore, the Conflict-Free Routing Problem (CFRP) for AGVs is considered as well as the basic JSSP. Hence, we proposed a mathematical model which is composed of JSSP and CFRP, simultaneously and since the problem under study is NP-hard, a two stage Ant Colony Algorithm (ACA) is also proposed. The objective function is to minimize the total completion time (make-span). Eventually, in order to show the model and algorithm’s efficiency, the computational results of 13 test problems and sensitivity analysis are exhibited. The obtained results show that ACA is an efficient meta-heuristic for this problem, especially for the large-sized problems. In addition, the optimal number of both AGVs and rail-ways in the production environment is determined by economic analysis. 相似文献
10.
蚁群优化算法作为群智能理论的主要算法之一,已经成功应用在众多研究领域的优化问题上,但是在遥感数据处理领域还是一个新的研究课题。蚁群优化具有自组织、合作、通信等智能化优点,对数据无需统计分布参数的先验知识,因此在遥感数据处理领域具有很大的潜在优势。介绍了将蚁群优化分类规则挖掘算法应用到遥感图像分类研究领域的理论与算法流程。并采用北京地区的CBERS遥感数据作为实验数据,通过蚁群优化算法构造分类规则,对选择的遥感数据进行了分类实验,并和最大似然分类方法进行对比,实验结果表明,蚁群优化分类规则挖掘算法为遥感图像的分类提供了一种新方法。 相似文献
11.
针对云计算环境中虚拟机资源负载均衡问题,并为实现云计算下虚拟机资源负载均衡高效调度以满足用户的QoS需求,提出了一种基于多维QoS实现负载均衡的虚拟机资源调度方法。首先,在云计算环境下建立多维QoS网络环境的数学模型;然后,提出一种基于蚁群算法的优化算法,用于实现云计算环境中虚拟机资源高效调度;最后,在云仿真平台CloudSim上进行仿真实验。实验结果表明,相对于其他资源调度算法,所提算法能高效解决云计算下虚拟机资源调度问题,减少虚拟机资源负载均衡离差,具有更好的性能,能完全满足云计算下和多维QoS环境下虚拟机资源负载均衡的需求。 相似文献