• Asia pacific journal of information systems
• /
• 제1권1호
• /
• pp.49-62
• /
• 1991

This paper examines the problems of database partitioning and file allocation in a fixed topology distributed computer network. The design objective is to make files as collections of attributes and to allocate these files to network nodes so that a minimum total transmission cost is achieved subject to storage capacity constraints. A mathematical model for solving the problem is formulated and, the resulting optimization problem is shown to fall in a class of NP-complete problems. A new heuristic algorithm is developed which uses the idea of allocating attributes according to the transaction requirements at each computer node and then making files using the allocated attributes. Numerical results indicate that the heuristic algorithm yields practicable low cost solutions in comparison with the existing methods which deal with the file allocation problems and database partitioning problems independently.

• 대한전자공학회논문지
• /
• 제27권3호
• /
• pp.86-94
• /
• 1990

종합정보통신망(ISDN)의 패킷 교환망 구조를 지역망 설계 알고리즘과 분산망 설계 알고리듬을 적용하여 설계한다. 지역망 설계 알고리듬은 MST 토폴로지를 기본으로 하며, 한계용량을 만족시키고 통신량의 분산효과를 얻을 수 있도록 한다. 이를 Kruskal, Esau-Williams 알고리듬과 비교한 결과, 비용면에서 2.7%의 향상과 평균 지연시간에서 44.8%의 감소 효과를 보였다. 또한 분산망 설계 알고리듬으로서 MST 토폴로지에서 신뢰도를 증가시켜 나아가며 최소 비용의 토폴로지를 결정하는 알고리듬을 제안하였으며, Cut-Saturation 알고리듬과 종단간 지연시간과 통신량 제한조건 하에서 비교한 결과, 비용면에서 약 1/7의 감소 효과와 약 2.5배의 Throughput 증가 효과를 보였다.

• 산업경영시스템학회지
• /
• 제39권2호
• /
• pp.46-53
• /
• 2016

In mobile communication systems, location management deals with the location determination of users in a network. One of the strategies used in location management is to partition the network into location areas. Each location area consists of a group of cells. The goal of location management is to partition the network into a number of location areas such that the total paging cost and handoff (or update) cost is a minimum. Finding the optimal number of location areas and the corresponding configuration of the partitioned network is a difficult combinatorial optimization problem. This cell grouping problem is to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking is a minimum in location area wireless network. In fact, this is shown to be an NP-complete problem in an earlier study. In this paper, artificial bee colony (ABC) is developed and proposed to obtain the best/optimal group of cells for location area planning for location management system. The performance of the artificial bee colony (ABC) is better than or similar to those of other population-based algorithms with the advantage of employing fewer control parameters. The important control parameter of ABC is only 'Limit' which is the number of trials after which a food source is assumed to be abandoned. Simulation results for 16, 36, and 64 cell grouping problems in wireless network show that the performance of our ABC is better than those alternatives such as ant colony optimization (ACO) and particle swarm optimization (PSO).

• Water Engineering Research
• /
• 제2권4호
• /
• pp.199-207
• /
• 2001

A computer-assisted desktop is developed for layout design of a concrete gravity dam on the basis of safety and economy. Using a set of regression equations, a dam layout is proposed. With reference to the regression equations and relevant input data, overall dam dimensions are determined by satisfying the stability criteria jointly under usual, unusual, and extreme loading conditions with the desired hydraulic conformity. Among several feasible alternatives, the program enables a designer to select the optimum layout, which corresponds to the minimum total cost of the structure. The method is applied to a case study to examine dimensions of proposed alternatives and to compare them with those of an existing dam.

• Structural Engineering and Mechanics
• /
• 제11권2호
• /
• pp.151-170
• /
• 2001

With increasing competition, the engineering industry is in need of optimization of designs that would lead to minimum cost or weight. Recent developments in Genetic Algorithms (GAs) makes it possible to model and obtain optimal solutions in structural design that can be put to use in industry. The main objective of this paper is to illustrate typical applications of GAs to practical design of structural systems such as steel trusses, towers, bridges, reinforced concrete frames, bridge decks, shells and layout planning of buildings. Hence, instead of details of GA process, which can be found in the reported literature, attention is focussed on the description of the various applications and the practical aspects that are considered in Genetic Modeling. The paper highlights scope and future directions for wider applications of GA based methodologies for optimal design in practice.

• 소성∙가공
• /
• 제11권2호
• /
• pp.165-170
• /
• 2002

The preform design of forging processes plays a key role in improving product qualities, such as defect prevention, dimensional accuracy and mechanical strengths. In the industry, preforms are generally designed by the iterative trial-and-error approach, but it results in significant tooling cost and time. It is thus necessary to minimize lead-time and human intervention through an effective preform design method. In this paper, the equi-potential lines designed in the electric field are introduced to find the preform shape, and then the optimization process is used to choose the equi-potential lines that will keep the die wear to a minimum Because, in the forging process, the die wear is a function of various important factors, such as forming stress and strain, microstructure and mechanical properties of a Product.

• 한국자동차공학회논문집
• /
• 제6권2호
• /
• pp.43-53
• /
• 1998

This paper addresses an optimization for reducing a steering error of a rack-and-pinion steering linkage with a MacPherson strut independent front suspension system. The length, orientations and inner joint positions of a tie-rod are selected as design variables and Ackerman geonetry, understeer effect, minimum turn radius, wheel alignment and packaging are considered as design constraints. Nonlinear kinematic analysis of the steering system is performed for calculating the values of cost and constraints, and Augmented Lagrange Multiplier(ALM) method is used for solving the constrained optinization problem. The optimization results show that the steering error are considerably reduced while satisfying all the constraints.

• 경영과학
• /
• 제19권2호
• /
• pp.75-89
• /
• 2002

According to the fast-paced environment of information technology and improving customer services, the design activities of logistics systems improve customer centric services and delivery performance implementing e-logistics system. The fundamental design issues that arise in the delivery system planning are optimizing the system with minimum cost and maximum throughput and service level. This study is concerned with the integrated model development of delivery system with customer responsive service level for DCM, Demand Chain Management. We used a two-step approach for this study. First, we formulated the supply. center facility planning using stochastic set-covering problem and assigned the customers to the supply center using clustering algorithm. Second, we developed vehicle delivery planning for a supply center based on GIS, GIS-VRP. Also we developed a GUI-type computer program for proposed method for supply center problem using GIS and Geo-DataBase of Busan area. The computational results showed that the proposed method was very effective on a set of test problems.

• 경영과학
• /
• 제12권2호
• /
• pp.89-103
• /
• 1995

Traditionally, the scarce and expensive resources in communication networks has been the bandwidth of transmission facilities; accordingly, the techniques used for networking and switching have been chosen so as to optimize the efficient use of that resource. One of them is the packet switching for data communications, which is much different from the circuit switching. It allows multiple users to share the data network facilities and bandwidth, rather than providing specific amounts of dedicated bandwidth to each users. One main challenge therefore has been to design and build cost-effective packet switching networks. In this paper, we develop a mathematical programming medel and heuristic algorithm for designing the packet switching networks with hop-count constraints. To develop an efficient heuristic, we apply the Lagrangian relaxation method. Some valid inequalities, which have been known as the tight constraints, are considered to improve the bound for Lagrangian sub-problem. The computational experiments show that the performance of the proposed heuristic is very satisfactory in both the speed and the quality of design solutions generated.

• 대한산업공학회지
• /
• 제14권2호
• /
• pp.99-114
• /
• 1988

The objective of this study is mainly related to design aspects of Multi-aisle S/R machine system (MASS) which can substantially reduce high initial investment cost of Automated Storage/Retrieval System. Firstly, the average travel time of the S/R machine is determined under single and dual commands, from which the average performance of S/R machine is evaluated. Secondly, a design model is developed and the system parameters, such as length and height of the system, and the number of S/R machines, traversers and aisles are determined which provide minimum initial investment and operating costs. Also, through experiments, sensitivity analysis is made for the throughput and storage volume.