Space-planning by ant colony optimisation
by J.A. Bland
International Journal of Computer Applications in Technology (IJCAT), Vol. 12, No. 6, 1999

Abstract: In this paper, a new heuristic combinatorial optimisation algorithm, called ant colony optimisation (ACO), is applied to the space-planning problem of determining an optimal assignment of activities (administrative functions/personnel) to locations (offices) for an organisation housed in an office block. This problem arises, for example, when a commercial organisation wishes to reduce (i.e. minimise) the amount of physical movement within its building(s) (e.g. flow of paperwork and personnel) in an attempt to improve operational efficiency. The ACO algorithm is motivated by analogy with natural phenomena, in particular, the ability of a colony of ants to ''optimise their collective endeavours''. In this paper, the biological background for ACO is explained and its computational implementation is presented in a space-planning context. The particular implementation of ACO makes use of a tabu search (TS) local improvement phase to give a computationally enhanced algorithm (ACOTS). Two examples are then used to show that ACOTS is a useful and viable optimisation technique to obtain layout designs for large-scale space-planning problems.

Online publication date: Sun, 13-Jul-2003

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com