• Journal of the Korea Institute of Building Construction
• /
• v.17 no.4
• /
• pp.369-375
• /
• 2017

This study suggests PSO(Particle Swarm Optimization) algorithm that optimizes the snowplow route allocation and the location of the snow control material storage to improve the efficiency in snow removal works. The modified PSO algorithm for improving the search capacity is proposed, and this study suggests the solution representation, the parameter setting, and the fitness function for the given optimization problems. Computational experiments in real-world case are carried out to justify the proposed method and compared with the traditional PSO algorithms. The results show that the proposed algorithms can find the better solution than the traditional PSO algorithms by searching for the wider solution space without falling into the local optima. The finding of this study is efficiently employed to solve the optimization of the snowplow route allocation by minimizing the workload of each snowplow to search the location of the snow control material storage as well.

• Proceedings of the KSR Conference
• /
• 2002.10a
• /
• pp.727-732
• /
• 2002

This study is to develop the model of alignment optimization based on design criteria by approaching through alignment of railway design and problems in economy, environment and technology for satisfying traffic volume of the main roads caused by economical and social developments. Now, Geographic Information System isn't applied when designing a present railway in home. And the design of railway alignment is still set on importance of transition curves and cant according to passenger comfort in abroad so tile study of railway alignment is at initiation phase so far. This paper is about decision of optimal alignment between two stations such as starting point and ending point automatically using GIS in optimization of railway alignment. A route between Sungsan city and Shinpung city is the training area and the study compared and evaluated optimal railway route by GIS automatically with present railway route designed. Present optimal fomulas was used in this study for optimization of railway alignment. The model of optimization of railway alignment was developed through topographical elements and it was mentioned by the model of road alignment because of the similarity in design of alignment. But the design of lateral track irregularities, cant fur passenger comfort and motion sickness fellowed by train rolling have to be considered more. Anyway, this study farmed the basis of using GIS and the study should be keep going on in the future.

• Journal of the Korean Society for Precision Engineering
• /
• v.29 no.4
• /
• pp.469-478
• /
• 2012

This study aims to discover the optimal pipe layout for a ship, which generally needs a lot of time, efforts and experiences. Genetic algorithm was utilized to search for the optimum. Here the optimum stands for the minimum pipe length between two given points. Genetic algorithm is applied to planar pipe layout problems to confirm plausible and efficiency. Sub-programs are written to find optimal layout for the problems. Obstacles are laid in between the starting point and the terminal point. Pipe is supposed to bypass those obstacles. Optimal layout between the specified two points can be found using the genetic algorithm. Each route was searched for three case models in two-dimensional plane. In consequence of this, it discovered the optimum route with the minimized distance in three case models. Through this study, it is possible to apply optimization of ship pipe route to an actual ship using genetic algorithm.

• Journal of information and communication convergence engineering
• /
• v.18 no.1
• /
• pp.22-27
• /
• 2020

Content centric networking (CCN) is regarded as promising internet architecture because it can provide network efficiency in terms of bandwidth consumption by separating contents from a specific network location and decrease network congestion events. However, the application of a CCN does not widely consider the side effects of mobile devices, particularly mobile content sources. For content source mobility, a full routing update is required. Therefore, in this study, a route optimization scheme is proposed for mobile content sources in a CCN environment to provide low communication overhead, short download time, and low resource consumption. The proposed scheme establishes a direct path between content requesters and a mobile content source for the exchange of interest and data packets using interest-piggybacked data packets. Based on the inherent CCN naming characteristics, the content source does not know the name prefix of the content consumer, and thus the proposed optimized CCN scheme utilizes the content router in the home domain of the content source.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.42-46
• /
• 2004

Mobile IP [9] was introduced to help the mobile user to be contacted with a single IP address even though the point-of-access changes. However, mobile IP creates the so-called 'triangle routing' which makes the delays for data packets longer, as well as creating unnecessary traffic at the home network of the mobile user. To overcome this, Route Optimization (RO) for mobile IP [1] was proposed, which eliminated the triangle routing phenomenon. But [l] requires that the network protocol stack of all existing hosts to change. Privacy is also another matter to be considered. This paper introduces a scheme called Peer Agent scheme to implement RO for mobile IP without requiring existing hosts to change. Method to preserve location privacy while still enabling RO is also considered.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.70-73
• /
• 2004

We have developed an optimization algorithm based formulation for performing efficient time driven simultaneous place and route for FPGAs. Field programmable gate array (FPGAs) provide of drastically reducing the turn-around time for digital ICs, with a relatively small degradation in performance. For a variety of application specific integrated circuit application, where time-to-market is most critical and the performance requirement do not mandate a custom or semicustom approach, FPGAs are an increasingly popular alternative. This has prompted a substantial amount of specialized synthesis and layout research focused on maximizing density, minimizing delay, and minimizing design time.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.737-740
• /
• 1999

This paper deals with a real time optimization algorithm within real time for DRGS(Dynamic Route Guidance System) and evaluate the algorithm. A pre-developed system offers the optimal route in using only static traffic information. In using real-time traffic information, Dynamic route guidance algorithm is needed. The serious problem in implementing it is processing time increase as nodes increase and then the real time processing is impossible. Thus, in this paper we propose the optimal route algorithm with window mechanism for the real-time processing and then evaluate the algorithms.

• Journal of KIISE:Information Networking
• /
• v.34 no.1
• /
• pp.33-40
• /
• 2007

A multihomed enterprise or AS(Autonomous System) improves reliability and performance by acquiring its Internet connectivity from more than two ISP(Internet Service Provider). Multihoming protocol must allow a multihomed site whose connectivity through one of the ISPs fails to keep its Internet connectivity As one of mechanisms to do this, tunneling mechanism through Non-direct EBGP(Exterior Border Gateway Protocol) is defined. This mechanism makes connectivity to the Internet more reliable, but causes the problem that makes the communication route non-optimal. In this paper, we propose the route optimization mechanism using an extension header in the IPv6 multihoming environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2357-2375
• /
• 2013

Message ferry is a controllable mobile node with large capacity and rechargeable energy to collect information from the sensors to the sink in wireless sensor networks. In the existing works, route of the message ferry is often designed from the solutions of the Traveling Salesman Problem (TSP) and its variants. In such solutions, the ferry route is often a simple cycle, which starts from the sink, access all the sensors exactly once and moves back to the sink. In this paper, we consider a different case, where the ferry route is a closed walk that contains more than one simple cycle. This problem is defined as the Closed Walk Ferry Route Design (CWFRD) problem in this paper, which is an optimization problem aiming to minimize the average weighted delay. The CWFRD problem is proved to be NP-hard, and the Integer Linear Programming (ILP) formulation is given. Furthermore, a heuristic scheme, namely the Initialization-Split-Optimization (ISO) scheme is proposed to construct closed walk routes for the ferry. The experimental results show that the ISO algorithm proposed in this paper can effectively reduce the average weighted delay compared to the existing simple cycle based scheme.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.342-352
• /
• 2021

Multicast Routings is a big challenge due to limitations such as node power and bandwidth Mobile Ad-hoc Network (MANET). The path to be chosen from the source to the destination node requires protocols. Multicast protocols support group-oriented operations in a bandwidth-efficient way. While several protocols for multi-cast MANETs have been evolved, security remains a challenging problem. Consequently, MANET is required for high quality of service measures (QoS) such infrastructure and application to be identified. The goal of a MANETs QoS-aware protocol is to discover more optimal pathways between the network source/destination nodes and hence the QoS demands. It works by employing the optimization method to pick the route path with the emphasis on several QoS metrics. In this paper safe routing is guaranteed using the Secured Multicast Routing offered in MANET by utilizing the Ant Colony Optimization (ACO) technique to integrate the QOS-conscious route setup into the route selection. This implies that only the data transmission may select the way to meet the QoS limitations from source to destination. Furthermore, the track reliability is considered when selecting the best path between the source and destination nodes. For the optimization of the best path and its performance, the optimized algorithm called the micro artificial bee colony approach is chosen about the probabilistic ant routing technique.