• 대한안전경영과학회지
• /
• 제15권2호
• /
• pp.193-204
• /
• 2013

The growing logistics strategy of a company is to optimize their vehicle route scheduling in their supply chain system. It is very important to analyze for continuous pickups and delivery vehicle scheduling. This paper is a computational study to investigate the effectiveness of continuous pickups and delivery vehicle routing problems. These scheduling problems have 3 subproblems; Inbound Vehicle Routing Problem with Makespan and Pickup, Line-haul Network Problem, and Outbound Vehicle Routing Problem with Delivery. In this paper, we propose 5 heuristic Algorithms; Selecting Routing Node, Routing Scheduling, Determining Vehicle Type with Number and Quantity, and Modification Selecting Routing Node. We apply these Algorithms to S vehicle company. The results of computational experiments demonstrate that proposed methods perform well and have better solutions than other methods considering the basic time and due-date.

• 한국군사과학기술학회지
• /
• 제18권4호
• /
• pp.432-440
• /
• 2015

UGVs(Unmanned Ground Vehicles) are robots that can substitute humans in reconnaissance operations of potentially dangerous and contaminated sites. Currently, there have been active research on utilizing UGVs in military environments. Much resrach has been focused on exploiting the weakness of topology-based routing and instead utilize location-based routing for the networking of UGVs. It is generally assumed that location-based routing methods can fully utilize the location information gained from GPS. However, this may not be possible in tactical environments due to enemy GPS jamming and LOS(Line of Sight) limitations. To solve this problem, we propose a location-based routing scheme utilizing low control message that can calibrate the location information using GPS information as well as location of neighboring UGV, movement direct and speed information. Also utilizing topology-based routing scheme to solve incorrect location information in GPS jamming region.

• 상하수도학회지
• /
• 제12권2호
• /
• pp.127-139
• /
• 1998

The objectives of this study is at the development of the channel routing model which can be used for flood prediction. Among the routing models, the hydraulic technique of the implicit scheme in the dynamic equation is selected to route the unsteady varied flow in the open channel. The channel routing model is catchment runoff which computed by the conceptual and transfer function model. The conceptual and transfer function model can simulate the catchment runoff accurately. As a result of investigating the channel routing model, the optimal weighting factor ${\theta}$ which fixes two points between time line is chosen, and also, the optimal error tolerance which satisfies computing time and converge of solution is determined in this study.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2231-2252
• /
• 2012

With the prevalence of diverse services-oriented applications, such as IPTV systems and on-line games, the current underlying communication networks face more and more challenges on the aspects of flexibility and adaptability. Therefore, an effective and efficient multicast routing mechanism, which can fulfill different requirements of different personalized services, is critical and significant. In this paper, we first define the neighbor gradient, which is calculated based on the weighted sum of attributes such as residual link capacity, normalized hop count, etc. Then two distributed multicast routing algorithms which are neighbor Gradient-based Multicast Routing for Static multicast membership (GMR-S) and neighbor Gradient-based Multicast Routing for Dynamic multicast membership (GMR-D), are proposed. GMR-S is suitable for static membership situation, while GMR-D can be used for the dynamic membership network environment. Experimental results demonstrate the effectiveness and efficiency of our proposed methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.939-955
• /
• 2010

With the progress of IT and mobile positioning technologies, various types of location-based services (LBS) have been proposed and implemented. Finding a shortest path between two nodes is one of the most fundamental tasks in many LBS related applications. So far, there have been many research efforts on the shortest path finding problem. For instance, $A^*$ algorithm estimates neighboring nodes using a heuristic function and selects minimum cost node as the closest one to the destination. Pruning method, which is known to outperform the A* algorithm, improves its routing performance by avoiding unnecessary exploration in the search space. For pruning, shortest paths for all node pairs in a map need to be pre-computed, from which a shortest path container is generated for each edge. The container for an edge consists of all the destination nodes whose shortest path passes through the edge and possibly some unnecessary nodes. These containers are used during routing to prune unnecessary node visits. However, this method shows poor performance as the number of unnecessary nodes included in the container increases. In this paper, we focus on this problem and propose a new border line-based pruning scheme for path routing which can reduce the number of unnecessary node visits significantly. Through extensive experiments on randomly-generated, various complexity of maps, we empirically find out optimal number of border lines for clipping containers and compare its performance with other methods.

• 인터넷정보학회논문지
• /
• 제12권5호
• /
• pp.11-19
• /
• 2011

본 논문에서는 계층적 QoS 라우팅을 위해 소스 라우팅 방식을 채택하고 있는 전달망에서 집단화된 링크 상태 정보의 정확성을 높이기 위한 서비스경계라인 근사법을 제안한다. 이 방법은 기존 집단화 과정에서 몇몇 경로 가중치들의 소멸로 높아지는 정보 왜곡을 줄이기 위해 주요 경로 가중치를 선정한 후 집단화 정보와 함께 외부망에 전달하는 것으로 지연과 대역폭을 동시에 QoS 파라미터로 갖는 집단화에 유용하다. 본 논문에서는 주요 경로 가중치를 가외치(outlier)로 정의한다. 제안 방법은 링크 당 집단화된 상태 정보를 저장하기 위해서 2k+5개의 파라미터를 갖는다. k는 가외치 개수로 가외치 선정 방법에 따라 달라진다. 모의 실험 결과 제안 방법이 가외치 선정이란 특수성 때문에 기존 방법들에 비해 1.5~2배 이상의 저장 공간을 갖지만 저장 공간과 정보 정확성 증가 비율로 고려한다면 제안 방법이 정보 정확성이 높음을 알 수 있었다.

• Nuclear Engineering and Technology
• /
• 제28권4호
• /
• pp.390-396
• /
• 1996

Piping Systems are usually designed for thermal expansion loads based on uniform temperatures at each cross section. However, in lines with low flow rates such as surge lines and spray lines, large transverse temperature gradients have been observed, resulting in too types of additional thermal stresses : (1) local thermal gradient stresses which are independent of routing and supports and (2) gross bending stresses due to induced pipe curvature which are routing and support system dependent. This paper presents a simplified method for analyzing a PER surge line for stratified flow.

• 산업공학
• /
• 제15권4호
• /
• pp.374-381
• /
• 2002

In this paper, we design and implement a real-time route guidance system(RGS) in large-scale networks. Coupled with the well-known mathematical routing algorithms, we devise an RGS for knowledge aquisition and self-learning ability within the framework of the expert system. Through off-line construction of database, on-line treatment of unexpected traffic accidents, etc., the developed RGS can provide drivers with good quality real-time routing information. The practical effectiveness of the proposed system is demonstrated in terms of response time and route appropriateness.

• 디지털융복합연구
• /
• 제14권8호
• /
• pp.261-267
• /
• 2016

본 논문에서는 센서 네트워크를 위한 Radical line을 기반으로 한 센서 노드간의 Range-free 지역화 알고리즘에 대해 연구한다. 무선 센서 네트워크에서 라우팅 기법은 센서 네트워크의 전체적인 에너지 소모량을 감소시키거나 모든 센서 노드들의 균등한 에너지 소비를 유도해야 한다. 특히 데이터가 전송할 데이터의 양이 많아지면 에너지 소모가 심해지는데 이를 극복하기 위한 새로운 방식들이 제안되었다. 그 결과 전체적인 에너지 소모량을 균등하게 조절할 수 있게 되었다. 이를 위해 논문에서도 적은 연산으로 주변 노드의 위치정보를 획득할 수 있는 지역화 알고리즘을 설계한다. 알고리즘의 연산을 위해 Radical Line을 적용한다. 실험환경은 운영체제는 윈도우 7, 플랫폼은 Visual C++ 2010으로 실험하였다. 실험결과 0.1837의 에러율로 지역화를 수행할 수 있었다.

• 전기학회논문지
• /
• 제56권11호
• /
• pp.1879-1884
• /
• 2007

In the electric power industry, it is important that the supply of energy must be guaranteed. Many power utilities control and supervise the transmission line to avoid power failures. In case of underground tunnel, some troubles are reported in cable joint. To stabilize the power, it is needed to monitor the cable joint. Many researches of cable joint monitoring have been going on by partial discharge measurement and temperature measurement using optical cable. These methods need much cost to install and maintain, so it is only used in critical transmission line. In this research, we use wireless sensor technology, because of its low cost and easy installation. We develop the temperature monitoring system for cable joint. Temperature sensor is installed on the surface of cable joint and sends data to server through router node using wireless network. Generally Ad hoc routing is searched in wireless network. However, in this research, we design the static linear routing mechanism, which is suitable for electric power line monitoring and analyze the life time of the sensor node by measuring the amount of the battery consumption.