• 대한안전경영과학회지
• /
• 제10권1호
• /
• pp.155-166
• /
• 2008

During last two decades the transportation system has developed into very intelligent system with GIS, GPS and ITS. The practical transportation management system provides real time response module to manage the customer's order. We have surveyed research papers on the real time vehicle routing problem in last two decades to figure out the dynamic vehicle routing problem. The papers are classified by basic routing algorithms and by managing the dynamic events which are the order management, the routing re-optimization, the routing post-optimization and the waiting strategy.

• 경영과학
• /
• 제21권3호
• /
• pp.101-113
• /
• 2004

In the rapidly propagating Internet based electronic transaction environment. the importance of real time order confirmation has been more emphasized, In this paper, using data mining techniques, we develop intelligent operations decision model to allow real time order confirmation at the time the customer places an order with required delivery terms. Among various operation plannings used for order fulfillment. mill routing is the first interface decision point to link the order receiving at the marketing with the production planning for order fulfillment. Though linear programming based mathematical optimization techniques are mostly used for mill routing problems, some early orders should wait until sufficient orders are gathered for optimization. And that could effect longer order fulfillment lead-time, and prevent instant order confirmation of delivery terms. To cope with this problem, we provide the intelligent decision model to allow instant order based mill routing decisions. Data mining techniques of decision trees and neural networks. which are more popular in marketing and financial applications, are used to develop the model. Through diverse computational trials with the industrial data from the steel company. we have reported that the performance of the proposed approach is effective compared to the present heuristic only mill routing results. Various issues of data mining techniques application to the mill routing problems having linear programming characteristics are also discussed.

• 대한전자공학회논문지TC
• /
• 제40권12호
• /
• pp.71-82
• /
• 2003

본 논문은 real-time 어플리케이션들을 위한 보나 효과적이고 효율적으로 ant-like mobile agent들이 QoS metrics를 고려하여 네트워크상에서 목적지까지 가장 최적화된 route을 찾는 Ant 알고리듬을 바탕으로 한 QoS 라우팅 알고리듬에서의 route 선택 강화 계산방법을 제시한다. 시뮬레이션 결과 본 논문에서 제시하는 방법이 기존의 방법보다 delay jitter와 bandwidth를 우선으로 하는 real-time application에 대한 가장 최적화된 route을 보다 효과적이고 보다 네트워크 환경에 적응적으로 찾아내는 것을 확인하였다.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제5권11호
• /
• pp.385-392
• /
• 2016

최근에 무선 센서 망에서 이동 싱크를 위한 실시간 라우팅을 지원하기 위한 Expectation Area-based Real-time Routing(EAR2) 프로토콜이 제안되었다. EAR2는 이동 싱크의 예상 지역을 고려하여 예상 지역 내의 플러딩을 이용한다. 그러나, 플러딩은 센서 노드들의 과도한 에너지 소비를 야기하고 실시간 전송에 반하는 긴 전송 지연을 발생한다. 게다가, EAR2는 예상 지역까지 단일 경로만 사용하기 때문에 링크 손실이 많은 무선 센서 망에서 신뢰성 있는 전달을 지원하기 어렵다. 그러므로, 본 논문은EAR2의 이러한 문제들을 해결하기 위해 이동 싱크를 위한 그리드와 다중 경로 기반의 실시간성과 신뢰성 지원 방안을 제안한다. 실시간성을 지원하기 위해 제안 방안은 예상 지역에 추가로 예상 지역 내에 속한 예상 그리드를 고려한다. 제안 방안은 예상 지역 내의 플로딩 대신에 예상 그리드까지의 멀티캐스팅과 예상 그리드에서의 단일 홉 포워딩을 이용한다. 왜냐하면, 멀티캐스팅은 많은 에너지를 절약할 수 있고 단일 홉 포워딩은 적은 전송 지연을 가지기 때문이다. 또한, 제안 방안은 신뢰성을 지원하기 위해 예상 그리드까지 링크 손실에 대처가 가능한 다중 경로를 사용한다. 시뮬레이션 결과는 제안 방안이 기존 방안들보다 성능이 우수함을 보여준다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2007년도 춘계학술발표대회
• /
• pp.1195-1198
• /
• 2007

In this paper we study the problem of real time support in wireless sensor networks and propose a Real time Geographic Routing Protocol (ReGeo) which routes a packet towards the destination based on a compromise between distance and queue count to reduce traffic concentration wherever it has been determined to be too high and uses Gradient Table to store the route satisfying the delay constraints. We describe our prototype implementation of ReGeo Routing in TOSSIM - a TinyOS mote simulator. The simulation results show that the proposed routing protocol not only increases the packet delivery ratio but also keeps overall End to End Delay under a bounded value.

• 한국통신학회논문지
• /
• 제38A권8호
• /
• pp.688-696
• /
• 2013

무선 센서 네트워크의 실시간 응용은 데이터 전송의 적시성이 보장되어야 한다. 제한적 멀티-홉 정보 기반의 라우팅 기법은 제한된 범위 내에서 멀티-홉 실시간 정보를 수집하고 데이터 전송 경로를 구성함으로써 실시간 데이터 전송 성공률을 높인다. 하지만 멀티-홉 정보가 점진적으로 수집되기 때문에 멀티-홉의 실시간 정보를 기반으로 한 데이터 전송 경로를 구성하기 위해서는 일정 수준의 초기화 시간이 필요하다. 따라서 발생 위치가 고정된 이벤트에서는 효과적이지만 이벤트가 연속적으로 이동한다면 단일 홉의 실시간 정보만 반영된 경로가 구성될 수 있기 때문에 이벤트 이동성을 효과적으로 지원할 수 없다. 본 논문에서는 리다이렉팅 기법을 활용한 라우팅 기법을 제안한다. 제안 기법은 이동한 이벤트를 감지한 새로운 노드에서 멀티-홉의 실시간 정보 수집이 완료된 지역의 노드로 데이터를 리다이렉팅함으로써 이벤트 이동성을 효과적으로 지원한다. 시뮬레이션 결과 제안된 방안이 기존 연구들과 비교하여 에너지 효율성 및 시간 내 전송 성공률 등이 우수함을 보인다.

• Journal of Information Processing Systems
• /
• 제8권4호
• /
• pp.589-602
• /
• 2012

With the increasing demand for real time applications in the Wireless Senor Network (WSN), real time critical events anticipate an efficient quality-of-service (QoS) based routing for data delivery from the network infrastructure. Designing such QoS based routing protocol to meet the reliability and delay guarantee of critical events while preserving the energy efficiency is a challenging task. Considerable research has been focused on developing robust energy efficient QoS based routing protocols. In this paper, we present the state of the research by summarizing the work on QoS based routing protocols that has already been published and by highlighting the QoS issues that are being addressed. The performance comparison of QoS based routing protocols such as SAR, MMSPEED, MCMP, MCBR, and EQSR has also been analyzed using ns-2 for various parameters.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1685-1688
• /
• 2002

Application Routing Load Balancing (ARLB) is a novel load balancing mode that combines QoS routing and load balancing in per application to support QoS far real-time application based on wired network. Zone Routing Protocol (ZRP) is a recent hybrid proactive/reactive routing approach in an attempt to achieve scalability of ad-hoc network. This routing approach has the potential to be efficient in the generation of control traffic than traditional routing schemes. Up to now, without proper load balancing tools, the ZRP can actually guarantee QoS for delay-sensitive applications when congestion occurred in ad-hoc network. In this paper, we propose the ARLB to improve QoS fur delay-sensitive applications based on ZRP in ad-hoc network when congestion occurred and to be forwarding mechanism fur route coupling to support QoS for real-time applications. The critical point is that the routing metric of ARLB is originally designed for wired network environment. Therefore, we study and present an appropriate metric or cost computation routing of ARLB for recently proposed ZRP over ad-hoc network environment.

• 한국경영과학회지
• /
• 제25권4호
• /
• pp.97-109
• /
• 2000

This work proposes a neural network approach to solve vehicle routing problems which have diverse application areas such as vehicle routing and robot programming. In solving these problems, classical mathematical approaches have many difficulties. In particular, it is almost impossible to implement a real-time vehicle routing with multiple vehicles. Recently, many researchers proposed methods to overcome the limitation by adopting heuristic algorithms, genetic algorithms, neural network techniques and others. The most basic model for path planning is the Travelling Salesman Problem(TSP) for a minimum distance path. We extend this for a problem with dynamic upcoming of new positions with multiple vehicles. In this paper, we propose an algorithm based on SOM(Self-Organization Map) to obtain a sub-optimal solution for a real-time vehicle routing problem. We develope a model of a generalized multiple TSP and suggest and efficient solving procedure.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권5호
• /
• pp.1708-1734
• /
• 2022

In the development of logistics system, the breakthrough of important technologies such as technology platform for logistics information management and control is the key content of the study. Based on Javascript and JQuery, the logistics system realizes real-time monitoring, collection of historical status data, statistical analysis and display, intelligent recommendation and other functions. In order to strengthen the cooperation of warehouse storage, enhance the utilization rate of resources, and achieve the purpose of real-time and visual supervision of transportation equipment and cargo tracking, this paper studies the VNF dynamic deployment and SFC routing problem in the network load change scenario based on the logistics system. The BIP model is used to model the VNF dynamic deployment and routing problem. The optimization objective is to minimize the total cost overhead generated by each SFCR. Furthermore, the application of the SFC mapping algorithm in the routing topology solving problem is proposed. Based on the concept of relative cost and the idea of topology transformation, the SFC-map algorithm can efficiently complete the dynamic deployment of VNF and the routing calculation of SFC by using multi-layer graph. In the simulation platform based on the logistics system, the proposed algorithm is compared with VNF-DRA algorithm and Provision Traffic algorithm in the network receiving rate, throughput, path end-to-end delay, deployment number, running time and utilization rate. According to the test results, it is verified that the test results of the optimization algorithm in this paper are obviously improved compared with the comparison method, and it has higher practical application and promotion value.