Artikel

Robust quadratic assignment problem with budgeted uncertain flows

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.

Language
Englisch

Bibliographic citation
Journal: Operations Research Perspectives ; ISSN: 2214-7160 ; Volume: 2 ; Year: 2015 ; Pages: 114-123 ; Amsterdam: Elsevier

Classification
Wirtschaft
Subject
Robust optimization
Budgeted uncertainty
Quadratic assignment problem
2-Opt
Tabu search

Event
Geistige Schöpfung
(who)
Feizollahi, Mohammad Javad
Feyzollahi, Hadi
Event
Veröffentlichung
(who)
Elsevier
(where)
Amsterdam
(when)
2015

DOI
doi:10.1016/j.orp.2015.06.001
Handle
Last update
10.03.2025, 11:46 AM CET

Data provider

This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.

Object type

  • Artikel

Associated

  • Feizollahi, Mohammad Javad
  • Feyzollahi, Hadi
  • Elsevier

Time of origin

  • 2015

Other Objects (12)