共查询到10条相似文献,搜索用时 109 毫秒
1.
This paper presents an advanced software system for solving the flexible manufacturing systems (FMS) scheduling in a job-shop environment with routing flexibility, where the assignment of operations to identical parallel machines has to be managed, in addition to the traditional sequencing problem. Two of the most promising heuristics from nature for a wide class of combinatorial optimization problems, genetic algorithms (GA) and ant colony optimization (ACO), share data structures and co-evolve in parallel in order to improve the performance of the constituent algorithms. A modular approach is also adopted in order to obtain an easy scalable parallel evolutionary-ant colony framework. The performance of the proposed framework on properly designed benchmark problems is compared with effective GA and ACO approaches taken as algorithm components. 相似文献
2.
In this paper, an Adaptive Hierarchical Ant Colony Optimization (AHACO) has been proposed to resolve the traditional machine
loading problem in Flexible Manufacturing Systems (FMS). Machine loading is one of the most important issues that is interlinked
with the efficiency and utilization of FMS. The machine loading problem is formulated in order to minimize the system unbalance
and maximize the throughput, considering the job sequencing, optional machines and technological constraints. The performance
of proposed AHACO has been tested over a number of benchmark problems taken from the literature. Computational results indicate
that the proposed algorithm is more effective and produces promising results as compared to the existing solution methodologies
in the literature. The evaluation and comparison of system efficiency and system utilization justifies the supremacy of the
algorithm. Further, results obtained from the proposed algorithm have been compared with well known random search algorithm
viz. genetic algorithm, simulated annealing, artificial Immune system, simple ant colony optimization, tabu search etc. In
addition, the algorithm has been tested over a randomly generated problem set of varying complexities; the results validate
the robustness and scalability of the algorithm utilizing the concepts of ‘heuristic gap’ and ANOVA analysis. 相似文献
3.
4.
为实现水下无人机在水域中自主作业的功能,对其设计一套合理的路径规划方案是非常有必要的。蚁群算法针对水下无人机路径规划方面有着非常好的效果,拥有不错的鲁棒性,但是传统的蚁群算法在解决路径规划问题时很容易出现局部最优解的问题。以传统蚁群遗传算法理论为根据,对其进行添加目标引导素、构建精英蚂蚁体系、更新信息素浓度这三方面的改进,使用栅格法构建水下环境分析模型,并以最短的路径为目的,规划一条从初始状态到目标状态的无碰安全途径,运用仿真的办法展开验证。结果显示:相较于传统算法,改进后的算法在求解速度和全局求解能力上有较大的优势。 相似文献
5.
蚁群算法在优化组合问题中有着重要的意义,传统的蚁群调度算法搜索速度慢、容易陷入局部最优。针对这种情况,结合布谷鸟搜索算法,提出一种基于蚁群算法与布谷鸟搜索算法的混合算法(ACOCS),用于云环境下的资源调度。该方法有效保留了蚁群算法求解精度高和鲁棒性的特性,并融入了布谷鸟搜索具有快速全局搜索能力的优势。仿真实验结果表明,提出的ACOCS调度算法有效减少了调度所需的响应时间,也在一定程度上提高了系统资源利用率。 相似文献
6.
7.
8.
潘启勇 《计算机测量与控制》2011,19(9)
提出一种柔性制造系统(FMS)的故障诊断和可用性评价方法;针对传统的随机Petri网在解决FMS故障诊断上极大受限于底层马尔科夫链规模而容易产生状态爆炸的问题,首先,将蚁群优化算法(ACO)融入随机有色网(SPN)中,提出并定义了一种能对柔性制造系统的故障进行诊断的诊断器;然后,通过马尔科夫链计算制造单元的可用性,得到FMS到诊断器的映射,从而可以得到FMS中所有可能生产过程;最后,在经典FMS可用性评价方法的基础上,引入覆盖因子,提出了一种新的对FMS生产过程进行可用性评价的方法;仿真实验显示了覆盖因子对系统可用性的影响,通过与传统方法进行比较,表明覆盖因子越大,FMS的可用性越高。 相似文献
9.
蚁群算法是一种解决组合优化问题的有效算法,已得到日益深入的研究,并逐渐得到应用。蚁群算法的一个不足是,算法参数的设置往往凭借经验,缺乏充足的依据。文章以车辆路径问题(vehicleroutingproblem,VRP)为例,从一个烟草配送的智能决策系统中抽取一定量的数据,对蚁群算法中各参数与算法收敛性之间的关系进行了大量的仿真实验,通过对实验结果的分析,给出了解决此类问题时的一种优化算法参数的方法。 相似文献
10.
In a network, one of the important problems is making an efficient routing decision. Many studies have been carried out on
making a decision and several routing algorithms have been developed. In a network environment, every node has a routing table
and these routing tables are used for making routing decisions. Nowadays, intelligent agents are used to make routing decisions.
Intelligent agents have been inspired by social insects such as ants. One of the intelligent agent types is self a cloning
ant. In this study, a self cloning ant colony approach is used. Self cloning ants are a new synthetic ant type. This ant assesses
the situation and multiplies through cloning or destroying itself. It is done by making a routing decision and finding the
optimal path. This study explains routing table updating by using the self cloning ant colony approach. In a real net, this
approach has been used and routing tables have been created and updated for every node. 相似文献