### DETERMINING INITIAL ASSIGNMENT FOR SOLVING QUADRATIC ASSIGNMENT PROBLEMS

#### Abstract

The Quadratic Assignment Problem is a combinatorial problem of

deciding the placement of facilities in specified locatians in such a way

that will to minimize an objective function expressed in terms of

distance each location and flows each facilities. First they a simple

heuristic approach is used to obtain an initial assignment point..

Hetristic Tabu search method is the implemented in other to get

another assignment point, which in tum will be used as a starting point

for Nonlinier Programing approach. The continuous result of nonlinier

programing problem are the prosesed using another heuristic method to

obtain an integer feasible solution to the quadratic assignment problem.

The non convex behavior of the problem suggests that a good starting

is necessary in order to obtain global solution. The procedure is then

implemented on Backboard Wiring problem with dimension 20 x 20.

Keywords; Quadratic Assignment problems; Tabu Search.

#### Full Text:

PDF### Refbacks

- There are currently no refbacks.