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

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.4
• /
• pp.303-315
• /
• 2005

In this paper we address a design problem for hub-and-spoke networks and then consider a capacitated hub locations problem with direct shipment (CHLPwD). We determine the location of hubs, the allocation of nodes to hubs, and direct shipment paths in the network, with the objective of minimizing the total cost in the network. In this paper, CHLPwD is formulated as 0-1 integer programming. We develop an evolutionary algorithm here to solve the large sized CHLPwD. To do this, we present the representation and the genetic operators suitable for the problem and propose a heuristic method for the allocation of nodes to hubs. To enhance the search capability, problem-specific information is used in our evolutionary algorithm. The proposed algorithm is compared with the heuristic method in terms of solution quality and computation time. The experimental results show that our algorithm can provide better solutions than the heuristic.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.19 no.4
• /
• pp.443-452
• /
• 2016

Current low-altitude radar system often fails to detect small unmanned aerial vehicles (UAV) because of their small radar cross section (RCS) compared with larger targets. As a potential alternative, a passive bistatic radar system has been considered. We study an optimal deployment problem for the passive bistatic radar system. We model this problem as a covering problem, and develop an integer programming model. The objective of the model is to maximize coverage of a passive bistatic radar system. Our model takes into account factors specific to a bistatic radar system, including bistatic RCS and transmitter-receiver pair coverage. Considering bistatic RCS instead of constant RCS is important because the slight difference of RCS value for small UAVs could significantly influence the detection probability. The paired radar coverage is defined by using the concept of gradual coverage and cooperative coverage to represent a realistic environment.

• Korean Management Science Review
• /
• v.32 no.1
• /
• pp.49-63
• /
• 2015

This paper investigates an aircraft-target assignment problem in consideration of deconfliction. The aircraft-target assignment problem is the problem to assign available aircrafts and weapons to targets that should be attacked, where the objective function is to minimize the total expected damage of aircrafts. Deconfliction is the way of dividing airspaces for aircraft flight to ensure the safety while performing the mission. In this paper, mixed integer programming model is suggested, where it considers deconfliction between aircrafts. However, the suggested MIP model is non-linear and limited to get solution for large size problem. The 2-phase decomposition model is suggested for efficiency and computation, where in the first phase target area is divided into sectors for deconfliction and in the second phase aircrafts and weapons are assigned to given targets for minimizing expected damage of aircraft. The proposed decomposition model shows outperforms the model developed for comparison in the computational experiment.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.1
• /
• pp.14-24
• /
• 2002

We focus on resource allocation planning in container terminal operation planning problems and present network design model and genetic algorithm. We present a network design model in which arc capacities must be properly dimensioned to sustain the container traffic. This model supports various planning aspects of container terminal and brings in a very general form. The integer programming model of network design can be extended to accommodate vertical or horizontal yard configuration by adding constraints such as restricting the sum of yard cranes allocated to a block of yards. We devise a genetic algorithm for the network design model in which genes have the form of general integers instead of binary integers. In computational experiments, it is found that the genetic algorithm can produce very good solution compared to the optimal solution obtained by CPLEX in terms of computation time and solution quality. This algorithm can be used to generate many alternatives of a resource allocation plan for the container terminal and to evaluate the alternatives using various tools such as simulation.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.2
• /
• pp.241-249
• /
• 1998

In this paper, we seek to find an optimal allocation of link capacity in a data communication network. The architecture of the data communication network considered in the study is an online-service network based on public switched telephone network(PSTN) and packet switched data network(PSDN). In designing the architecture of the network, we need to deal with various measures of quality of service(QoS). Two important service measures are the call blocking probability in PSTN and the data transfer delay time in PSDN. Considering the tradeoff between the call blocking probability and the data transfer delay time in the network, we have developed the optimal link capacity allocation model that minimizes the total link cost, while guarantees the call blocking probability and the data transfer delay time within an acceptable level of QoS. This problem can be formulated as a non-linear integer programming model. We have solved the problem with tabu search and simulated annealing methods. In addition, we have analyzed the sensitivity of the model and provided the insight of the model along with computational results.

• IE interfaces
• /
• v.17 no.spc
• /
• pp.141-151
• /
• 2004

As today's business environment has become more and more competitive, forward as well as backward flows of products among members belonging to a supply chain have been increased. The backward flows of products, which are common in most industries, result from increasing amount of products that are returned, recalled, or need to be repaired. Effective management for the backward flows of products has become an important issue for businesses because of opportunities for simultaneously enhancing profitability and customer satisfaction from returned products. Since third party logistics service providers (3PLs) are playing an important role in reverse logistics operations, they should perform two simultaneous logistics operations for a number of different clients who want to improve their logistics operations for both forward and reverse flows. In this case, distribution networks have been independently designed with respect to either forward or backward flows so far. This paper proposes a mixed integer programming model for the design of network integrating both forward and reverse logistics. Since the network design problem belongs to a class of NP-hard problems, we present an efficient heuristic algorithm based on genetic algorithm (GA), of which the performance is compared to the lower bound by Lagrangian relaxation. Finally, the validity of proposed algorithm is tested using numerical examples.

• Journal of Korean Society of Transportation
• /
• v.19 no.5
• /
• pp.99-108
• /
• 2001

A framework of using and integrating GIS and OR tools for determining the best site selection has been provided. In this research, we demonstrated that both the P-Median heuristic method and MIP method can be successfully applied to the optimum site selection problem of oil tank location selection. Furthermore, the results identified by both approaches are identical. To accomplish this, both GIS road and maritime networks have been constructed and combined to calculated the minimum distance matrix, which is required by both approaches. After the application to the Korean peninsula, the facility locations chosen are Kunsan, Yosu, Busan, and Okgye for each district. As has been shown, the power of GIS and both algorithm have been demonstrated throughout the research and further similar research can also be conducted using the power of GIS and Operations Research tools.

• Journal of Korean Society of Transportation
• /
• v.17 no.5
• /
• pp.111-122
• /
• 1999

A service network design model for LTL freight transportation is formulated as a mixed integer Programming Problem with two heuristic solution a1gorithms. The Proposed model derives the transportation Path for each origination-destination pair, taking into account transportation cost over the links and handling costs over the nodes. The first algorithm searches for a local minimum solution from a given initial solution by improving the quality of solution repeatedly while the second a1gorithm searches for a better solution using Simulated Annealing Method. For both solution algorithms, the initial solution is derived by a modified reverse Diikstras shortest Path a1gorithm. An illustrative example, Presented in the last part of the Paper, shows that the proposed algorithms find solutions which reduce the cost by 12% and 15% respectively, compared to the initial solution.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1992.04b
• /
• pp.415-424
• /
• 1992

본 논문에서는 정수선형계획법을 반도체 설계자동화과정에 이용한 예를 보인다. 반도체 설계자동화과정은 매우 여러 단계를 거치게 되는데, 본 논문에서는 상위수준 합성중 스케쥴링(scheduling)문제에 정수선형계획법을 응용하였다. 여기서 스케쥴링 문제는 설계자동화의 초기단계에서 알고리듬으로 주어진 입력을 하드웨어 요소들로 표현하는 과정에서 매 제어단계(control step)에서 수행하여야 할 연산내용을 결정하는 문제이다. 스케쥴링의 목적함수는 주어진 제어단계 갯수내에서 하드웨어 비용의 최소화이다. 이를 위해 우선 ASAP(As Soon As Possible)과 ALAP(As Late As Possible)방법을 이용하여 매 연산의 수행시작이 가능한 가장 빠른 시간과 가장 늦은 시간을 구한다. 이 두 시간 사이가 각 연산의 time frame이 되며 이를 이용하여 스케쥴링 문제를 정수 선형 계획법으로 공식화하여 풀었다. 이 공식화는 chaining, multicycle연산, pipeline data path, pipeline기능 유닛등에도 일반화하여 적용가능함을 보인다. 실험을 통해 본 공식화 방법이 기존 알고리듬에 의한 해보다 우수한 해를 제공함을 보인다. 비교를 위해 잘 알려진 benchmark회로인 bandpass filter를 이용하였는데 이 회로는 8개의 덧셈, 7개의 뺄셈 및 12개의 곱셈연산을 포함하고 있다. 제시된 알고리듬은 이 회로를 8개의 제어단계내에 총비용 675 (연산별 하드웨어 비용은 라이브러리로 주어짐)로 스케쥴링하였는데 이는 기존의 최상의 결과인 685보다 우수한 결과이다.