A Computationally Simplified Pair-Exchange Algorithm for the Quadratic Assignment Problem

Abstract

Recently, considerable interest has been generated in efficient quadratic assignment problem algorithms as a result of computer-aided design automation system projects. Currently available QAP algorithms can be characterized as being computationally complex and requiring medium to large scale computers for implementation. Computer-aided design applications, however, are frequently centered around small process control computers with limited available memory so that the more sophisticated QAP procedures cannot be used. The paper presents a computationally simplified pair-exchange algorithm which has proven to be comparable with the currently available QAP algorithm and which is implementable on a small computer. A CDC 3800 FORTRAN 4 subroutine listing is included.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1972
Accession Number
AD0756503

Entities

People

  • Charles H. Heider

Organizations

  • Center for Naval Analyses

Tags

Communities of Interest

  • Biomedical
  • Energy and Power Technologies
  • Materials and Manufacturing Processes
  • Weapons Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Computer Programming
  • Computer Programs
  • Computers
  • Differential Equations
  • Engineering
  • Engineers
  • Equations
  • Health Services
  • Industrial Engineering
  • International Organizations
  • International Relations
  • Mathematics
  • Operations Research
  • Political Science
  • Test And Evaluation

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Approximation Theory.
  • Computer Science.