• Journal of Welding and Joining
• /
• 제21권7호
• /
• pp.42-48
• /
• 2003

Welding distortion is a current issue in many industrial parts, especially for heavy industry such as shipbuilding, plant industry. The welding process has many processing parameters influencing welding angular distortion such as heat input power, welding speed, gas flow rate, plate thickness and the welded material properties, etc. In this work, the conventional local minimization concept was applied to find a set of optimum welding process parameters, consisted of welding speed, plate thickness and heat input, for a minimum angular distortion. An analytic solution for welding angular distortion, which is based on laminated plate theory, was also applied to investigate and optimize the welding process parameters. The optimized process parameters and the angular distortion for various parametric conditions could be easily found by using the local minimum concept.

• Structural Engineering and Mechanics
• /
• 제23권1호
• /
• pp.29-42
• /
• 2006

This paper describes the design scheme of the three-dimensional structures based on the concept of the cellular automata simulation. The cellular automata simulation is performed according to the local rule. In this paper, the local rule is derived in the mathematical formulation from the optimization problem. The cell density is taken as the design variable. Two objective functions are defined for reducing the total weight of the structure and obtaining the fully stressed structure. The constraint condition is defined for defining the local rule. The penalty function is defined from the objective functions and the constraint condition. Minimization of the penalty function with respect to the design parameter leads to the local rule. The derived rule is applied to the design of the three-dimensional structure first. The final structure can be obtained successfully. However, the computational cost is expensive. So, in order to reduce the computational cost, the material parameters $c_1$ and $c_2$ and the value of the cell rejection criterion (CRC) are changed. The results show that the computational cost depends on the parameters and the CRC value.

• 대한수학회보
• /
• 제51권2호
• /
• pp.437-442
• /
• 2014

In this paper we prove Ekeland's variational principle in the setting of locally complete spaces for lower semi continuous functions from above and bounded below. We use this theorem to prove Caristi's fixed point theorem in the same setting and also for lower semi continuous functions.

• Spatial Information Research
• /
• 제10권4호
• /
• pp.493-499
• /
• 2002

This paper presents the disaster control due to flooding through the case study of Samwhadong, Donghae city, Kangwondo, broken out at 31, August 2002. In order to assess the characteristics of flood damage one must consider social and geological conditions, the factors of flood risk were derived based on GIS. For reduction of flood damage, flood hazard map was prepared for local residents. These information will support refuge activities, it would aid the reduction of flood damage.

• 한국윤활학회:학술대회논문집
• /
• 한국윤활학회 2000년도 제32회 추계학술대회 정기총회
• /
• pp.107-114
• /
• 2000

As one of the strategies to sustain the maximum output with the total minimum cost, huge plants worldwide, such as steel mills, refineries, petrochemical plants, and etc., may and will plan and implement the minimization of operating and maintenance costs for their own. This paper is to review the foreign cases of energy savings through lubrication improvements as one of the actions for that purpose and summarize their directions, and also to look at one such local test case.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권4호
• /
• pp.626-648
• /
• 2011

Energy consumption of wireless access networks is in permanent increase, which necessitates development of more energy-efficient network management approaches. Such management schemes must result with adaptation of network energy consumption in accordance with daily variations in user activity. In this paper, we consider possible energy savings of wireless local area networks (WLANs) through development of a few integer linear programming (ILP) models. Effectiveness of ILP models providing energy-efficient management of network resources have been tested on several WLAN instances of different sizes. To cope with the problem of high computational time characteristic for some ILP models, we further develop several heuristic algorithms that are based on greedy methods and local search. Although heuristics obtains somewhat higher results of energy consumption in comparison with the ones of corresponding ILP models, heuristic algorithms ensures minimization of network energy consumption in an amount of time that is acceptable for practical implementations. This confirms that network management algorithms will play a significant role in practical realization of future energy-efficient network management systems.

• 한국경영과학회지
• /
• 제24권2호
• /
• pp.121-134
• /
• 1999

In this paper, I propose a hybrid genetic algorithm(HGAM) incorporating a greedy interchange local optimization procedure for the multiobjective vehicle scheduling problems with service due times where three conflicting objectives of the minimization of total vehicle travel time, total weighted tardiness, and fleet size are explicitly treated. The vehicle is allowed to visit a node exceeding its due time with a penalty, but within the latest allowable time. The HGAM applies a mixed farming and migration strategy in the evolution process. The strategy splits the population into sub-populations, all of them evolving independently, and applys a local optimization procedure periodically to some best entities in sub-populations which are then substituted by the newly improved solutions. A solution of the HCAM is represented by a diploid structure. The HGAM uses a molified PMX operator for crossover and new types of mutation operator. The performance of the HGAM is extensively evaluated using the Solomons test problems. The results show that the HGAM attains better solutions than the BC-saving algorithm, but with a much longer computation time.

• 산업공학
• /
• 제17권spc호
• /
• pp.103-110
• /
• 2004

This paper presents a two-phase method for the vehicle routing problems with time windows(VRPTW). In a supply chain management(SCM) environment, timely distribution is very important problem faced by most industries. The VRPTW is associated with SCM for each customer to be constrained the time of service. In the VRPTW, the objective is to design the least total travel time routes for a fleet of identical capacitated vehicles to service geographically scattered customers with pre-specified service time windows. The proposed approach is based on ant colony optimization(ACO) and improvement heuristic. In the first phase, an insertion based ACO is introduced for the route construction and its solutions is improved by an iterative random local search in the second phase. Experimental results show that the proposed two-phase method obtains very good solutions with respect to total travel time minimization.

• 한국정밀공학회지
• /
• 제15권5호
• /
• pp.120-127
• /
• 1998

Differential inequalities occurring in problems of obstacle contact problems are recast into variational inequalities and analyzed by finite element methods. A new a posteriori error estimator, which is essential in adaptive finite element method, is introduced to capture the errors in finite element approximations of these variational inequalities. In order to construct a posteriori error estimates, saddle point problems are introduced using Lagrange parameters and upper bounds are provided. The global upper bound is localized by a special mixed formulation, which leads to upper bounds of the element errors. A numerical experiment is performed on an obstacle contact problem to check the effectivity index both in a local and a global sense.

• 산업경영시스템학회지
• /
• 제22권53호
• /
• pp.37-44
• /
• 1999

The problem to be studied here is the minimization of the total travel distance and the number of vehicles used for delivering goods to customers. Vehicle routes must also satisfy a variety of constraints such as fixed vehicle capacity, allowed operating time. Genetic algorithm to solve the VRPTW with heterogeneous fleet is presented. The chromosome of the proposed GA in this study has the 3-dimension. We propose GA that has the cubic-chromosome for VRPTW with heterogeneous fleet. The newly suggested ‘Cubic-GA (or 3-D GA)’ in this paper means the 2-D GA with GLS(Genetic Local Search) algorithms and is quite flexible. To evaluate the performance of the algorithm, we apply it to the Solomon's VRPTW instances. It produces a set of good routes and the reasonable number of vehicles.