• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.99-110
• /
• 2005

Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.39 no.6
• /
• pp.853-858
• /
• 2019

One of the methods which can enhance the efficiency of railroad network is construction of interconnection branch line for several route to share one railway. In Korea, this method already has been implemented or excuted as project level. This study suggests a network design model and a solution algorithm to choice most proper site to construction it and determine the priority of branch lines which can be considered in planning level, not project level. The model is a non-linear optimization program which minimize total cost-construction cost, operating cost and passengers' travel cost. The decision variables are a binary variable to explain whether construction or not and its direction and a integer variable of the frequencies of travel routes. The solution algorithm-problem solution and route choice and also the result of implementation for example network are suggested. This result can be more advanced after application in real network and calibration of parameters.

• Korean Journal of Materials Research
• /
• v.28 no.1
• /
• pp.12-17
• /
• 2018

$In_2O_3$ doped $WO_3$ powders were prepared by a polymer solution route and their $NO_2$ gas sensing properties were analyzed. The synthesized powders showed nano-sized particles with specific surface areas of $6.01{\sim}21.5m^2/g$ and the particle size and shape changed according to the content of $In_2O_3$. The gas sensors fabricated with the synthesized powders were tested at operating temperatures of $400{\sim}500^{\circ}C$ and 100~500 ppm concentrations of $NO_2$ atmosphere. The particle size and $In_2O_3$ content affected on the initial sensor resistance in an air atmosphere. The highest sensitivity (8.57 at $500^{\circ}C$), which was 1.77 higher than the sensor consisting of the pure $WO_3$ sample, was measured in the 0.5 mol% $In_2O_3$ doping sample. In addition, the response time and recovery time were improved by the addition of $In_2O_3$.

• Korean Journal of Metals and Materials
• /
• v.50 no.12
• /
• pp.931-937
• /
• 2012

The microstructure of Cu-15 wt%Ag composites fabricated by equal channel angular pressing (ECAP) with intermediate heat treatment at $320^{\circ}C$ was investigated by transmission electron microscopy (TEM) observations. Ag precipitates with a thickness of 20-40 nm were observed in the eutectic region of the Cu-15 wt%Ag composite solution treated at $700^{\circ}C$ before ECAP. The Cu matrix and Ag precipitates had a cube on cube orientation relationship. ECAPed composites exhibited ultrafine-grained microstructures with the shape and distribution dependent on the processing routes. For route A in which the sample was pressed without rotation between each pass, the Cu and Ag grains were elongated along the shear direction and many micro-twins were observed in elongated Cu grains as well as in Ag filaments. The steps were observed on coherent twin boundaries in Cu grains. For route Bc in which the sample was rotated by 90 degrees after each pass, a subgrain structure with misorientation of 2-4 degree by fragmentation of the large Cu grains were observed. For route C in which the sample was rotated by 180 degrees after each pass, the microstructure was similar to that of the route A sample. However, the thickness of the elongated grains along the shear direction was wider than that of the route A sample and the twin density was lower than the route A sample. It was found that more microtwins were formed in ECAPed Cu-15 wt%Ag than in the drawn sample. Grain boundaries were observed in relatively thick and long Ag filaments in Cu-15 wt%Ag ECAPed by route C, indicating the multi-crystalline nature of Ag filaments.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.147-155
• /
• 2006

Hierarchical Prefix Delegation (HPD) protocol refers to a type of solution to problems inherent in non-optimal routing which occurs with Network Mobility (NEMO) basic solution. However, because HPD cannot improve the micro-mobility problems, problem surfaces each time Mobile Network Node (MNN) changes the attachment point; as happens also in a Mobile IPv6 (MIPv6) protocol in sending Binding Update (BU) messages to Home Agent (HA) / Correspondent Nodes(CNs). By applying Hierarchical Mobile IPv6 protocol concept to HPD, this study proposes an algorithm for effectively handling micro-mobility problems which occur with HPD in a nested NEMO environment. By sending BU only to nearby Mobility Anchor Point(MAP) during MNN location change within a MAP's domain, the proposed protocol will alleviate service disruption delays and signaling loads during the handover process, overcoming the limitations of HPD.

• Korean Management Science Review
• /
• v.33 no.1
• /
• pp.101-117
• /
• 2016

In 2000s, incidence of natural disaster is increasing continuously. Therefore, the necessity of research on the effective disaster response is emphasized. Korea is not safe from natural disaster. Natural disasters like torrential downpours, typhoons have occurred more frequently than before. In addition disasters like droughts and MERS has also occurred. Therefore, needs for effective systems and algorithms to respond disaster are increased. This study covers the vehicle routing problem for effective logistics in disaster situations caused by natural disasters. The emergency vehicle route problem has different property from the general vehicle route problem. It has the property of the importance of deadline, the uncertain and dynamic demand information, and the uncertainty in information transfer. In this study, a solution that focused on the importance of deadline. In this study, the heuristic solution using the genetic algorithm are suggested. Finally the simulation experiment which reflects the actual environment are conducted to verify the performance of the solution.

• Journal of Powder Materials
• /
• v.30 no.5
• /
• pp.424-430
• /
• 2023

YAG phosphor powders were fabricated by the atmospheric plasma spraying method with the spray-dried spherical YAG precursor. The YAG precursor slurry for the spray drying process was prepared by the PVA solution chemical processing utilizing a domestic easy-sintered aluminum oxide (Al₂O₃) powder as a seed. The homogenous and viscous slurry resulted in dense granules, not hollow or porous particles. The synthesized phosphor powders demonstrated a stable YAG phase, and excellent fluorescence properties of approximately 115% compared with commercial YAG:Ce³⁺ powder. The microstructure of the phosphor powder had a perfect spherical shape and an average particle size of approx imately 30 ㎛. As a result of the PKG test of the YAG phosphor powder, the synthesized phosphor powders exhibited an outstanding luminous intensity, and a peak wavelength was observed at 531 nm.

• Journal of Information Processing Systems
• /
• v.5 no.4
• /
• pp.237-242
• /
• 2009

The classical vehicle routing problem (VRP) can be extended by including customers who want to send goods to the depot. This type of VRP is called the vehicle routing problem with pickups and deliveries (VRPPD). This study proposes a novel way to solve VRPPD by introducing a two-phase heuristic routing algorithm which consists of a clustering phase and uses the geometrical center of a cluster and route establishment phase by applying a two-way search of each route after applying the TSP algorithm on each route. Experimental results show that the suggested algorithm can generate better initial solutions for more computer-intensive meta-heuristics than other existing methods such as the giant-tour-based partitioning method or the insertion-based method.

• Journal of Korean Society of Transportation
• /
• v.26 no.5
• /
• pp.185-194
• /
• 2008

The objective of this paper is to design the dynamic route guidance system(DRGS) and develop an ant algorithm based on routing mechanism for finding the multiple shortest paths within limited time in real traffic network. The proposed ant algorithm finds a collection of paths between source and destination considering turn-restrictions, U-turn, and P-turn until an acceptable solution is reached. This method can consider traffic constraints easily comparing to the conventional shortest paths algorithms.

• Journal of Korean Society of Transportation
• /
• v.5 no.1
• /
• pp.3-23
• /
• 1987

Traffic signal control problems in urban street networks are formulated in two ways. In the formulations network flows are assumed to satisfy the user route choice criterion. the first formulation which is called implicit substiuation incorporates user route behavior implicitly in the objective function by recognizing the dependence of the link flows on the signal variables. On the other hands, the second one which is called 'penalty formulation' consists in expressing the route choice conditions in the form of a single nonlinear constraint. Approximate solution algorithm for each of the formulations was investigated in detail and computer codes were written to examine key aspects of each algorithm. A test was done on a network which is small in size but sufficiently complex in representing real-world traffic conditions and the test result shows that both algorithms produce converged solutions. It is recommended, however, that further studies should be done in order to compare the performance of each algorithm more in depth.