搜索资源列表
aco1
- aco algorithm for cpu scheduling
ant
- 蚁群算法(ant colony algorithm，简称ACA)是20世纪90年代由意大利学者M．Dorigo等人首先提出来的一种新型的模拟进化算法．它的出现为解决NP一难问题提供了一条新的途径．用蚁群算法求解旅行商问题(TSP)、分配问题(QAP)、调度问题(JSP)等，取得了一系列较好的实验结果．虽然对蚁群算法研究的时间不长，但是初步研究已显示出蚁群算法在求解复杂优化问题(特别是离散优化问题)方面具有一定的优势，表明它是一种很有发展前景的方法．蚁群算法的主要特点是：正反馈、分布式计算．正反馈
ACO-on-JSSP
- Dynamic job shop scheduling problem is one form of a job shop scheduling problem with varying arrival time job or not concurrent. This problem can be represented in graph form, which is to seek the shortest path from start point to destination point.
sso_simple
- simplified swarm optimization的matlab版本，可以節省寫程式的時間。本程演算法已驗證可以在某些問題上找到比pso、ga、sa、ts、aco等演算法更好的解。-simplified swarm optimization in matlab version, you can write a program to save time. The scheduling algorithm has been verified can find better than pso,
ACO_on_JSSP
- 该程序是用matlab实现蚁群优化算法求解车间调度问题-The program is ACO algorithm for the jobshop scheduling problem
ACO on JSSP
- ant colony optimization on job shop scheduling
1570390207
- Dynamic ACO-based Fault Tolerance in Grid Computing