Paper Info
Title
Solving terminal assignment problems with groups encoding: The wedding banquet problem
Abstract
This paper presents an extension of the terminal assignment problem (TA) in the case that groups of terminals must be assigned together. We analyze this situation by means of an equivalent problem: the wedding banquet problem (WBP). We provide a description of the problem and its mathematical definition. We also describe an application of the WBP to mobile communications network design. Two hybrid metaheuristics algorithms for the WBP are presented in the paper. We test their performance in several computational experiments, including synthetic instances of the WBP, and a mobile network design application.
Year
DOI
Venue
2006
10.1016/j.engappai.2005.10.003
Engineering Applications of Artificial Intelligence
Keywords
Field
DocType
Terminal assignment problem,Wedding banquet problem,Hybrid metaheuristics
Network planning and design,Computer science,Banquet,Generalized assignment problem,Assignment problem,Artificial intelligence,Cellular network,Mobile telephony,Encoding (memory),Metaheuristic
Journal
Volume
Issue
ISSN
19
5
0952-1976
Citations 
PageRank 
References 
5
0.47
16
Authors
4
Name
Order
Citations
PageRank
Sancho Salcedo-Sanz158071.21
José A. Portilla-Figueras2181.81
Fernando García-Vázquez350.47
Silvia Jiménez-Fernández4295.46