• 한국경영과학회지
• /
• 제6권1호
• /
• pp.25-32
• /
• 1981

The optimum design problem of a proposed oil pipeline network has been formulated as a zero-one programming model to determine the optimum sizes of pipe and pump which minimize the sum of material costs and operating costs during the 20 years of life span. Applying to a real situation, the problem constitutes an assignment type zero-one programming with 372 zero-one variables and 13 constraints. A heuristic algorithm has been developed based on the modified Petersen algorithm utilizing the special form of the activity matrix. The results showed impressive cost savings of 37 percent of the total cost from the original proposal.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1993년도 Fifth International Fuzzy Systems Association World Congress 93
• /
• pp.1334-1337
• /
• 1993

In this study, we newly formulated the link capcity allocation problem and the link capacity allocation and routing problem in an voice/data integrated network by the fuzzy set concept. We developed efficient algorithms for the above fuzzified problems and successfully showed that the fuzzy set theory is the powerful tool for the design problems in communication networks.

• Journal of Computing Science and Engineering
• /
• 제6권4호
• /
• pp.257-266
• /
• 2012

This paper overviews clock design problems related to the circuit reliability in deep submicron design technology. The topics include the clock polarity assignment problem for reducing peak power/ground noise, clock mesh network design problem for tolerating clock delay variation, electromagnetic interference aware clock optimization problem, adjustable delay buffer allocation and assignment problem to support multiple voltage mode designs, and the state encoding problem for reducing peak current in sequential elements. The last topic belongs to finite state machine (FSM) design and is not directly related to the clock design, but it can be viewed that reducing noise at the sequential elements driven by clock signal is contained in the spectrum of reliable circuit design from the clock source down to sequential elements.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2008년도 추계학술대회A
• /
• pp.695-700
• /
• 2008

Artificial neural network (ANN) has been extensively used in areas of nonlinear system modeling, analysis and design applications. Basically, ANN has its distinct capabilities of implementing system identification and/or function approximation using a number of input/output patterns that can be obtained via numerical and/or experimental manners. The paper describes a role of ANN, especially a back-propagation neural network (BPN) in the context of engineering analysis, design and optimization. Fundamental mechanism of BPN is briefly summarized in terms of training procedure and function approximation. The BPN based causality analysis (CA) is further discussed to realize the problem decomposition in the context of multidisciplinary design optimization. Such CA is also applied to quantitatively evaluate the uncoupled or decoupled design matrix in the context of axiomatic design with the independence axiom.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제32권4호
• /
• pp.247-257
• /
• 2005

일반적으로 네트워크 설계 문제는 네트워크의 크기가 늘어남에 따라 지수적으로 복잡도가 증가하여 전통적인 방법으로는 풀이하기 힘든 NP-hard 조합 최적화 문제 중의 하나로 분류될 수 있다. 본 논문에서는 네트워크 신뢰도 제약을 고려하면서 네트워크 구축비용을 효과적으로 최소화하는, 높은 신뢰도의 네트워크 토폴로지 설계 문제를 풀기 위해 스패닝 트리를 효율적으로 표현할 수 있는 Prufer수(PN) 기반의 진화 연산법과 2-연결성을 고려하는 휴리스틱 방법으로 구성된 두 단계의 효율적인 해법을 제안한다. 즉, 먼저 스패닝 트리를 찾아내기 위해 진화 연산법 중에 보편적으로 널리 알려져 있는 유전자 알고리즘(GA)을 이용하고 그 다음으로 첫 번째 단계에서 발견한 스패닝 트리에 대해 최적의 네트워크 토폴로지를 찾기 위해서 2-연결성을 고려한 휴리스틱 방법을 적용한다. 마지막으로 수치예의 결과를 통해 제안한 해법의 성능에 대해서 살펴보도록 한다.

• 대한산업공학회지
• /
• 제37권1호
• /
• pp.19-29
• /
• 2011

Cellular network is comprised of several base stations which serve cellular shaped service area and each base station (BS) is connected to the mobile switching center (MSC). In this paper, the configuration modeling and algorithm of a cellular mobile network with the aim of minimizing the overall cost of operation (handover) and network installation cost (cabling cost and installing cost of mobile switching center) are considered. Handover and cabling cost is one of the key considerations in designing cellular telecommunication networks. For real-world applications, this configuration study covers in an integrated framework for two major decisions: locating MSC and assigning BS to MSC. The problem is expressed in an integer programming model and a heuristic algorithm based on Lagrangian relaxation is proposed to resolve the problem. Searching for the optimum solution through exact algorithm to this problem appears to be unrealistic considering the large scale nature and NP-Completeness of the problem. The suggested algorithm computes both the bound for the objective value of the problem and the feasible solution for the problem. A Lagrangian heuristics is developed to find the feasible solution. Numerical tests are performed for the effectiveness and efficiency of the proposed heuristic algorithm. Computational experiments show that the performance of the proposed heuristics is satisfactory in the quality of the generated solution.

• Journal of Communications and Networks
• /
• 제16권1호
• /
• pp.45-55
• /
• 2014

The paper investigates the problem of designing the multiple-antenna relay in a two-way relay network by taking into account the imperfect channel state information (CSI). The objective is to design the multiple-antenna relay based upon the CSI estimates, where the estimation errors are included to attain the robust design under the worst-case philosophy. In particular, the worst-case transmit power at the multiple-antenna relay is minimized while guaranteeing the worst-case quality of service requirements that the received signal-to-noise ratio (SNR) at both sources are above a prescribed threshold value. Since the worst-case received SNR expression is too complex for subsequent derivation and processing, its lower bound is explored instead by minimizing the numerator and maximizing the denominator of the worst-case SNR. The aforementioned problem is mathematically formulated and shown to be nonconvex. This motivates the pursuit of semidefinite relaxation coupled with a randomization technique to obtain computationally efficient high-quality approximate solutions. This paper has shown that the original optimization problem can be reformulated and then relaxed to a convex problem that can be solved by utilizing suitable randomization loop. Numerical results compare the proposed multiple-antenna relay with the existing nonrobust method, and therefore validate its robustness against the channel uncertainty. Finally, the feasibility of the proposed design and the associated influencing factors are discussed by means of extensive Monte Carlo simulations.

• 산업경영시스템학회지
• /
• 제34권1호
• /
• pp.33-41
• /
• 2011

This paper considers a topological optimization of a network design with mean packet delay and node connectivity constraints. The objective is to find the topological layout of links, at minimal cost. This Problem is known to be NP-hard. To efficiently solve the problem, a scatter search algorithm is proposed. An illustrative example is used to explain and test the proposal approach. Experimental results show evidence that the proposal approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic approach.

• 한국정밀공학회지
• /
• 제15권9호
• /
• pp.15-24
• /
• 1998

In this research. we have proposed a new technique to determine .the combination of design parameters for the process design of a hot forged product using artificial neural network(ANN) and statistical design of experiments(DOE). The investigated problem involves the adequate selection of the aspect ratio of billet, the ram velocity and the friction factor as design parameters. An optimal billet satisfying the forming limitation, die filling, load and energy as well as more uniform distribution of effective strain, is determined by applying the ability of artificial neural network and considering the analysis of mean and variation on the functional requirement. This methodology will be helpful in designing and controlling parameters on the shop floor which would yield the best design solution.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.85-92
• /
• 2006

In this paper, we study a wireless cellular network design problem. It consists of selecting the location of the base station controllers and mobile service switching centres, selecting their types, designing the network into a tree-topology, and selecting the link types, while considering the location and the demand of base transceiver stations. We propose a constraint programming model and develop a heuristic combining local search and constraint programming techniques to find very good solutions in a reasonable amount of time for this category of problem. Numerical results show that our approach, on average, improves the results from the literature.