• Computational Structural Engineering : An International Journal
• /
• v.2 no.1
• /
• pp.11-17
• /
• 2002

Cost-effectiveness in design is considered for determining the target reliability of concrete bridges under seismic actions. This objective can be achieved based on the economic optimization of the expected life-cycle cost of a bridge, which includes initial cost, direct losses, and indirect losses of a bridge due to strong earthquakes over its lifetime. A separating factor is defined to consider the redundancy of a transportation network. The Park-Ang damage model is employed to define the damage of a bridge under seismic action, and a Monte Carlo method based on the DRAIN-2DX program is developed to assess the failure probability of a bridge. The results for an example bridge analyzed in this paper show that the optimal target failure probability depends on the traffic volume carried by the bridge and is between 1.0×10/sup -3/ to 3.0×10/sup -3/ over a life of 50 years.

• International Journal of CAD/CAM
• /
• v.9 no.1
• /
• pp.85-91
• /
• 2010

In this paper, we demonstrate an autonomous design of motion control of virtual creatures (called animated robots in this paper) and develop modeling software for animated robots. An animated robot can behave autonomously by using its own sensors and controllers on three-dimensional physically modeled environment. The developed software can enable us to execute the simulation of animated robots on physical environment at any time during the modeling process. In order to simulate more realistic world, an approximate fluid environment model with low computational costs is presented. It is shown that a combinatorial use of neural network implementation for controllers and the genetic algorithm (GA) or the particle swarm optimization (PSO) is effective for emerging more realistic autonomous behaviours of animated robots.

• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 2000.10a
• /
• pp.233-238
• /
• 2000

Many theories and researches about agricultural products transportation were proposed and introduced until now. These studies have insufficient consideration about factors like region of imported agricultural products and the different speed of each road. In this study the Optimal Routes Selection Model (ORSEM) included factors that aren't taken into account in past studies and consists of database using Internet. Finally the model was developed through advanced marketing potential function and optimization method. The ORSEM focalizes on transport network organization. This model was applied to physical distribution of agricultural products in South Korea and found optimum routes of agricultural products.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.214-216
• /
• 2003

Mobile Ad Hoc Network(MANET)에서는, 각 모바일 노드들이 하나의 연결을 유지하는 단말 호스트로 동작함과 동시에 라우터로서도 동작한다. 따라서 유선 네트워크와는 달리 라우터 뿐만 아니라 단말 호스트에서의 네트워크 혼잡이 고려의 대상이 되어야 한다. 네트워크 계층 간에 동작하는 플로우 컨트롤 알고리즘을 사용한다면, 단말 호스트(플로우의 소스 혹은 목적 노드)에서의 패킷 드롭을 줄임으로써 TCP throughput율 증가시킬 수 있다. 일반적으로 MANET의 링크 레이어 프로토콜로는 IEEE 802.11 MAC 프로토콜이 많이 사용되지만, 이 프로토콜은 링크 레이어에서의 플로우 컨트롤을 제공하지는 않는다. 링크 레이어 플로우 컨트롤은 패킷이 전송된 직후에 버퍼 오버플로우로 인해 드롭되는 것을 방지할 수 있으며, 이는 결과적으로 대역폭의 낭비와 전력사용을 줄일 수 있다. 이 논문에서 2개의 플로우 컨트롤 알고리즘, 즉 수직 플로우 컨트롤과 수명 플로우 컨트롤을 제안한다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.4
• /
• pp.23-30
• /
• 2003

This study develops an efficient heuristic which is based on genetic approach for AGVs flow path layout problem. The suggested solution approach uses a algorithm to replace two 0-1 integer programming models and a branch-and-bound search algorithm. Genetic algorithms are a class of heuristic and optimization techniques that imitate the natural selection and evolutionary process. The solution is to determine the flow direction of line in network AGVs. The encoding of the solutions into binary strings is presented, as well as the genetic operators used by the algorithm. Genetic algorithm procedure is suggested, and a simple illustrative example is shown to explain the procedure.

• ETRI Journal
• /
• v.24 no.2
• /
• pp.131-141
• /
• 2002

This paper considers a routing and wavelength assignment problem (RWAP) for the implementation of efficient Wavelength Division Multiplexing all-optical mesh networks without wavelength conversion. For a given physical network and required connections, the solution to the RWAP consists in how to select a suitable path and wavelength among the many possible choices for each connection so that no two paths using the same wavelength pass through the same link, while minimizing the number of required wavelengths. We introduce an integer programming formulation of the RWAP, which has an exponential number of variables, and propose an algorithm to solve it based on the column generation technique. The proposed algorithm can yield high quality solutions and tight lower bounds at the same time. Though the proposed algorithm cannot guarantee optimal solutions, computational results show that the algorithm yields provably good solutions within a reasonable time.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.2
• /
• pp.355-361
• /
• 2010

This paper addresses a mathematical approach to decision making in a real-world material distribution situation. The problem is characterized by a low-volume and highly-varied mix of products, therefore there is a lot of material movement between the facilities. This study focuses especially on the transportation scheduler with a tool that can be used to quantitatively analyze the volume of material moved, the type of truck to be used, production schedules, and due dates. In this research, we have developed a mixed integer programming problem using the minimum cost, multiperiod, multi-commodity network flow approach that minimizes the overall material movement costs. The results suggest that the optimization approach provides a set of feasible solution routes with the objective of reducing the overall fleet cost.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.812-814
• /
• 2015

In this Paper, we proposed optimization of system performance, power splitting protocols applied to relay in the cooperative communication undergo co-channel interference. When relay adjust power distribution factors undergo co-channel interference, it is possible to optimize and maximize the channel capacity of the receiver. Because of energy haversting, interfence transfer to new power source. If we found optimal power levels, to solve inability in system, and to increase the efficiency of the network.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.4
• /
• pp.425-434
• /
• 2002

Mobility of service users makes location update and paging (L/P) procedures indispensable features in mobile communication networks. Importance of optimizing the configuration of L/P areas has been increased by the growth of L/P related signaling. In this study, we deal with the L/P configuration which an LA (Location Area) may contain multiple PAs (Paging Areas). Given the network topology, L/P related parameters, and traffics generated by each cell, is provided the problem of finding optimal LA/PA configuration minimizing the amount of L/P related signaling. The optimization problem is solved using a simulated annealing, and detailed computational results are conducted to capture the effects of mobility, call arrival patterns and boundary crossing rate on the LA and PA configurations.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.430-435
• /
• 2014

The performance of a distributed database system depends particularly on the site-allocation of the fragments. Queries access different fragments among the sites, and an originating site exists for each query. A data allocation algorithm should distribute the fragments to minimize the transfer and settlement costs of executing the query plans. The primary cost for a data allocation algorithm is the cost of the data transmission across the network. The data allocation problem in a distributed database is NP-complete, and scalable evolutionary algorithms were developed to minimize the execution costs of the query plans. In this paper, quadratic assignment problem heuristics were designed and implemented for the data allocation problem. The proposed algorithms find near-optimal solutions for the data allocation problem. In addition to the fast ant colony, robust tabu search, and genetic algorithm solutions to this problem, we propose a fast and scalable hybrid genetic multi-start tabu search algorithm that outperforms the other well-known heuristics in terms of execution time and solution quality.