7,129
个编辑
更改
跳到导航
跳到搜索
第183行：
第183行： + 第203行：
第204行： + 第213行：
第215行： + 第233行：
第236行： + − + − +
→应用
*具有序列依赖设置时间的单机总延迟问题 Single-machine total tardiness problem with sequence dependent setup times (SMTTPDST)<ref>C. Gagné, W. L. Price and M. Gravel, "[https://link.springer.com/article/10.1057/palgrave.jors.2601390 Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times]," Journal of the Operational Research Society, vol.53, pp.895-906, 2002.</ref>
*具有序列依赖设置时间的单机总延迟问题 Single-machine total tardiness problem with sequence dependent setup times (SMTTPDST)<ref>C. Gagné, W. L. Price and M. Gravel, "[https://link.springer.com/article/10.1057/palgrave.jors.2601390 Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times]," Journal of the Operational Research Society, vol.53, pp.895-906, 2002.</ref>
*具有序列依赖设置/转换时间的多级流车间调度问题 Multistage flowshop scheduling problem (MFSP) with sequence dependent setup/changeover times<ref>A. V. Donati, V. Darley, B. Ramachandran, "An Ant-Bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions", book chapter in Advances in Metaheuristics for Hard Optimization, Springer, pp.111-138, 2008.</ref>
*具有序列依赖设置/转换时间的多级流车间调度问题 Multistage flowshop scheduling problem (MFSP) with sequence dependent setup/changeover times<ref>A. V. Donati, V. Darley, B. Ramachandran, "An Ant-Bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions", book chapter in Advances in Metaheuristics for Hard Optimization, Springer, pp.111-138, 2008.</ref>
===车辆路线问题 Vehicle routing problem===
===车辆路线问题 Vehicle routing problem===
*带时间窗和多个服务工人的车辆路径问题 Vehicle routing problem with time windows and multiple service workers (VRPTWMS)
*带时间窗和多个服务工人的车辆路径问题 Vehicle routing problem with time windows and multiple service workers (VRPTWMS)
===分配问题 Assignment problem===
===分配问题 Assignment problem===
*[[冗余分配问题 Redundancy allocation problem]] (RAP)<ref>Y. C. Liang and A. E. Smith, "[http://www.eng.auburn.edu/sites/personal/aesmith/files/antcolonyIEEETrRel%20paper.pdf An ant colony optimization algorithm for the redundancy allocation problem (RAP)]," IEEE Transactions on Reliability, vol.53, no.3, pp.417-423, 2004.</ref>
*[[冗余分配问题 Redundancy allocation problem]] (RAP)<ref>Y. C. Liang and A. E. Smith, "[http://www.eng.auburn.edu/sites/personal/aesmith/files/antcolonyIEEETrRel%20paper.pdf An ant colony optimization algorithm for the redundancy allocation problem (RAP)]," IEEE Transactions on Reliability, vol.53, no.3, pp.417-423, 2004.</ref>
===集合问题 Set problem===
===集合问题 Set problem===
* 基于蚁群优化（ACO）的可逆电路合成可以显著提高效率 <ref>M. Sarkar, P. Ghosal, and S. P. Mohanty, "[http://www.cse.unt.edu/~smohanty/Publications_Conferences/2013/Mohanty_MWSCAS2013_Reversible-Circuit.pdf Reversible Circuit Synthesis Using ACO and SA based Quinne-McCluskey Method]", in Proceedings of the 56th IEEE International Midwest Symposium on Circuits & Systems (MWSCAS), 2013, pp. 416--419.</ref>
* 基于蚁群优化（ACO）的可逆电路合成可以显著提高效率 <ref>M. Sarkar, P. Ghosal, and S. P. Mohanty, "[http://www.cse.unt.edu/~smohanty/Publications_Conferences/2013/Mohanty_MWSCAS2013_Reversible-Circuit.pdf Reversible Circuit Synthesis Using ACO and SA based Quinne-McCluskey Method]", in Proceedings of the 56th IEEE International Midwest Symposium on Circuits & Systems (MWSCAS), 2013, pp. 416--419.</ref>
===天线优化与综合 Antennas optimization and synthesis===
===天线优化与综合 Antennas optimization and synthesis===
[[File:ANT Antenna 1.jpg|thumb|Loopback vibrators 10×10, synthesized by means of ACO algorithm<ref name=slyusarant1>Ermolaev S.Y., Slyusar V.I. Antenna synthesis based on the ant colony optimization algorithm.// Proc. ICATT’2009, Lviv, Ukraine 6 - 9 Octobre, 2009. - Pages 298 - 300 [http://slyusar.kiev.ua/298_300_ICATT_2009.pdf]</ref>]]
[[File:ANT Antenna 1.jpg|thumb|用蚁群算法合成了10×10的环回振动器<ref name=slyusarant1>Ermolaev S.Y., Slyusar V.I. Antenna synthesis based on the ant colony optimization algorithm.// Proc. ICATT’2009, Lviv, Ukraine 6 - 9 Octobre, 2009. - Pages 298 - 300 [http://slyusar.kiev.ua/298_300_ICATT_2009.pdf]</ref>]]
[[File:ANT antenna 2.jpg|thumb|Unloopback vibrators 10×10, synthesized by means of ACO algorithm<ref name=slyusarant1/>]]
[[File:ANT antenna 2.jpg|thumb|用蚁群算法合成10×10的无环振荡器<ref name=slyusarant1/>]]
为了优化天线的结构，可以使用蚁群算法。例如，可以考虑基于蚁群算法（ACO）的天线RFID标签, <ref>Marcus Randall, Andrew Lewis, Amir Galehdar, David Thiel. Using Ant Colony Optimisation to Improve the Efficiency of Small Meander Line RFID Antennas.// In 3rd IEEE International e-Science and Grid Computing Conference [http://www98.griffith.edu.au/dspace/bitstream/10072/17063/1/47523_1.pdf], 2007</ref>10×10的回送和卸载振动器<ref name=slyusarant1/>
为了优化天线的结构，可以使用蚁群算法。例如，可以考虑基于蚁群算法（ACO）的天线RFID标签, <ref>Marcus Randall, Andrew Lewis, Amir Galehdar, David Thiel. Using Ant Colony Optimisation to Improve the Efficiency of Small Meander Line RFID Antennas.// In 3rd IEEE International e-Science and Grid Computing Conference [http://www98.griffith.edu.au/dspace/bitstream/10072/17063/1/47523_1.pdf], 2007</ref>10×10的回送和卸载振动器<ref name=slyusarant1/>