• Journal of the Korea Safety Management & Science
• /
• v.10 no.1
• /
• pp.139-144
• /
• 2008

Recently, a multi-facility, multi-product and multi-period industrial production-distribution planning problem has been widely investigated in Supply Chain Management (SCM). One of the key issues in the current SCM research area involves reducing both production and distribution costs. We have developed an optimization model to tackle the above problems under the restricted conditions such as transportation time and a zero inventory. Computational experiments using commercial tool Ms-Excel Solver show that the real size problems we encountered can be solved in reasonable time. The model can be used to decide an appropriate production-distribution planning problem in SCM research area.

• Structural Engineering and Mechanics
• /
• v.7 no.3
• /
• pp.241-257
• /
• 1999

This paper presents a procedure to minimize the cost of materials of cable-stayed bridges with composite box girder and concrete tower. Two sets of iterations are included in the proposed procedure. The first set of iteration performs the structural analysis for a cable-stayed bridge. The second set of iteration performs the optimization process. The design is formulated as a general mathematical problem with the cost of the bridge as the objective function and bending forces, shear forces, fatigue stresses, buckling and deflection as constraints. The constraints are developed based on the Canadian National Standard CAN/CSA-S6-88. The finite element method is employed to perform the complicated nonlinear structural analysis of the cable-stayed bridges. The internal penalty function method is used in the optimization process. The limit states design method is used to determine the load capacity of the bridge. A computer program written in FORTRAN 77 is developed and its validity is verified by several practical-sized designs.

• Korean Journal of Mathematics
• /
• v.4 no.1
• /
• pp.7-16
• /
• 1996

The optimization problems with quadratic constraints often appear in various fields such as network flows and computer tomography. In this paper, we propose an algorithm for solving those problems and prove the convergence of the proposed algorithm.

• Journal of the military operations research society of Korea
• /
• v.25 no.1
• /
• pp.1-12
• /
• 1999

The ratio of the nonscheduled air flight transportation is about 49% among the personnel transportation at the Korean Air Force from 1993 to 1997. If an appropriate nonscheduled air flight method is developed, it may considerably achieve a reduction of the transportation cost. The purpose of this paper is to propose the least cost transportation method using the optimization technique. The nonscheduled air flight for the personnel can be classified into three types. The proposed least cost transportation method is tested with a current air flight method for each of three types. It is shown that a proposed method can considerably reduce the transportation cost.

• Journal of the Korean Society for Railway
• /
• v.19 no.6
• /
• pp.833-843
• /
• 2016

Recently, in the field of rail freight transportation, the number of trains dedicated for shippers has been increasing. These dedicated trains, which run on the basis of a contract with shippers, had been restricted to the transportation of containers, or so called block trains. Nowadays, such commodities have extended to cement, hard coal, etc. Most full freight cars are transported by dedicated trains. But, for empty car distribution, the efficiency still remains questionable because the distribution plan is manually developed by dispatchers. In this study, we investigated distribution models delineated in the KTOCS system which was developed by KORAIL as well as mathematical models considered in the state-of-the-art. The models are based on optimization models, especially the network flow model. Here we suggest a new optimization model with a framework of the column generation approach. The master problem can be formulated into a transportation problem with additional constraints. The master problem is improved by adding a new edge between the supply node and the demand node; this edge can be found using a simple shorted path in the time-space network. Finally, we applied our algorithm to the Korean freight train network and were able to find the total number of empty car kilometers decreased.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.6
• /
• pp.51-58
• /
• 2015

This paper suggests assignment-swap algorithm with time complexity O(mn) to obtain the optimal solution for large-scale of transportation problem (TP) with incomplete cost lists. Generally, the TP with complete cost lists can be solved with TSM (Transportation Simplex Method). But, we can't be solved for large-scale of TP with TSM. Especially. It is hard to solve for large-scale TP with incomplete cost lists using TSM. Therefore, experts simply using commercial linear programming package. Firstly, the proposed algorithm applies assignment strategy of transportation quantity to ascending order of transportation cost. Then, we reassign from surplus of supply to shortage of demand. Secondly, we perform the 2-opt and 1-opt swap optimization to obtain the optimal solution. Upon application to $31{\times}15$ incomplete cost matrix problem, the proposed assignment-swap algorithm more improves the solution than LINGO of commercial linear programming.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1-8
• /
• 2006

This paper considers an interesting transportation problem where trailers and tractors are involved in moving material. We identified a class of combinatorial optimization problems for minimizing the number of tractors and trailers required to accommodate the transportation needs. Then, we show that the fundamental problem is NP-hard and analyze its properties to develop efficient heuristic to handle the problem effectively.

• Nuclear Engineering and Technology
• /
• v.56 no.2
• /
• pp.520-525
• /
• 2024

The optimization design problem of nuclear reactor radiation shield is a typical multi-objective optimization problem with almost 10 sub-objectives and the sub-objectives are always demanded to be under tolerable limits. In this paper, a design method combining multi-objective optimization algorithms with paralleling discrete ordinate transportation code is developed and applied to shield design of the Savannah nuclear reactor. Three approaches are studied for light-weighted and compact design of radiation shield. Comparing with directly optimization with 10 objectives and the single-objective optimization, the approach by setting sub-objectives representing weight and volume as optimization objectives while treating other sub-objectives as constraints has the best performance, which is more suitable to reactor shield design.

• Industrial Engineering and Management Systems
• /
• v.6 no.2
• /
• pp.136-145
• /
• 2007

The selection of suppliers and the determination of order quantities to be placed with those suppliers are important decisions in a supply chain. In this research, a non-linear mixed integer programming model is presented to select suppliers and determine the order quantities. The model considers the purchasing cost which takes into account quantity discount, the cost of transportation, the fixed cost for establishing suppliers, the cost for holding inventory, and the cost of receiving poor quality parts. The capacity constraints for suppliers, quality and lead-time requirements for the parts are also taken into account in the model. Since the purchasing cost, which is a decreasing step function of order quantities, introduces discontinuities to the non-linear objective function, it is not easy to employ traditional optimization methods. Thus, a heuristic algorithm, called particle swarm optimization (PSO), is used to find the (near) optimal solution. However, PSO usually generates initial solutions randomly. To improve the PSO solution quality, a heuristic procedure is proposed to find an initial solution based on the average unit cost including transportation, purchasing, inventory, and poor quality part cost. The results show that PSO with the proposed initial solution heuristic provides better solutions than those with PSO algorithm only.

• Nuclear Engineering and Technology
• /
• v.51 no.1
• /
• pp.284-292
• /
• 2019

For the continuous operation of a nuclear reactor, burnt fuel needs to be replaced with fresh fuel, where appropriate (ex-vessel) fuel handling is required. Particularly for the Sodium-cooled Fast Reactor (SFR) refueling, its process has unique challenges due to liquid sodium coolant. The ex-vessel spent fuel transportation should concern several design features such as the radiation shielding, decay-heat removal, and inert space separated from air. This paper proposes a new design optimization methodology of cask shielding to transport the spent fuel assembly in a prototype SFR for the first time. The Particle Swarm Optimization (PSO) algorithm had been applied to design trade-offs between shielding and cask weight. The cask is designed as a double-cylinder structure to block an inert sodium region from the air-cooling space. The PSO process yielded the optimum shielding thickness of 26 cm, considering the weight as well. To confirm the shielding performance, the radiation dose of spent fuel removed at its peak burnup and after 1-year cooling was calculated. Two different fuel positions located during transportation were also investigated to consider a functional disorder in a cask drive system. This study concludes the current cask design in normal operations is satisfactory in accordance with regulatory rules.