Title

Methodology For An Orderly Quadratic Assignment Problem

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Comput. Ind. Eng.

Keywords

Computer Science; Interdisciplinary Applications; Engineering; Industrial

Abstract

An assignment arrangement problem (AAP), in which an arrangement represents a geometric straight line joining two pre-defined points (for facility and location), is introduced. This problem is a special class of QAP, and is different from all existing QAP's, as it requires a pre-established order between all assignments included in addition to a multi-objective function involved. It is shown that this un-conventional problem cannot be solved using current conventional exchange heuristic procedures. A new pairwise exchange is developed and programmed for solution and evaluation. The AAP and the solution procedure introduced are flexible and may be applicable to other problems which fit the general QAP formulation.

Journal Title

Computers & Industrial Engineering

Volume

13

Issue/Number

1-4

Publication Date

1-1-1987

Document Type

Article

Language

English

First Page

281

Last Page

284

WOS Identifier

WOS:A1987J493800060

ISSN

0360-8352

Share

COinS