SOLVING QUADRATIC ASSIGNMENT PROBLEMS WITH RECTANGULAR DISTANCES AND INTEGER PROGRAMMING

The problem involves the assignment of n facilities to n specified locations. Each facility has a given nonnegative flow from each of the other facilities. The objective is to minimize the sum of transportation costs. Assume these n locations are given as points on a two-dimensional plane and transportation costs are proportional to weighted rectangular distances. Then the problem is formulated as a binary mixed integer program. The number of integer variables (all binary) involved equals the number of facilities squared. Without increasing the number of integer variables, the formulation is extended to include "site costs." Computational results of the formulation are presented.

  • Corporate Authors:

    Office of Naval Research

    Department of the Navy, 800 North Quincy Street
    Arlington, VA  USA  22217
  • Authors:
    • Love, R F
    • WONG, J Y
  • Publication Date: 1976-12

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00159675
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: Apr 12 1978 12:00AM