• IE interfaces
• /
• v.14 no.3
• /
• pp.247-254
• /
• 2001

As current postal automation is limited to dispatch and arrival sorting, delivery sequence sorting is performed manually by each postman. It not only acts as a bottleneck process in the overall mailing process but is expensive operation. To cope with this problem effectively, delivery sequence sorting automation is required. The important components of delivery sequence sorting automation system are sequence sorter and Hangul OCR which function is to extract the address of delivery point. DSI database will be interfaced to both Hangul OCR and sequence sorter for finding the accurate delivery sequence number and stacker number. The objectives of this research are to develop DSI(Delivery Sequence Information) database prototype and client application for managing information effectively. For database requirements collection and analysis, we draw all possible sorting plans, and apply the AHP(Analytic Hierarchy Process) method to determine the optimal one. And then, we design DSI database schema based on the optimal one and implement it using Oracle RDBMS. In addition, as address information in DIS database consist of hierarchical structure which has its correspondence sequence number, so it is important to reorganize sequence information accurately when address information is inserted, deleted or updated. To increase delivery accuracy, we reflect this point in writing application.

• IE interfaces
• /
• v.14 no.3
• /
• pp.227-235
• /
• 2001

There is a rapidly growing demand for wireless telecommunication. However, the number of usable channel is very limited. Therefore, the problem of channel assignment becomes more and more important to use channels as efficiently as possible. The objective of this paper is to develop an evolution program (EP) to find an efficient dynamic channel assignment method for minimum interference among the channels within reasonable time. The series of specific channel number is used as a representation of chromosome. The only changed chromosomes by crossover and mutation are evaluated in each generation to save computation time and memory for the progress of improved EP. We can easily differentiate the fitness value of each chromosome using proposed evaluation function. We also control the weighting factor of the mutation rate and the used number of elitist chromosomes for the speed of convergence to the optimal solution.

• IE interfaces
• /
• v.19 no.1
• /
• pp.78-85
• /
• 2006

A centralized inventory system provides a number of stores with cost reduction, information sharing. In this paper, transportation costs are included in the inventory model. To build centralized warehouses, two things should be considered: how many warehouses are required and where these are located. The objective of this paper is to develop efficient heuristics to determine the location and the number of central warehouses by minimizing total costs. Throughout some computational experiments, the results of the heuristics are compared with an optimal solution.

• IE interfaces
• /
• v.10 no.1
• /
• pp.155-167
• /
• 1997

The purpose of this study is to develop the program for efficient operation of a multi-functional surface mounting device(SMD) which mount various components on a printed circuit board(PCB). These components are provided by diverse types of feeders such as cassette, stick and tray feeders. The SMD has one or two heads. In the SMD, the positions of PCB and feeders and fixed, and the head moves to pick up a component from a feeder and to mount it on the PCB. The number of lanes occupied by each feeder and the nozzle used for each component can be different. We develop an off-line program to minimize the cycle-time of the SMD by studying the optimal assignment of feeders and the optimal mounting sequence of components. Graphical User Interface(GUI) is also developed. Additionally, we consider the line balancing problem which appears when two SMDs are used sequentially.

• IE interfaces
• /
• v.24 no.1
• /
• pp.40-50
• /
• 2011

We develop a nonlinear integer programming model which minimizes the total cost with the optimal number of operators to hire and their optimal allocation to the tasks under the diverse constraints such as the weekly, daily, and hourly maximum allowable abandonment rates for the time-varying inbound call volume. We present a case study based on actual data at a call center, in order to prove the validity of applying the optimization method proposed. By the one-sample two-tailed t-test, we confirm that the expected abandonment rates resulting from the optimization method are identical with the ones from the discrete-event simulation within specified confidence intervals.

• IE interfaces
• /
• v.16 no.4
• /
• pp.400-410
• /
• 2003

Most of the demand forecasting which have been studied is about long-term time series over 15 years demand forecasting. In this paper, we set up the most optimal ARIMA model for the short-term time series demand forecasting and suggest demand forecasting system for short-term time series by appraising suitability and predictability. We are going to use the univariate ARIMA model in parallel with the bivariate transfer function model to improve the accuracy of forecasting. We also analyze the effect of advertisement cost, scale of branch stores, and number of clerk on the establishment of marketing policy by applying statistical methods. After then we are going to show you customer's needs, which are number of buying products. We have applied this method to forecast the annual sales of refrigerator in four branch stores of A company.

• IE interfaces
• /
• v.21 no.3
• /
• pp.262-273
• /
• 2008

In Korean peninsular, Air Defense with SAM(Surface-to-Air Missile) is very important, because of threatening by North Korea's theater ballistic missiles installed with nuclear or biochemistry. Effective and successful defense operation largely depends on two factors, SAM's location and the number of SAM for each target based on missile's availability in each SAM's location. However, most previous papers have handled only the former. In this paper, we developed Multi-heuristic algorithm which can handle both factors simultaneously for solving allocation problem of the batteries and missile assignment problem in each battery. To solve allocation problem, genetic algorithm is used to decide location of the batteries. To solve missile assignment problem, a heuristic algorithm is applied to determine the number of SAM for each target. If the proposed model is applied to allocation of SAM, it will improve the effectiveness of missile defense operations.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1340-1345
• /
• 2003

In this paper, an integrated optimal design software system for structural components has been developed which interfaces existing commercial codes for CAD, CAE and Optimization. They include specialized optimal design software codes such as iSIGHT and VisualDOC, optimization module imbedded in CAD software developed by CAD developers, and optimal design software systems based on API of commercial CAD software. The advantages of the CAD imbedded optimal design approach and those of specialized optimal design software are taken to develop the system. The user defines optimal design formulation in the user interface for problem definition in the CAD control stage, where design variables are directly selectable from the CAD model and various properties and performance functions defined. The commercial CAD codes, Open I-DEAS are used for the development. The resulting software is minimally connected to CAD and CAE systems while keeping maximum independence from each other. This assures flexibility and freedom for problem definition. Fatigue life optimization is taken as a nontrivial application area. As a specific example, the shape design of a knuckle part of an automobile is performed, where the minimum fatigue life over the material domain in terms of the number of cycles of a curb strike are maximized under the constraint of not exceeding the current mass. The fatigue life has been improved by four times of the initial life. The developed software is illustrated to maintain the advantages of existing optimal design software systems while improving independency and flexibility.

• IE interfaces
• /
• v.10 no.2
• /
• pp.1-13
• /
• 1997

The problem of the formation of machine-part cells in FMS is a very important issue at the planning and operating stages of FMS. This problem is inherently a combinatorial optimization problem, proven to be NP-complete(or, NP-hard). Among the several kinds of approaches which have been applied to solve the combinatorial optimization problems, the Simulated Annealing(SA) algorithm, a technique of random search type with a flexibility in generating alternatives, is a powerful problem solving tool. In this paper, the SA algorithm is used to solve machine cell-part family formation problems. The primary purpose of the study is to find the near-optimal solution of machine cell-part family formation problem, whare the product volume and number of operations are prespecified, that can minimize the total material handling cost caused by exceptional elements and intercell moves as much as possible. The results show that the SA algorithm is able to find a near-optimal solution for practical problems of the machine cell-part family formation.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.23 no.2
• /
• pp.65-92
• /
• 2019

We survey a recently developed immersed finite element method (IFEM) for the interface problems. The IFEM uses structured grids such as uniform grids, even if the interface is a smooth curve. Instead of fitting the curved interface, the bases are modified so that they satisfy the jump conditions along the interface. The early versions of IFEM [1, 2] were suboptimal in convergence order [3]. Later, the consistency terms were added to the bilinear forms [4, 5], thus the scheme became optimal and the error estimates were proven. For elasticity problems with interfaces, we modify the Crouzeix-Raviart based element to satisfy the traction conditions along the interface [6], but the consistency terms are not needed. To satisfy the Korn's inequality, we add the stabilizing terms to the bilinear form. The optimal error estimate was shown for a triangular grid. Lastly, we describe the multigrid algorithms for the discretized system arising from IFEM. The prolongation operators are designed so that the prolongated function satisfy the flux continuity condition along the interface. The W-cycle convergence was proved, and the number of V-cycle is independent of the mesh size.