• 한국건축시공학회지
• /
• 제17권4호
• /
• pp.369-375
• /
• 2017

본 연구는 제설작업의 효율성을 높일 수 있도록 제설차량의 작업구간 할당 및 제설기지 위치를 최적화할 수 있는 PSO 알고리듬을 제시하였다. 기존의 PSO 알고리듬을 개선하여 해공간의 탐색 성능을 높일 수 있는 개선된 알고리듬을 제시하였으며, 제설차량의 작업구간 할당 문제에 적용할 수 있도록 개체의 표현 및 적합도 합수값을 제시하였다. 또한 제시한 알고리듬의 타당성을 검증하기 위하여 지자체의 실제 사례에 적용하였으며, 기존 알고리듬과 개선된 알고리듬을 비교하였다. 그 결과 개선된 PSO의 경우 기존 알고리듬보다 폭넓게 해공간을 탐색하여 지역해에 빠지지 않고 더 우수한 해를 도출하는 것을 알 수 있다. 또한 개별 제설차량의 작업부하가 평준화될 수 있도록 작업구간을 할당할 수 있으며, 할당된 작업구간에 가장 가까운 지점을 도출하여 제설전진기지의 위치를 결정하는데 활용될 수 있음을 알 수 있었다.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2002년도 추계학술대회 논문집(I)
• /
• 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.

• 한국정밀공학회지
• /
• 제29권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
• /
• 제18권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• 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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• 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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• 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.

• 한국정보과학회논문지:정보통신
• /
• 제34권1호
• /
• pp.33-40
• /
• 2007

멀티호밍은 하나의 기업 혹은 자율 시스템(AS, Autonomous System)이 둘 이상의 인터넷 서비스 제공업체(ISP, Internet Service Provider)로부터 인터넷 연결 서비스를 제공받는 메커니즘이다. 멀티호밍 메커니즘을 사용하는 AS는 망 내의 호스트들에게 여러 ISP를 통하여 좋은 성능과 신뢰성을 가지는 인터넷 연결을 제공할 수 있다. IPv6 멀티호밍에서는 멀티호밍 사이트가 하나의 ISP하의 연결에 문제가 발생하였을 경우 멀티호밍 사이트로 전송되어야 하는 패킷을 손실 없이 목적지로 전달할 수 있도록 하기 위하여 Non-direct EBGP(Exterior Border Gateway Protocol)를 통한 터널링 메커니즘이 정의되었다. 그러나 이 메커니즘의 경우 신뢰성 있는 인터넷 연결은 제공하지만 통신 경로가 최적화되지 못하는 문제점을 가진다. 본 논문에서는 IPv6 멀티호밍 환경에서 IPv6 확장 헤더를 사용함으로써 멀티호밍 사이트가 하나의 ISP와의 연결에 문제가 발생하였을 경우에 최적화된 경로를 통하여 신뢰성 있는 인터넷 연결을 제공할 수 있는 메커니즘을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권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
• /
• 제21권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.