• Management Science and Financial Engineering
• /
• v.11 no.2
• /
• pp.85-103
• /
• 2005

In this paper, we consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it. Though the formulation has exponentially many variables, we solve the linear programming relaxation of it by using column generation technique. We devise a branch-and price algorithm to solve the column generation problem. After solving the linear programming relaxation, we apply a variable fixing procedure combined with the column generation to get an integral solution. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.2
• /
• pp.109-116
• /
• 2004

This paper deals with data association using 3 sets of passive linear array sonars (PUS) geometrically positioned in a Y-shaped configuration, but fixed in an underwater environment. The data association problem is directly transformed into a 3-D assignment problem, which is known to be NP-hard. For generic passive sensors, it can be sotted using conventional algorithms, while it in PLAS becomes a formidable task due to the presence of bearing ambiguity. In particular, we proposed data association method robust to bearing measurements errors by incorporating frequency information and analyze a region of ghost problem by geometrical relation PUS and target. We analyzed the effectiveness of the proposed method by representative simulation in multi-target.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.2
• /
• pp.159-165
• /
• 2005

This paper designs observers for matrix second-order linear systems on the basis of generalized eigenstructure assignment via unified parametric approach. It is shown that the problem is closely related with a type of so-called generalized matrix second-order Sylvester matrix equations. Through establishing two general parametric solutions to this type of matrix equations, two unified complete parametric methods for the proposed observer design problem are presented. Both methods give simple complete parametric expressions for the observer gain matrices. The first one mainly depends on a series of singular value decompositions, and is thus numerically simple and reliable; the second one utilizes the right factorization of the system, and allows eigenvalues of the error system to be set undetermined and sought via certain optimization procedures. A spring-mass system is utilized to show the effect of the proposed approaches.

• Journal of the military operations research society of Korea
• /
• v.18 no.1
• /
• pp.47-60
• /
• 1992

A class of allocation problems can be modeled in a linear programming formulation. But in reality, the coefficient of both the cost and constraint equations can not be generally determined by crisp numbers due to the imprecision or fuzziness in the related parameters. To account for this. a fuzzy version is considered and solved by transforming to a conventional non-linear programming model. This gives a solution as well as the degree that the solution satisfies the objective and constraints simultaneously and hence will be very useful to a decision maker. An attacker assignment problem for multiple fired targets has been modeled by a linear programming formulation by Lemus and David. in which the objective is to minimize the cost that might occur on attacker's losses during the mission. A fuzzy version of the model is formulated and solved by transforming it to a conventional nonlinear programming formulation following the Tanaka's approach. It is also expected that the fuzzy approach will have wide applicability in general allocation problems

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.920-925
• /
• 1993

For a multi-input, multi-output system, it is widely known that feedback control gain presents extra freedom pole placement problem. An eigenstructure assignment utilizes this freedom for assignment of all or some elements of the closed-loop eigenvectors. In this paper, a nonlinear optimization technique is adopted to obtain a small gain controller that assigns closed-loop eigenvalues and elements of eigenvectors simultaneously. To illustrate the approach, a numerical example of the Airplane mode decoupling using an advanced fighter is shown.

• 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.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.4
• /
• pp.37-45
• /
• 2022

In this paper, a multi agent-multi task assignment problem, which is a representative problem of combinatorial optimization, is presented. The objective of the problem is to determine the coordinated agent-task assignment that maximizes the sum of the achievement rates of each task. The achievement rate is represented as a concave down increasing function according to the number of agents assigned to the task. The problem is expressed as an NP-hard problem with a non-linear objective function. In this paper, to solve the assignment problem, we propose a hybrid cross-entropy algorithm as an effective and efficient solution methodology. In fact, the general cross-entropy algorithm might have drawbacks (e.g., slow update of parameters and premature convergence) according to problem situations. Compared to the general cross-entropy algorithm, the proposed method is designed to be less likely to have the two drawbacks. We show that the performances of the proposed methods are better than those of the general cross-entropy algorithm through numerical experiments.

• ETRI Journal
• /
• v.21 no.4
• /
• pp.9-22
• /
• 1999

This paper considers a problem of configuring both physical backbone and logical virtual path (VP) networks in a reconfigurable asynchronous transfer mode (ATM) network where links are subject to failures. The objective is to determine jointly the VP assignment, the capacity assignment of physical links and the bandwidth allocation of VPs, and the routing assignment of traffic demand at least cost. The network cost includes backbone link capacity expansion cost and penalty cost for not satisfying the maximum throughput of the traffic due to link failures or insufficient link capacities. The problem is formulated as a zero-one non-linear mixed integer programming problem, for which an effective solution procedure is developed by using a Lagrangean relaxation technique for finding a lower bound and a heuristic method exploited for improving the upper bound of any intermediate solution. The solution procedure is tested for its effectiveness with various numerical examples.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.8
• /
• pp.1434-1439
• /
• 2008

Numerical methods for solving the state feedback control problem of linear time invariant system are presented in this paper. The methods are based on Haar wavelet approximation. The properties of Haar wavelet are first presented. The operational matrix of integration and its inverse matrix are then utilized to reduce the state feedback control problem to the solution of algebraic matrix equations. The proposed methods reduce the computation time remarkably. Finally a numerical example is illustrated to demonstrate the validity and applicability of the proposed methods.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1458-1467
• /
• 1999

VLSI 공정 기술이 발달하면서 이웃한 전선 간의 간격이 점점 더 가까워 지고 있으며, 그에 따라 인접 전선 간의 혼신 문제가 심각해지고 있다. 본 논문에서는 3층 그리드 채널 배선에 적용 가능한 혼신을 최소화시키는 배선층 할당 방법을 제안한다. 이 방법은 선형 의사 불린 최적화 기법에 맞도록 고안되었으며, 적절한 변수 선택 휴리스틱과 상한값 추정 방법을 통하여 최적의 결과를 짧은 시간 안에 찾아낸다. 실험 결과를 통하여, 일반적인 0/1 정수 선형 프로그래밍 기법과 비교하여 성능과 수행시간 면에서 우수함을 보인다. Abstract Current deep-submicron VLSI technology appears to cause crosstalk problem severe since it requires adjacent wires to be placed closer and closer. In this paper, we deal with a horizontal layer assignment problem for three layer HVH channel routing to minimize coupling capacitance, a main source of crosstalk. It is formulated in a 0/1 integer linear programming problem which is then solved by a linear pseudo boolean optimization technique. Experiments show that accurate upper bound estimation technique effectively reduces crosstalk in a reasonable amount of running times.