• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.14 no.6
• /
• pp.1375-1383
• /
• 1994

The water distribution system problem consists of finding a minimum cost system design subject to hydraulic and operational constraints. Since the municipal water distribution system problem is nonconvex with multiple local minima, classical optimization methods find a local optimum. An outer flow search - inner optimization procedure is proposed for choosing a better local minimum for the water distribution systems. The pipe network is judiciously subjected to the outer search scheme which chooses alternative flow configurations to find an optimal flow division among pipes. Because the problem is nonconvex, a global search scheme called Stochastic Probing method is employed to permit a local optimum seeking method to migrate among various local minima. A local minimizer is employed for the design of least cost diameters for pipes in the network. The algorithm can also be employed for optimal design of parallel expansion of existing networks. In this paper one municipal water distribution system is considered. The optimal solutions thus found have significantly smaller costs than the ones reported previously by other researchers.

• Journal of Korean Society of Steel Construction
• /
• v.23 no.5
• /
• pp.581-593
• /
• 2011

The underlying advantages of using thin-walled corrugatedwebs instead of plate girders with stiffeners are the elimination of instability problems associated with buckling of the thin-walled flat plate, and elimination of the need for transverse stiffeners, which alsoresults in economic advantages. This paper focuses on two aspects related to the structural design technique forsinusoidal corrugated web steel beams, and the optimum design of the beams using real-value genetic algorithms. The structural design process and design variables used in this optimization werecomposed with EN 1993-1-5, DASt-R015 standard and Pasternak et al. (2004), and the valid design capacity of shear buckling of the standards were compared. For the optimum structural design, the objective function, presented as the fullweight of the sinusoidal corrugated web beams, and the slenderness, member forces, and maximum deflection of the beam, were considered constraints. Finally, the simple beam under the uniform load was adopted as a numerical example, and the effective probability parameters of the genetic operators were considered to find the global minimum point.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.224-232
• /
• 2002

The routing protocols designed for wired networks can hardly be used for mobile ad-hoc networks due to limited bandwidth of wireless transmission and unpredictable topological change. Recently, several routing protocols for mobile ad-hoc networks have been proposed. However, when these protocols are applied to support real time services like multimedia transmission, they still have problems in ad-hoe networks, where the topology changes drastically. In this paper, we propose a new route selection algorithm which selects the most reliable rouse that is impervious to route failures by topological changes by mobile hosts. For reliable route selection, the concept of virtual zone (stable lone and caution zone) is proposed. The lone is located in a mobile node's transmission range and determined by mobile node's mobility information received by Global Positioning System (GPS). The proposed algorithm is applied to the route discovery procedure of the existing on-demand routing protocol, AODV, and evaluated by simulation in various traffic conditions and mobility patterns.

• Journal of the Korean Geographical Society
• /
• v.46 no.6
• /
• pp.724-737
• /
• 2011

The goal of solving a contiguous land acquisition problem is to find an optimal cluster of land parcels so that one can move from an acquired parcel to another without leaving the cluster. In many urban and regional planning applications, criteria such as acquisition cost and compactness of acquired parcels are important. Recent research has demonstrated that spatial contiguity can be formulated in a mixed integer programming framework. Spatial compactness, however, is typically formulated in an approximate manner using parameters such as external border length or other shape indices of acquired land parcels. This paper first develops an alternative measure of spatial compactness utilizing the characteristics of the internal structure of a contiguous set of land parcels and then incorporates this new measure into a mixed integer program of contiguous land acquisition problems. A set of computational experiments are designed to demonstrate the use of our model in a land acquisition context.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.05a
• /
• pp.143-143
• /
• 2001

조선 산업에서의 이익 극대화를 위해서는, 공기 단축을 통한 매출 증대, 주어진 생산 자원(인력, 설비 등)의 효율적인 이용을 통한 생산비 절감이 필수적인 사안이다. 다시 말하면, 효율적인 자원의 이용으로 선박의 건조 공기를 줄임으로써 조선 산업에서의 이익 극대화를 도모할 수 있고 이는 효과적인 생산 계획과 관리를 통해 얻을 수 있다. 조선 산업에서의 생산 계획과 관리는 내업, 선행, 선내 등 선박 건조의 전 과정에서 이루어지고 있는데, 조선 산업은 타 산업에 비해 환경변화에 따른 단기간의 불확실성은 비교적 적은 반면에, 가공, 절단, 조립, 의장, 도장, 선행탑재, 탑재, 안벽 작업 등 다단계 제조 프로세스가 장기간에 걸쳐 상당히 복잡하게 구성되어 있다. 또한, 유연하게 적용할 수 있는 인적자원과 공정순서, 그리고 각종 시간적 공간적 자원 제약 등으로 인하여 효과적이고 일관된 생산 계획을 신속하게 수립하기가 어려울 뿐만 아니라, 주문 생산 방식이기 때문에 정확한 일정계획 데이터의 생성도 어려운 실정이다. 본 연구는, 조선의 혁신적인 생산관리 능력 향상을 지원하기 위한 "조선 통합 생산계획 시스템 개발" 에 관련된 연구이다. 본 연구에서는 조선 생산계획에 적합한 일정계획 방법론 및 엔진 소프트웨어를 활용하고 총체적인 생산계획 및 일정계획 업무의 개념 재정립을 통하여, 통합 최적화를 실시간에 지원하는 조선 최적 일정계획 시스템 구축에 궁극적인 목적을 두고 있다. 이를 위해 본 연구에서는 조선 프로세스와 일정계획 업무규칙을 분석하고 이를 바탕으로 "조선 최적 일정계획 시스템"을 개발하였다. 조선 최적 일정계획 시스템은 블록, PE, 탑재, 선내 단계의 일정계획 최적화와 What-if Simulation을 지원하기 위하여 ILOG Solver/scheduler로 구현하였으며, 구현된 시스템에 대해 실제 계획에서 사용하는 데이터를 대상으로 다양한 최적화 기능에 대한 실험을 실시하였다. 실제 데이터를 이용한 실험결과, 풀이시간과 최적해 측면 모두에서 비교적 만족할 만한 결과를 보여주었다.교적 만족할 만한 결과를 보여주었다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.2
• /
• pp.59-66
• /
• 2013

In this paper, we proposed an optimal ILP algorithm on memory address code generation for DSP in embedded system. This paper using 0-1 ILP formulations DSP address generation units should minimize the memory variable data layout. We identify the possibility of the memory assignment of variable based on the constraints condition, and register the address code which a variable instructs in the program pointer. If the process sequence of the program is declared to the program pointer, then we apply the auto-in/decrement mode about the address code of the relevant variable. And we minimize the loads on the address registers to optimize the data layout of the variable. In this paper, in order to prove the effectiveness of the proposed algorithm, FICO Xpress-MP Modeling Tools were applied to the benchmark. The result that we apply a benchmark, an optimal memory layout of the proposed algorithm then the general declarative order memory on the address/modify register to reduce the number of loads, and reduced access to the address code. Therefor, we proved to reduce the execution time of programs.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.38-42
• /
• 2008

In the 2000s, the PC package game market has withered, but the internet based on-line game, the wireless internet based mobile game and high-powered console game market have been main stream. Among those markets, mobile game market has rapidly increased because it has 'mobility' that overcomes the limitation of time and area. But, unlike other platforms, mobile game user have to pay the higher price for download mobile game contents through the wireless internet and mobile game developer have to overcome the limitation of storage memory capacity.of mobile phone. Chiefly, the image data consume the storage capacity of mobile game contents, this paper present a technology to optimize image data for mobile game contents through analyzing type of compression method and image formats.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.34 no.6
• /
• pp.347-353
• /
• 2021

In this study, we presented a novel size optimization framework to control the linear buckling temperature and several buckling modes of plates, by optimizing thickness values of composite structures for practical engineering applications. Predicting the buckling temperature and mode shape of structures is a vital research topic in engineering to achieve structural stability. However, optimizing designs of engineering structures through engineering intuition is challenging. To address this limitation, we proposed a method that combines finite element simulation and size optimization. Based on the idea that the structural buckling temperature and mode shape of a plate are affected by the thickness of the structure, the thickness values of the nodes of the target structure were set as the design variables in this optimization method; and the buckling temperature values, and buckling mode shapes were set as the objective functions. This size optimization method enabled the determination of optimal thickness distributions, to induce the desired buckling temperature values and mode shapes. The validity of the proposed method was verified in terms of their buckling temperature values and buckling mode shapes, using several numerical examples of rectangular composite structures.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.12 no.1
• /
• pp.59-70
• /
• 1992

Quadratic programming problems(QP) have been widely used as a direction-finding subproblem in the engineering and structural design optimization. To develop an efficient solution algorithm for the QP subproblems, theoretical aspects and numerical behavior of mathematical programming methods that can be used as QP solver are studied and compared. For the solution of both primal and dual QP, Simplex, gradient projection(GRP), and augmented Lagrange multiplier algorithms are investigated and coded. From the numerical study, it is found that the primal GRP algorithm with potential constraint strategy and the dual Simplex algorithm are more attractive and effective than the others. They have theoretical robustness as well. Moreover, primal GRP algorithm is preferable in case the number of constraints is larger than the number of design variables. Favorable features of GRP and Simplex algorithm are merged into a combined algorithm, which is useful in the structural design optimization.

• Journal of the Korean Geographical Society
• /
• v.49 no.3
• /
• pp.423-437
• /
• 2014

Districting is a spatial decision making process to make a new regional framework for affecting human activities. Natural barriers such as rivers and mountains located within a reorganized district may reduce the efficiency of reorganized human activities. This implies that it is necessary to consider boundary characteristics in a districting process. The purpose of this research is to develop a new spatial optimization model based on boundary characteristics for districting problems. The boundary characteristics are evaluated as continuous value expressing the possibility of combining adjacent two basic spatial units rather than a dichotomous value with 1 or 0 and are defined as an objective function in the model. In addition, the model has explicitly formulated contiguity constraints as well as constraints enforcing demand balance among districts such as population and area. The boundary attributes are categorized into physical and relational characteristics. Suitability analysis is used to combine various variables related to each boundary characteristic and to evaluate the coupling possibility between two neighboring basic units. The model is applied to an administrative redistricting problem. The analytical results demonstrate that various boundary characteristics could be modeled in terms of mixed integer programming (MIP).