Recent Developments and challenges of Generalized Quadratic 3-Dimensional Assignment Problem (GQ3AP): the Multi-Story Facility Optimization

Exploring Solutions for an Innovative Assignment Problem in Facility Optimization

Abstract

The quadratic assignment problem (QAP) is known as one of the most interesting and challenging problems in combinatorial optimization. we propose two exact algorithms for the GQAP (generalized quadratic assignment problem). The facility space requirements, the location available space, the facility installation costs, the flows between facilities, and the distance costs between locations, one must assign each facility to exactly one location so that each location has sufficient space for all facilities assigned to it and the sum of the products of the facility flows by the corresponding distance costs plus the sum of the installation costs is minimized. The paper includes modeling new applications of the multi-story space assignment problem (MSAP) and the crossdock door assignment problem (CDAP), and developing solution methods for an innovative assignment problem, the generalized quadratic 3-dimensional assignment problem (GQ3AP).