• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 2002.10b
• /
• pp.67-68
• /
• 2002

The properties and mechanism of silicon protuberance and groove processing by diamond tip sliding using atomic force microscope (AFM) in atmosphere were studied. To control the height of protuberance and the depth of groove, the processed height and depth depended on load and diamond tip radius were evaluated. Nanoprotuberances and grooves were fabricated on a silicon surface by approximately 100-nm-radius diamond tip sliding using an atomic force microscope in atmosphere. To clarify the mechanical and chemical properties of these parts processed, changes in the protuberance and groove profiles due to additional diamond tip sliding and potassium hydroxide (KOH) solution etching were evaluated. Processed protuberances were negligibly removed, and processed grooves were easily removed by additional diamond tip sliding. The KOH solution selectively etched the unprocessed silicon area. while the protuberances, grooves and flat surfaces processed by diamond tip sliding were negligibly etched. Three-dimensional nanofabrication is performed in this study by utilizing these mechanic-chemically processed parts as protective etching mask for KOH solution etching.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.4
• /
• pp.1071-1082
• /
• 1995

Numerical analyses have been performed to obtain the absorption heat and mass transfer coefficients and the absorption mass flux from a falling film of the LiBr aqueous solution which is cooled by cooling air. Heat flux at the wall is specified in terms of the heat transfer coefficient of cooling air and the cooling air temperature. Effects of operating conditions, such as the heat transfer coefficient, the cooling air temperature, the system pressure and the solution inlet concentration have been investigated in view of the local absorption mass flux and the total mass transfer rate. Effects of film thickness and film Reynolds number on the heat and mass transfer coefficients have been also estimated. Analyses for the constant wall temperature condition have been also carried out to examine the reliability of present numerical method by comparing with previous investigations.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.201-208
• /
• 2010

This research is about developing an efficient solution procedure for the vehicle routing problem under varying vehicle moving speeds for hour-based time interval. Different moving speeds for every hour is too difficult condition to solve for this type of combinatorial optimization problem. A methodology to divide the 12 hour based time interval offered by government into 5 different time intervals and then divide delivery area into 12 small divisions first and then re-organizing them into 5 groups. Then vehicle moving speeds are no longer varying in each of the 5 divisions. Therefore, a typical TSP solution procedure may be applied to find the shortest path for all 5 divisions and then connect the local shortest paths to form a delivery path for whole area. Developed solution procedures are explained in detail with 60 points example.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.1
• /
• pp.153-165
• /
• 2009

This paper apollos an ant colony system (ACS) for the vehicle routing problem with time window (VRPTW). The VRPTW is a generalization of the VRP where the service of a customer can begin within the time windows defined by the earliest and latest times when the customer will permit the start of service. The ACS has been applied effectively in geographical environment such as TSP or VRP by meta-heuristic that imitate an ant's biologic special duality in route construction, 3 saving based ACS (SB-ACS) is introduced and its solution is improved by local search. Through iterative precesses, the SB-ACS is shown to drive the best solution. The algorithm has been tested on 56 Solomon benchmarking problems and compared to the best-known solutions on literature. Experimental results shows that SB-ACS algorithm could obtain food solution in total travel distance minimization.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.131-135
• /
• 2008

In this paper, we deal with a hierarchical location-allocation problem in designing the broadband convergence networks (BcN). The objective is to minimize the total cost of switch and cable while satisfying the quality of service (QoS). We formulate the problem as an integer programming model and develop the Tabu Search (TS) heuristic algorithm to find a good feasible solution within a reasonable time limit. Initial solution is obtained by using the tree structure. Three neighborhood generation mechanisms are used by local search heuristic: insertion, switch up, and switch down. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. We present promising computational results of the proposed solution procedures.

• Journal of Agricultural Extension & Community Development
• /
• v.4 no.2
• /
• pp.443-452
• /
• 1997

All kinds of environmental problems are related to each local environment. For solving these problems, it is necessary to change regional people's Environmental Attitude in their particular community. In order to provide methods of the regional people's attitude change for solution to the environmental problems, the suggestions of this study are : 1) the systematical and continuing education about environmental problems for inhabitants 2) the persuasion process for regional people, 3) the inducement of their actions toward environmental problem solution, and 4) the social pressure through laws and institutes.

• Proceedings of the KIEE Conference
• /
• 2002.07a
• /
• pp.121-123
• /
• 2002

In this paper, we preposed a chaos optimization method to reduce computational effort and enhance optimality of the solution in feeder reconfiguration problem. Chaos method in optimization problem searches the global optimal solution on the regularity of chaotic motions and more easily escapes from local or near optimal solution than stochastic optimization algorithms. The chaos optimization method is tested on 15 buses and 32 buses distribution systems, and the test results indicate that it is able to determine appropriate switching options for global optimum configuration with less computation.

• Proceedings of the KIEE Conference
• /
• 2002.07a
• /
• pp.124-126
• /
• 2002

The general capacitor placement problem is a combinatorial optimization problem having an objective function composed of power losses and capacitor installation costs subject to bus voltage constraints. In this paper, the method employing the chaos search algorithm is proposed to solve optimal capacitor placement problem with reducing computational effort and enhancing optimality of the solution. Chaos method in optimization problem searches the global optimal solution on the regularity of chaotic motions and easily escapes from local or near optimal solution than stochastic optimization algorithms. The chaos optimization method is tested on 9 buses and 69 buses system to illustrate the effectiveness of the proposed method.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.5
• /
• pp.748-754
• /
• 2008

The general capacitor placement problem is a combinatorial optimization problem having an objective function composed of power losses and capacitor installation costs subject to bus voltage constraints. In this paper, a global optimization technique, which employing the chaos search algorithm, is applied to solve optimal capacitor placement problem with reducing computational effort and enhancing global optimality of the solution. Chaos method in optimization problem searches the global optimal solution on the regularity of chaotic motions and easily escapes from local or near optimal solution than stochastic optimization algorithms. The chaos optimization method is tested on 9 buses and 69 buses system to illustrate the effectiveness of the proposed method.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.2
• /
• pp.70-77
• /
• 2000

This paper proposes a method of solving a unit commitment problem using tabu search (TS) which is heuristic algorithm. Ts is a local search method that starts from any initial solution and attempts to determine a better solution using memory structures. In this paper, to reduce the computation time for finding the optimal solution, changing tabu list size as intensification strategy and path relinking method as diversification strategy are proposed. To show the usefulness of the proposed method, we simulated for 10 units system and 110 units system. Numerical results show improvements in the generation costs and the computation time compared with priority list, genetic algorithm(GA), and hybrid GA.