Xu, Shuo, Ji, Ze ORCID: https://orcid.org/0000-0002-8968-9902, Pham, Duc Truong and Yu, Fan 2011. Binary Bees Algorithm - bioinspiration from the foraging mechanism of honeybees to optimize a multiobjective multidimensional assignment problem. Engineering Optimization 43 (11) , pp. 1141-1159. 10.1080/0305215X.2010.542812 |
Abstract
The simultaneous mission assignment and home allocation for hospital service robots studied is a Multidimensional Assignment Problem (MAP) with multiobjectives and multiconstraints. A population-based metaheuristic, the Binary Bees Algorithm (BBA), is proposed to optimize this NP-hard problem. Inspired by the foraging mechanism of honeybees, the BBA's most important feature is an explicit functional partitioning between global search and local search for exploration and exploitation, respectively. Its key parts consist of adaptive global search, three-step elitism selection (constraint handling, non-dominated solutions selection, and diversity preservation), and elites-centred local search within a Hamming neighbourhood. Two comparative experiments were conducted to investigate its single objective optimization, optimization effectiveness (indexed by the S-metric and C-metric) and optimization efficiency (indexed by computational burden and CPU time) in detail. The BBA outperformed its competitors in almost all the quantitative indices. Hence, the above overall scheme, and particularly the searching history-adapted global search strategy was validated.
Item Type: | Article |
---|---|
Date Type: | Published Online |
Status: | Published |
Schools: | Engineering |
Publisher: | Taylor & Francis: STM, Behavioural Science and Public Health Titles |
ISSN: | 0305-215X |
Date of Acceptance: | 9 August 2010 |
Last Modified: | 23 Oct 2022 13:14 |
URI: | https://orca.cardiff.ac.uk/id/eprint/110040 |
Citation Data
Cited 5 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
Edit Item |