Optimization Online


Robust Quadratic Assignment Problem with Budgeted Uncertain Flows

Mohammad Javad Feizollahi (feizollahi***at***gatech.edu)
Hadi Feyzollahi (hfeyzollahi***at***ku.edu.tr)

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 (MIP) model for it. We also developed two different heuristics based on 2-Opt local search and tabu search methods to solve the proposed model for large-scale instances. A hybrid of tabu search and exact methods is considered. We discuss performance of these methods and the quality of robust solutions through extensive computational experiments.

Keywords: robust optimization; budgeted uncertainty; quadratic assignment problem; 2-Opt; tabu search

Category 1: Robust Optimization

Category 2: Integer Programming ((Mixed) Integer Nonlinear Programming )

Category 3: Applications -- Science and Engineering (Facility Planning and Design )

Citation: Feizollahi M. J., Feyzollahi H. "Robust Quadratic Assignment Problem with Budgeted Uncertain Flows," submitted, 2015.

Download: [PDF]

Entry Submitted: 05/29/2014
Entry Accepted: 05/29/2014
Entry Last Modified: 05/18/2015

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society