Publication:
Population based Ant Colony Optmization on FPGA
Population based Ant Colony Optmization on FPGA
| dc.contributor.author | Guntsch, M | en_US |
| dc.contributor.author | Middendorf, M | en_US |
| dc.contributor.author | Scheuermann, B | en_US |
| dc.contributor.author | Diessel, Oliver | en_US |
| dc.contributor.author | ElGindy, Hossam | en_US |
| dc.contributor.author | Schmeck, H | en_US |
| dc.contributor.author | So, K | en_US |
| dc.date.accessioned | 2021-11-25T13:27:07Z | |
| dc.date.available | 2021-11-25T13:27:07Z | |
| dc.date.issued | 2002 | en_US |
| dc.description.abstract | We propose to modify a type of ant algorithm called Population based Ant Colony Optimization (P-ACO) to allow implementation on an FPGA architecture. Ant algorithms are adapted from the natural behavior of ants and used to find good solutions to combinatorial optimization problems. General layout on the FPGA and algorithmic description are covered. The most notable achievements featured in this paper are a runtime reduction and including the approximation of the heuristic function by a small set of favored decisions which changes over time. | en_US |
| dc.description.uri | http://ieeexplore.ieee.org/servlet/opac?punumber=8456 | en_US |
| dc.identifier.isbn | 780375742 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1959.4/39670 | |
| dc.language | English | |
| dc.language.iso | EN | en_US |
| dc.publisher | IEEE | en_US |
| dc.rights | CC BY-NC-ND 3.0 | en_US |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/3.0/au/ | en_US |
| dc.source | Legacy MARC | en_US |
| dc.title | Population based Ant Colony Optmization on FPGA | en_US |
| dc.type | Conference Paper | en |
| dcterms.accessRights | open access | |
| dspace.entity.type | Publication | en_US |
| unsw.accessRights.uri | https://purl.org/coar/access_right/c_abf2 | |
| unsw.description.publisherStatement | ©2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | en_US |
| unsw.identifier.doi | https://doi.org/10.26190/unsworks/498 | |
| unsw.publisher.place | Hong Kong | en_US |
| unsw.relation.faculty | Engineering | |
| unsw.relation.ispartofconferenceLocation | Hong Kong, China | en_US |
| unsw.relation.ispartofconferenceName | IEEE International Conference on Field-Programmable Technology (FPT) | en_US |
| unsw.relation.ispartofconferenceProceedingsTitle | 2002 IEEE International Conference on Field-Programmable Technology (FPT'02), Proceedings | en_US |
| unsw.relation.ispartofconferenceYear | 2002 | en_US |
| unsw.relation.ispartofpagefrompageto | 125-132 | en_US |
| unsw.relation.originalPublicationAffiliation | Guntsch, M | en_US |
| unsw.relation.originalPublicationAffiliation | Middendorf, M | en_US |
| unsw.relation.originalPublicationAffiliation | Scheuermann, B | en_US |
| unsw.relation.originalPublicationAffiliation | Diessel, Oliver, Computer Science & Engineering, Faculty of Engineering, UNSW | en_US |
| unsw.relation.originalPublicationAffiliation | ElGindy, Hossam, Computer Science & Engineering, Faculty of Engineering, UNSW | en_US |
| unsw.relation.originalPublicationAffiliation | Schmeck, H | en_US |
| unsw.relation.originalPublicationAffiliation | So, K, Computer Science & Engineering, Faculty of Engineering, UNSW | en_US |
| unsw.relation.school | School of Computer Science and Engineering | * |
Files
Original bundle
1 - 1 of 1