• Journal of The Korean Society of Agricultural Engineers
• /
• v.49 no.6
• /
• pp.93-101
• /
• 2007

In general, geotechnical properties have many uncertain aspects, thus probabilistic analysis have been used to consider these aspects. It is, however, quite difficult to select an appropriate target probability for a certain structure or construction process. In this study, minimum expected cost design method based on probabilistic analysis is suggested for design of vertical drains generally used to accelerate consolidation in soft clayey soils. A sensitivity analysis is performed to select the most important uncertain parameters for the design of vertical drains. Monte Carlo simulation is used in sensitivity analysis and probabilistic analysis. Total expected cost, defined as the sum of initial cost and expected additive cost, varies widely with variation of input parameters used in design of vertical drain systems. And probability of failure to get the minimum total expected cost varies under the different design conditions. A minimum value of total expected cost is suggested as a design value in this study. The proposed design concept is applicable to unit construction process because this approach is to consider the uncertainties using probabilistic analysis and uncertainties of geotechnical properties.

• IE interfaces
• /
• v.16 no.spc
• /
• pp.39-44
• /
• 2003

As one of many design variables, the role of dimension tolerances is to restrict the amount of size variation in a manufactured feature while ensuring functionality. In this study, a nonlinear integer model has been modeled to allocate the optimal tolerance to each individual feature at a minimum manufacturing cost. While a normal distribution determines statistically worst tolerances with its symmetrical property in many previous tolerance allocation studies, a asymmetrical distribution is more realistic because its mean is not always coincident with a process center. A nonlinear integer model is modeled to allocate the optimal tolerance to a feature based on a beta distribution at a minimum total cost. The total cost as a function of tolerances is defined by machining cost and quality loss. After the convexity of manufacturing cost is checked by the Hessian matrix, the model is solved by the Complex Method. Finally, a numerical example is presented demonstrating successful model implementation for a nonlinear design case.

• Management Science and Financial Engineering
• /
• v.20 no.1
• /
• pp.17-19
• /
• 2014

In this paper, we consider an interesting variant of the inverse minimum traveling salesman problem. Given an instance (G, w) of the minimum traveling salesman problem defined on a metric space, we fix a specified Hamiltonian cycle $HC_0$. The task is then to adjust the edge cost vector w to w' so that the new cost vector w' satisfies the triangle inequality condition and $HC_0$ can be returned by the minimum spanning tree algorithm in the TSP-instance defined with w'. The objective is to minimize the total deviation between the original and the new cost vectors with respect to the $L_1$-norm. We call this problem the inverse metric traveling salesman problem against the minimum spanning tree algorithm and show that it is closely related to the inverse metric spanning tree problem.

• Journal of the Society of Naval Architects of Korea
• /
• v.48 no.2
• /
• pp.178-182
• /
• 2011

Generally in order to reduce the steel weight of stiffened plate, stiffener spaces tend to be narrow and the plate gets thin. However, it will involve more fabrication cost because it can lead to the increase of welding length and the number of structural members. In the yard, the design which is able to reduce the total fabrication cost is needed, although it requires more steel weight. The purpose of this study is to find optimum stiffener spaces to minimize the fabrication cost for the cargo tank of LPG Carriers. Global optimization methods such as ES(Evolution Strategy) and GA(Genetic Algorithm) are introduced to find a global optimum solution and the sum of steel material cost and labor cost is selected as main objective function. Convergence degree of both methods in according to the size of searching population is examined and an efficient size is investigated. In order to verify the necessity of the optimum design based on the cost, minimum weight design and minimum cost design are carried out.

• Journal of the Korean Home Economics Association
• /
• v.44 no.8
• /
• pp.79-87
• /
• 2006

The purpose of this study was to estimate the minimum monthly food cost for the low income population. The food consumption data of 9,311 individuals from the 2001 Korean National Health and Nutrition Survey was used. The monthly food cost was calculated using the Consumer Food Price Database for the year 2001 provided by the Public Health Nutrition Laboratory, Seoul National University. The low income population (n = 1,310) was characterized as older age, lower income, smaller family size, lower education level, and lower energy intake as compared with the total population (n = 8,001). The estimated food cost showed that men in the low income population needed 15% more money for purchasing food to maintain the energy intake level at the average energy intake level of men in the total population. It was also estimated that women in the low income population needed 9% more money for purchasing food to maintain the energy intake level at the average energy intake level of women in the total population. There were differences in monthly food costs depending on the sex and age, and family size. The results of this study could be used as basic information to establish minimum food cost for the low income population in Korea.

• Industrial Engineering and Management Systems
• /
• v.9 no.3
• /
• pp.204-214
• /
• 2010

A manufacturing/remanufacturing system is investigated with the consideration of required minimum quality of end-of-used products. A constant demand is satisfied by remanufacturing end-of-used products and manufacturing raw materials outsourced from outside. It is assumed in this system that the buyback price and remanufacturing cost are related to the different quality level of end-of-used products. For remanufacturing, only the used products that satisfy a required minimum quality level will be recycled. Thus, the returning rate is a function of the required minimum quality level. Functions of returning rate, buyback price and remanufacturing cost, which are closely connected to the quality level of end-of-used products, are investigated here. Treating the required minimum quality level of end-of-used products, the length of a cycle, the number of manufacturing lots and remanufacturing lots in a cycle as decision variables, the mathematical models with the objective of minimizing the average total cost are constructed. Through construction of a solution process based on Tabu Search algorithm and calculating examples, the validity of the models is illustrated.

• Journal of the Korean Society of Safety
• /
• v.30 no.3
• /
• pp.13-19
• /
• 2015

Railway vehicle equipment goes back again to the state just before when failure by the repair. In repairable system, we are interested in the failure interval. As such, a statistical model of the point process, NHPP power law is often used for the reliability analysis of a repairable system. In order to derive a quantitative reliability value of repairable system, we analyze the failure data of the air brake system of the train line 7. The quantitative value is the failure intensity function that was modified, converted into a cost-rate function. Finally we studied the optimal number and optimal interval in which the costs to a minimum consumption point as cost-rate function. The minimum cost point was 194,613 (won/day) during the total life cycle of the braking system, then the optimal interval were 2,251days and the number of optimal preventive maintenance were 7 times. Additionally, we were compared to the cost of a currently fixed interval(4Y) and the optimum interval then the optimal interval is 3,853(won/day) consuming smaller. In addition, judging from the total life, "fixed interval" is smaller than 1,157 days as "optimal interval".

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.1-11
• /
• 1986

This research is concerned with n jobs, m parallel identical machines scheduling problem in which all jobs have a common due date. The objective of the research is to develop an optimum scheduling algorithm for determining an optimal job sequence, the optimal value of the common due date and the minimum makespan to minimize total cost. The total cost is based on the common due date cost, the earliness cost, the tardiness cost and the flow time cost of each job in the selected sequence. The optimum scheduling algorithm is developed. A numerical example is given to illustrate the scheduling algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.10 no.1
• /
• pp.41-45
• /
• 1984

A resource constrained scheduling problem that involves trade-off between resources and time is considered. Models are considered. Models are presented as zero-one integer program and objectives of models include minimum project completion time and minimum total project cost.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.2
• /
• pp.53-66
• /
• 1989

The Public Vehicle Routing Problem (PVRP) is to find the minimum total cost routes of M or less Public-Vehicles to traverse the required arcs(streets) at least once, and return to their starting depot on a directed network. In this paper, first, a mathematical model is formulated as minimal cost flow model with illegal subtour elimination constraints, and with the fixed cost and routing cost as an objective function. Second, an efficient branch and bound algorithm is developed to obtain an exact solution. A subproblem in this method is a minimal cost flow problem relaxing illegal subtour elimination constraints. The branching strategy is a variable dichotomy method according to the entering nonrequired arcs which are candidates to eneter into an illegal subtour. To accelerate the fathoming process, a tighter lower bound of a candidate subproblem is calculated by using a minimum reduced coast of the entering nonrequired arcs. Computational results based on randomly generated networks report that the developed algorithm is efficient.