• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.6
• /
• pp.1845-1850
• /
• 2014

Railway operators have given a lot of efforts to determine the railway route of the minimum cost. In order to determine the optimal alignment, the alignment should be allocated satisfying the design criteria on various geographical condition with the minimum earth works. The determination of the optimal railway alignment is a kind of combination optimization because that must consider various design elements. This study developed a numerical model to determine the optimal railway alignment with the minimum construction cost. The problem was analyzed by the genetic algorithm, and the concept of the optimal alignment was established with the results from the analyses. The methodology was applied to a fictitious rail construction section and the result was evaluated. This methodology is meaningful considering the fact that the cost for energy is greater than that of the construction.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.23 no.2
• /
• pp.1-14
• /
• 2024

The most optimal route-search algorithm thus far has introduced a method of applying node labels and link labels. Node labels consider two nodes simultaneously in the optimal route-search process, while link labels consider two links simultaneously. This study proposes a turn-label-based optimal route-search technique that considers two turns simultaneously in the process. Turn-label-based optimal route search guarantees the optimal solution of dynamic programming based on Bellman's principle as it considers a two-turn search process. Turn-label-based optimal route search can accommodate the advantages of applying link labels because the concept of approaching the limit of link labels is applied equally. Therefore, it is possible to reflect rational cyclic traffic where nodes allow multiple visits without expanding the network, while links do not allow visits. In particular, it reflects the additional cost structure that appears in two consecutive turns, making it possible to express the structure of the travel-cost function more flexibly. A case study was conducted on the metropolitan urban railway network consisting of transportation card terminal readers, aiming to examine the scalability of the research by introducing parameters that reflect psychological resistance in travel with continuous pedestrian transfers into turn label optimal path search. Simulation results showed that it is possible to avoid conservative transfers even if the travel time and distance increase as the psychological resistance value for continuous turns increases, confirming the need to reflect the cost structure of turn labels. Nevertheless, further research is needed to secure diversity in the travel-cost functions of road and public-transportation networks.

• 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 for Geospatial Information Science
• /
• v.24 no.1
• /
• pp.69-80
• /
• 2016

Some studies were conducted for the purpose of minimizing total clearance time for rapid evacuation from the indoor spaces when disaster occurs. Most studies took a long time to calculate the optimal evacuation route that derived minimum evacuation time. For this reason, this study proposes an evacuation route assignment algorithm that can shorten the total clearance time in a short operational time. When lots of exits are in the building, this algorithm can shorten the total clearance time by assigning the appropriate pedestrian traffic volume to each exit and balances each exit-load. The graph theory and greedy algorithm were utilized to assign pedestrian traffic volume to each exit in this study. To verify this algorithm, study used a cellular automata-based evacuation simulator and experimented various occupants distribution in a building structure. As a result, the total clearance time is reduced by using this algorithm, compared to the case of evacuating occupants to the exit within shortest distance. And it was confirmed that the operation takes a short time In a large building structure.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2018.05a
• /
• pp.318-320
• /
• 2018

When a ship sails on sea, it may be influenced by the environmental disturbance such as wind, wave, sea surface temperature, etc. These affect on the ship's speed, fuel consumption, safety and operating performance. It is necessary to find the optimal weather route of a ship to avoid adverse weather conditions which can put the crews in serious danger or cause structural damage to the vessel, machinery, and equipment. This study introduced how to apply A* algorithm based on sea trial test data for determining the optimal ship routes. The path cost function was modelled as a function of minimum arrival time or minimum energy depending on the time of various environment conditions. The specially modelled path-cost function and the safety constraints were applied to the A* algorithm in order to find the optimal path of the ship. The comparison of ship performances estimated by real sea trial's path and estimated optimal route during the voyage of the ship was investigated. The result of this study can be used to create a schedule to ensure safe operation of the ship with short passage time or minimum energy. In addition, the result of this study can be integrated into an on-board decision supporting expert system and displayed in Electronic Chart Display and Information System (ECDIS) to provide all the useful information to ship master.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10b
• /
• pp.79-82
• /
• 1987

This paper describes the mobile robot system to recognize the guidance tape, and presents the locomotion algorithm. It is composed of image processing unit, A/ID converter and camera. This system converts video image to binary image by setting an optimal threshold and obtains the parameters to move the robot. The mobile robot moves according to the programmed route in memory. But after recognized the obstacle on the locomotion route, this system constructs the new route and the robot moves following the new route.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1790-1806
• /
• 2015

Utility-based routing is a special type of routing approach using a composite utility metric when making routing decisions in ad hoc and sensor networks. Previous studies on the utility-based routing all use fixed retry limit and a very simple distance related energy model, which makes the utility maximization less efficient and the implementation separated from practice. In this paper, we refine the basic utility model by capturing the correlation of the transmit power, the retry limit, the link reliability and the energy cost. A routing algorithm based on the refined utility model with adaptive transmit power and retry limit allocation is proposed. With this algorithm, packets with different priorities will automatically receive utility-optimal delivery. The design of this algorithm is based on the observation that for a given benefit, there exists a utility-maximum route with optimal transmit power and retry limit allocated to intermediate forwarding nodes. Delivery along the utility-optimal route makes a good balance between the energy cost and the reliability according to the value of the packets. Both centralized algorithm and distributed implementations are discussed. Simulations prove the satisfying performance of the proposed algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.448-449
• /
• 2016

Enlargement and complexification of current structures increase the expected casualty in case of accident in those e.g., fire. In that case, there only have been basic instructions such as announcement of that situation, alarm bell, exit signs, etc. but any guidance to lead to proper escape route was not been provided so far. To tackle the problem, several schemes have been proposed. However, various risk factors were not considered and route discovery performance must be improved to be applied to structures. Therefore, this paper proposes an optimal route discovery system for emergency escape from disaster situations which takes into account various possible risk factors and enhances the searching efficiency by using the $A^{\ast}$ algorithm. Performance evaluation by computer simulation shows that the proposed scheme effectively leads to safe escape route.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.2911-2913
• /
• 1999

This paper suggest an optimal identification method to complex and nonlinear system modeling that is based on Fuzzy-Neural Network(FNN). The FNN modeling implements parameter identification using HCM algorithm and optimal identification algorithm structure combined with two types of optimization theories for nonlinear systems, we use a HCM Clustering Algorithm to find initial parameters of membership function. The parameters such as parameters of membership functions, learning rates and momentum coefficients are adjusted using optimal identification algorithm. The proposed optimal identification algorithm is carried out using both a genetic algorithm and the improved complex method. Also, an aggregate objective function(performance index) with weighted value is proposed to achieve a sound balance between approximation and generalization abilities of the model. To evaluate the performance of the proposed model, we use the time series data for gas furnace, the data of sewage treatment process and traffic route choice process.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.9
• /
• pp.2037-2043
• /
• 2015

Proposed algorithm in this thesis introduced cells, units of router group, to conduct distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. Also, through this experiment, in case of a network was damaged in existing optimal path algorithm, Dijkstra algorithm, the proposed algorithm was designed to route an alternative path and also as it has a 2nd shortest path in cells of the damaged network so it is faster than Dijkstra algorithm, The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.