• 제목/요약/키워드: Optimum routing

검색결과 67건 처리시간 0.018초

네트워크 모형화에 의한 최적 항로 결정 (On the optimum ship routing by network modeling)

  • Lee, Hee-Yong;Kim, Si-Hwa;Song, Jae-Uk
    • 한국항해항만학회:학술대회논문집
    • /
    • 한국항해항만학회 2001년도 Proceeding of KIN-CIN Joint Symposium 2001 on Satellite Navigation/AIS, lntelligence , Computer Based Marine Simulation System and VDR
    • /
    • pp.89-99
    • /
    • 2001
  • Optimum Ship Routing can be defined as “The selection of an optimum track for a transoceanic crossing by the application of long-range predictions of wind, waves and currents to the knowledge of how the routed vessel reacts to these variables”. This paper treats the methodology how to serve optimum ship routing problem by network modeling and reveals the validity of the network model by some numerical experiments.

  • PDF

네트워크 모형화에 의한 최적 항로 결정 (On the optimum ship routing by network modeling)

  • 이희용;김시화
    • 한국항해학회지
    • /
    • 제25권3호
    • /
    • pp.211-223
    • /
    • 2001
  • Optimum Ship Routing can be defined as \"The selection of an optimum track for a transoceanic crossing by the application of long-range predictions of wind, waves and currents to the knowledge of how the routed vessel reacts to these variables\". This paper treats the methodology how to solve optimum ship routing problem by network modeling and reveals the validity of the network model by some numerical experiments.periments.

  • PDF

Multi-path Routing Protocol with Optimum Routes Finding Scheme in Wireless Sensor Networks

  • Keuma, Tae-Hoon;Bu, Ki-Dong;Kim, Hyun-Sung;Lee, Sung-Woon
    • 한국산업정보학회:학술대회논문집
    • /
    • 한국산업정보학회 2008년도 추계 공동 국제학술대회
    • /
    • pp.449-454
    • /
    • 2008
  • Finding an energy efficient route is one of the very important issues in the wireless sensor networks. The route scheme should consider both of the energy level of sensor nodes and the number of hops at the same time. First of all, this paper proposes an optimum routes finding scheme (ORFS), which could be used in the sensor network routing protocols. The scheme uses an optimum value for the path with the considerations of both the minimum energy level of a path and the number of hops at the same time. After that, this paper proposes a routing protocol based on the ORFS for how it could be used for the multipath directed diffusion with data aggregation (MDD-A), to get the better energy efficiency. The analysis result shows that the proposed routing protocol could lengthen the network life cycle about 18.7% compared to the previous MDD-A related protocols.

  • PDF

운항 안전 및 효율성 향상을 위한 최적 항로 평가 시스템 기본 연구 (Basic Research of Optimum Routing Assessment System for Safe and Efficient Voyage)

  • 이진호;최경순;박건일;김문성;방창선
    • 대한조선학회논문집
    • /
    • 제42권1호
    • /
    • pp.57-63
    • /
    • 2005
  • This paper introduces basic research of optimum routing assessment system as voyage support purpose which can obtain safe and efficient route. In view point of safety, the prediction of ship motion should be evaluated in the condition of rough weather This part includes general seakeeping estimation based on 3 dimensional panel method and parametric roil prediction. For increasing voyage efficiency, ETA(Estimated Time of Arrival) and fuel consumption should be calculated considering speed reduction and power increase due to wave effects based on added resistance calculation and ship performance characteristics. Basically, the weather forecast is assumed to be prepared previously to operate this system. The idea of these factors in this system will be helpful to escape from dangerous voyage situation by wave conditions and to make optimum route planning based on ETA and fuel consumption.

순위차원라우팅을 사용한 완전 이진트리의 3차원 메쉬로의 링크 충돌 없는 임베딩 (Link-Disjoint Embedding of Complete Binary Trees into 3D-Meshes using Dimension-Ordered Routing)

  • 박상명;이상규;문봉희
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제27권2호
    • /
    • pp.169-176
    • /
    • 2000
  • 본 논문에서는 령크 충돌을 최소화 하는데 중점을 두고 순위차원 라우팅을 사용하여 완전이진트리를 3차원 메쉬로 임베딩하는 방법을 제안한다. 기존의 연구[14]에서는, 완전이진트리를 3차원 메쉬에 임베딩 할 때 순위차원 라우팅을 사용하는 경우 1, 2 차원에서 링크 충돌이 발생하였고, 순위차원 라우팅을 따르지 않는 경우 1차원에서만 링크 충돌이 존재하도록 하는 임베딩 방법을 보였었다. 이와 비교하여 본 논문에서는 순위차원 라우팅을 사용하고 링크 충돌이 존재하지 않는 임베딩 방법을 제안하며, 이 방법에 의해 임베딩을 수행한 결과, 임베딩을 위해 사용된 메쉬의 크기가 최적크기의 1.27 배를 넘지 않음을 증명한다.

  • PDF

선박용 배관의 Auto-Routing을 위한 설계 전문가 시스템 (Pipe Atuo-Routing with Design Knowledge-base)

  • 강상섭;명세현;한순흥
    • 한국CDE학회논문집
    • /
    • 제2권1호
    • /
    • pp.1-10
    • /
    • 1997
  • Finding the optimum route of ship's pipes is complicated and time-consuming process. Experience of designers is the main tool in this process. To reduce design man-hours and human errors a design expert system shell and a geometric modeler is used to automate the design process. In this paper, a framework of the intelligent CAD system for pipe auto-routing is suggested, which consists of general-purpose expert system shell and a geometric modeler. The design expert system and the geometric modeling kernel have been integrated. The CADDS5 of Computervision is used as the overall CAD environment. The Nexpert Object of Neuron Data is used as the expert system shell. The CADDS5 ISSM is used as the interface that creates and modifies geometric models of pipes. Existing algorithms for the routing problem have been analyzed. Most of them are to solve the 2-D circuit routing problems. Ship piping system, specially within the engine room, is a complicated, large scale 3-D routing problem. Methods of expert system have been used to find the route of ship pipes on the main deck.

  • PDF

선박 최적운항시스템을 위한 추진성능 데이터베이스 생성 연구 (A Study on the Database Generation of Propulsion Performance for Ships Optimum Routing System)

  • 김은찬;강국진;이한진
    • 한국항해항만학회지
    • /
    • 제40권3호
    • /
    • pp.97-103
    • /
    • 2016
  • 최적의 선박 운항 항로를 찾기 위해서는 선박의 정확한 추진성능을 추정하는 것이 매우 중요하다. 본 논문은 선박 최적운항시스템의 추진성능 데이터베이스를 생성하기 위한 전산프로그램의 개발에 대해 기술하고 있다. 실해역에서의 추진성능은 표류와 표면 거칠기 등 선체 상태뿐 만 아니라 파랑과 바람 등 해상 상태의 영향을 받는다. 이 부가저항 추정 방법들은 ISO 15016:2002 표준의 실선 속력시운전 해석법을 근간으로 하고 있으며, 추가로 바람과 선체 표면 거칠기에 대한 몇 가지 추정 방법이 보완되었다. 이 추정 방법들은 종합적인 전산프로그램으로 만들어졌다. 그리고 향후 최적 운항경로 계산에 활용될 쇄빙연구선 아라온 호에 대해서 데이터베이스 계산이 수행되었다. 이 프로그램은 모든 선박의 항로 최적화 계산에 유용하게 사용될 수 있을 것으로 판단된다.

재배선을 이용한 전역 배선기에 관한 연구 (A Study on a New Global Router Using Rerouting)

  • 박은호;신현철
    • 전자공학회논문지A
    • /
    • 제29A권10호
    • /
    • pp.49-56
    • /
    • 1992
  • A new global routing algorithm which dynamically adjusts its cost parameters depending on the given routing poroblem to find a near optimum solution has been developed. The proposed algorithm efficiently performs global routing on general area in which all the pin positions are given. This algorithm is composed of two phases`In the first phase, it routes each net by searching a minimum cost path while ignoring the channel capacity. In the second iterative phase, it rips up nets which pass the channel at which the horizontal or vertical routing density exceeds the capacity and then it reroutes them using a modified set of cost parameters. Applying the above phases, paths for nets are found such that routing density doesn't exceed the capacity in each channel and that nets are routed with minimum cost. Experimental results for several benchmark examples including difficult-4, difficult-8, difficult-16, Primary1 and Primary2 show that our method generates better results than other published ones.

  • PDF

6LoWPAN의 계층적 라우팅 기법에서 이웃 노드 리스트를 이용한 Short-cut 라우팅 알고리즘 (Short-cut Routing Algorithm Using Neighbor Node List in Hierarchical Routing for 6LoWPAN)

  • 강문경;진교홍
    • 한국항행학회논문지
    • /
    • 제11권3호
    • /
    • pp.296-305
    • /
    • 2007
  • 6LoWPAN에서 사용되는 계층적 라우팅 프로토콜인 HiLow는 적은 메모리 사용과 낮은 에너지 소모율을 보이지만 최적의 경로를 제공하지 못하는 단점이 있다. 본 논문에서는 HiLow 라우팅 알고리즘의 성능을 개선하기 위해서 계층적 라우팅 경로정보 뿐만 아니라 소스 노드 주위의 이웃 노드의 정보를 활용하여 데이터가 전달될 최적의 다음 홉(Next hop)을 결정하는 알고리즘을 제안하였다. 제안된 알고리즘은 컴퓨터 시뮬레이션을 통해 성능을 분석하였으며, 그 결과 홉 수, 전송되는 메시지 수 측면에서 많은 개선이 있음을 알 수 있었다.

  • PDF

Bi-Criteria Process Routing Based on COMSOAL Approach

  • Lee Sung-Youl
    • Management Science and Financial Engineering
    • /
    • 제11권2호
    • /
    • pp.45-60
    • /
    • 2005
  • This paper investigates the application of the computer method COMSOAL (Computer Method of Sequencing Operations for Assembly Lines) to the process routing (PR) problem with multiple objectives. In any computer aided process planning (CAPP) system, one of the most critical activities for manufacturing a part could be to generate the sequence that optimizes production time, production cost, machine utilization or with multiple these criteria. The COMSOAL has been adopted to find the optimum sequence of operations that optimizes two major conflicting criteria : production cost and production quality. The COMSOAL is here slightly modified to simultaneously generate and evaluate a set of possible solutions (called as population) instead of processing a solution stepwise in each iteration. The significant features of the COMSOAL include : no parameters settings needed, and a guarantee of feasible solutions. Experimental results show that COMSOAL is a simple but powerful method to quickly generate multiple feasible solutions which are as good as the ones obtained from several other well-known process routing algorithms.