Lim, W. L. and Alias, M. A. S. and Haron, H.
(2016)
*A hybrid metaheuristic for the generalized quadratic assignment problem.*
In: IEEE Student Conference on Research and Development, SCOReD 2015, 13 - 14 Dec 2015, Kuala Lumpur, Malaysia.

Full text not available from this repository.

Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....

## Abstract

The generalized quadratic assignment problem (GQAP) concerns with assigning m facilities to n locations. Multiple facilities can be assigned to a single location as long as the space allows. The aim is to find a way of assignment such that the total cost involved is minimized while respecting the space constraints. The total cost composes of installation and transportation costs, which is obtained by multiplying the facility flows and distances. GQAP is the generalization of the well-known quadratic assignment problem, which requires the number of facilities and locations to be the same and exactly one facility is assigned to one location. This paper presents a hybrid metaheuristic for solving the GQAP. The proposed algorithm hybridizes biogeography-based optimization with tabu search. Experimental results show that the hybrid metaheuristic is able to solve problem instances obtained from a manufacturing company, within reasonable computational times.

Item Type: | Conference or Workshop Item (Paper) |
---|---|

Uncontrolled Keywords: | assignment problem, biogeography-based optimization, combinatorial optimization, metaheuristic, tabu search |

Subjects: | Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science |

Divisions: | Computing |

ID Code: | 73315 |

Deposited By: | Mohd Zulaihi Zainudin |

Deposited On: | 20 Nov 2017 08:42 |

Last Modified: | 20 Nov 2017 08:42 |

Repository Staff Only: item control page