✦ LIBER ✦

An effective multi-level algorithm based on ant colony optimization for graph bipartitioning

✍ Scribed by Ming Leng; Song-nian Yu; Wang Ding; Qiang Guo

Publisher: Chinese Electronic Periodical Services
Year: 2008
Tongue: English
Weight: 195 KB
Volume: 12
Category: Article
ISSN: 1007-6417
DOI: 10.1007/s11741-008-0510-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ant colony algorithm based on genetic me

Ant colony algorithm based on genetic method for continuous optimization problem

✍ Jing-wei Zhu; Pei-sheng Meng; Cheng Wang 📂 Article 📅 2007 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 987 KB

Multi-objective ant colony optimization

Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems

✍ Jixang Cheng; Gexiang Zhang; Zhidan Li; Yuquan Li 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 821 KB

An ant colony optimization routing based

An ant colony optimization routing based on robustness for ad hoc networks with GPSs

✍ Daisuke Kadono; Tomoko Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu M 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 889 KB

a b s t r a c t Ant colony optimization (ACO) routing algorithm is one of adaptive and efficient routing algorithms for mobile ad hoc networks (MANETs). In ACO routing algorithms, ant-like agents traverse the network to search a path from a source to a destination, and lay down pheromone on the path