• Journal of Korean Institute of Industrial Engineers
• /
• v.5 no.1
• /
• pp.45-51
• /
• 1979

This paper presents a heuristic solution procedure for the quadratic assignment problem, ranking procedure, which can handle the case where not all of the facilities have the same size of area. The ranking procedure is found more efficient than two other existing heuristic procedures from results of computational experience. Based on the out-patients flow pattern and the procedure developed, an improved layout of the three existing general hospitals is developed with the objective of minimizing the total distance travelled by patients in the central and the out-patient clinic.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.3
• /
• pp.201-207
• /
• 2018

There is no known polynomial time algorithm for random-type quadratic assignment problem(RQAP) that is a NP-complete problem. Therefore the heuristic or meta-heuristic approach are solve the approximated solution for the RQAP within polynomial time. This paper suggests polynomial time algorithm for random type quadratic assignment problem (QAP) with time complexity of $O(n^2)$. The proposed algorithm applies one-to-one matching strategy between ascending order of sum of distance for each location and descending order of sum of quantity for each facility. Then, swap the facilities for reflect the correlation of distances of locations and quantities of facilities. For the experimental data, this algorithm, in spite of $O(n^2)$ polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.884-889
• /
• 1989

In this paper, a new procedure for selecting weighting matrices in linear discrete time quadratic optimal control problem (LQ-problem) is proposed. In LQ-problems, the quadratic weighting matrices are usually decided on trial and error in order to get a good response. But using the proposed method, the quadratic weights are decided in such a way that all poles of the closed loop system are located in a desired region for good responses as well as for stability and values of the quadratic cost function are kept less then a specified value.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.402-408
• /
• 2003

Now many major airports in the world which operate strategic alliance or Hub & Spoke system have met capacity restriction and confusion problems. And the time and the walking distance for boarding to flight are important standard to measure customer convenience. And the effective gate assignment guarantees customers convenience as well as increasing airport capacity without expanding established airport equipments. So it can be a major concern to manage airports. So this paper formulate gate assignment problem in the hub airport not quadratic assignment problem but a improved single-period integer problem which is minimize local and transit passengers I walking distance. As a result, this study will present a method producing optimal gate assignment result using optimization software. We use real flights and gates data in the national airport, so we will compare a assignment results with a real airport assignment results and previous researches and analyze those results.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.81-88
• /
• 2016

The optimal solution of quadratic assignment problem (QAP) cannot get done in polynomial time. This problem is called by NP-complete problem. Therefore the meta-heuristic techniques are applied to this problem to get the approximated solution within polynomial time. This paper proposes an algorithm for a random type QAP, in which the instance of two nodes are arbitrary. The proposed algorithm employs what is coined as a max flow-min distance rule by which the maximum flow node is assigned to the minimum distance node. When applied to the random type QAP, the proposed algorithm has been found to obtain optimal solutions superior to those of the genetic algorithm.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1997.11a
• /
• pp.535-552
• /
• 1997

The facility layout problem has the goal of locating the different facilities in a floor to achieve the greatest efficiency in producing a product or service. This problem is usually formulated as the quadratic assignment problem(QAP). However, the problem of finding optimal layout is hard and traditional approaches are not computationally feasible. In this paper, a genetic algorithm is presented for obtaining efficient layouts. To test the effectiveness of the algorithm, a set of examples is solved and the results are compared to those from other Known algorithms. The comparison indicates that the proposed method performs well for the classical test problems.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.4
• /
• pp.91-99
• /
• 2014

TThis paper suggests an heuristic polynomial time algorithm to solve the optimal solution for QAP (quadratic assignment problem). While Hungarian algorithm is most commonly used for a linear assignment, there is no polynomial time algorithm for the QAP. The proposed algorithm derives a grid type layout among unit distances of a distance matrix. And, we apply max-flow/min-distance approach to assign this grid type layout in such a descending order way that the largest flow is matched to the smallest unit distance from flow matrix. Evidences from implementation results of the proposed algorithm on various numerical grid type QAP examples show that a solution to the QAP could be obtained by a polynomial algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10b
• /
• pp.729-733
• /
• 1988

In this paper, a new procedure for selecting weighting matrices in linear discrete time quadratic optimal control problems (LQ-problem) is proposed. In LQ problems, the quadratic weighting matrices are usually decided on trial and error in order to get a good response. But using the proposed method, the quadratic weights are decided in such a way that all poles of the closed loop system are located in a desired area for good responses as well as for stability and values of the quadratic cost functional are kept less then a specified value. The closed loop systems constructed by this method have merits of LQ problems as well as those of pole assignment problems. Taking into consideration that little is known about the relationship among the quadratic weights, the poles and the values of cost functional, this procedure is also interesting from the theoretical point of view.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.5
• /
• pp.66-70
• /
• 1997

This paper presents a parallel combinatorial variant of evolution strategy (PCES) to solve well-known combinatorial optimization problems, Quadratic assignment problems (QAPs). The PCES reduces the possibility of getting stuck in local minima due to maintenance of subpopulation and thus it is more effective than the CES. Experiment results on two benchmark problems show that the PCES is better than the cES and the genetic algorithm(GA).

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.3
• /
• pp.57-64
• /
• 2016

This paper deals with the PCB assembly time minimization problem that the PAP (pick-and-placement) machine pickup the K-weighted group of N-components, loading, and place into the PCB placement location. This problem considers the rotational turret velocity according to component weight group and moving velocity of distance in two component placement locations in PCB. This paper suggest heavy-weight component group first pick-and-place strategy that the feeder sequence fit to the placement location Hamiltonean cycle sequence. This algorithm applies the quadratic assignment problem (QAP) that considers feeder sequence and location sequence, and the linear assignment problem (LAP) that considers only feeder sequence. The proposed algorithm shorten the assembly time than iATMA for QAP, and same result as iATMA that shorten the assembly time than ATMA.