Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/178255 
Year of Publication: 
2015
Citation: 
[Journal:] Operations Research Perspectives [ISSN:] 2214-7160 [Volume:] 2 [Publisher:] Elsevier [Place:] Amsterdam [Year:] 2015 [Pages:] 114-123
Publisher: 
Elsevier, Amsterdam
Abstract: 
We consider a generalization of the classical quadratic assignment problem, where material flows between facilities are uncertain, and belong to a budgeted uncertainty set. The objective is to find a robust solution under all possible scenarios in the given uncertainty set. We present an exact quadratic formulation as a robust counterpart and develop an equivalent mixed integer programming model for it. To solve the proposed model for large-scale instances, we also develop two different heuristics based on 2-Opt local search and tabu search algorithms. We discuss performance of these methods and the quality of robust solutions through extensive computational experiments.
Subjects: 
Robust optimization
Budgeted uncertainty
Quadratic assignment problem
2-Opt
Tabu search
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.