Artificial Bee Colony algorithm on distributed environments

Conference proceedings article

ผู้เขียน/บรรณาธิการ

กลุ่มสาขาการวิจัยเชิงกลยุทธ์

ไม่พบข้อมูลที่เกี่ยวข้อง

รายละเอียดสำหรับงานพิมพ์

รายชื่อผู้แต่ง: Banharnsakun A., Achalakul T., Sirinaovakul B.

ผู้เผยแพร่: Hindawi

ปีที่เผยแพร่ (ค.ศ.): 2010

หน้าแรก: 13

หน้าสุดท้าย: 18

จำนวนหน้า: 6

ISBN: 9781424473762

นอก: 0146-9428

eISSN: 1745-4557

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-79952751275&doi=10.1109%2fNABIC.2010.5716309&partnerID=40&md5=66a31c08934931c02ece462836e34a1f

ภาษา: English-Great Britain (EN-GB)

ดูบนเว็บไซต์ของสำนักพิมพ์

บทคัดย่อ

Artificial Bee Colony (ABC) is a metaheuristic approach in which a colony of artificial bees cooperates in finding good solutions for numerical optimization problems. ABC is adopted widely for use in several domains of solution optimization. However, the algorithm generally requires a considerably large computational time and resources. In order to enhance the performance of this algorithm for a large problem size, we introduce a distributed version of ABC. In our parallel algorithm, the entire bee colony is decomposed into several subgroups. Each subgroup then performs a local search concurrently on each processor node. The local best solutions are then exchanged among processor nodes. The algorithm implementation utilizes the message passing technique as a communication paradigm. We then empirically assess the performance based on both result accuracy and algorithm's efficiency. The experimental results show improvement in both solution quality and computing time when comparing to the sequential ABC algorithm. ฉ 2010 IEEE.

คำสำคัญ

Artificial Bee Colony (ABC), Distributed environments, Numerical Optimization, Parallel computing, swarm intelligence