• Title/Summary/Keyword: Max-flow/Min-distance

Search Result 5, Processing Time 0.022 seconds

The Random Type Quadratic Assignment Problem Algorithm

  • Lee, Sang-Un
    • 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.

The Grid Type Quadratic Assignment Problem Algorithm (그리드형 2차 할당문제 알고리즘)

  • Lee, Sang-Un
    • 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.

The Min-Distance Max-Quantity Assignment Algorithm for Random Type Quadratic Assignment Problem (랜덤형 2차원 할당문제의 최소 거리-최대 물동량 배정 알고리즘)

  • Lee, Sang-Un
    • 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.

Vehicle-induced aerodynamic loads on highway sound barriers part 2: numerical and theoretical investigation

  • Wang, Dalei;Wang, Benjin;Chen, Airong
    • Wind and Structures
    • /
    • v.17 no.5
    • /
    • pp.479-494
    • /
    • 2013
  • The vehicle-induced aerodynamic loads bring vibrations to some of the highway sound barriers, for they are designed in consideration of natural wind loads only. As references to the previous field experiment, the vehicle-induced aerodynamic loads is investigated by numerical and theoretical methodologies. The numerical results are compared to the experimental one and proved to be available. By analyzing the flow field achieved in the numerical simulation, the potential flow is proved to be the main source of both head and wake impact, so the theoretical model is also validated. The results from the two methodologies show that the shorter vehicle length would produce larger negative pressure peak as the head impact and wake impact overlapping with each other, and together with the fast speed, it would lead to a wake without vortex shedding, which makes the potential hypothesis more accurate. It also proves the expectation in vehicle-induced aerodynamic loads on Highway Sound Barriers Part1: Field Experiment, that max/min pressure is proportional to the square of vehicle speed and inverse square of separation distance.

Optimization of Measuring Cardiac Output by Both Hands Electrode Impedance Method (양손 전극의 임피던스법을 이용한 심박출량 측정의 최적화)

  • Jung, Sang-O;Sim, Myeong-Heon;Jung, Woon-Mo;Kim, Min-Yong;Yoon, Chan-Sol;Yoon, Hyung-Ro
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.9
    • /
    • pp.1770-1776
    • /
    • 2011
  • In this study, a new method that can estimate ICG data from a subject's both hands to measure Cardiac Output under convenient sensor environment. With this aim, a grip-type electrode was implemented to measure ICG. To improve the accuracy of measurement, the regression equation was extracted using multiple bio-parameters and our result was compared with the thoracic ICG equipment(Physio Flow$^{(R)}$, PF104D, Manatec Biomedical, France), which is being used in clinics. The subjects consist of 26 men and 4 women(age in $22.0{\pm}3.32$). They are no cardiac disease. Parameters available for regression model were used gender, BMI, MBP, LVET, dZ/dt(max), distance between the measured electrodes, body impedance, and PTT. As a result of analyzing the ICG measurement value on thorax and both hands, the correlation with stroke volume, heart rate, and cardiac output was $R^2$=0.853, $R^2$=0.958 and $R^2$=0.899, respectively.