• Journal of Korean Society of Transportation
• /
• v.34 no.6
• /
• pp.570-579
• /
• 2016

This study proposes a concept of Stepwise Transfer Coefficient(STC) which implies greater transfer cost with increasing the number of transfers. Thus, the public transport information system provides the choice sets of travel routes by the consideration of not only transportation time but also the optimum number of transfers. However, path choice problems that involve STC are found to include non additive cost, which requires additional route enumeration works. Discussions on route enumeration in actual transportation networks is very complicated, thereby warranting a theoretical examination of route search considering STC. From these points of view, this study results in a probability based transit trip assignment model including STC. This research also uses incoming link based entire route deletion method. The entire route deletion method proposed herein simplifies construction of an aggregation of possible routes by theoretically supporting the process of enumeration of the different routes from origin to destination. Conclusively, the STC reflected route based logit model is proposed as a public transportation transit trip assignment model.

• Proceedings of the KOR-KST Conference
• /
• 1995.12a
• /
• pp.111-124
• /
• 1995

첨단 교통 체계(Intelligent Transport Systems)의 중요한 요소인 첨단 교통 관리 체계(Advanced Traffic Management Systems)의 성공 여부는 교통정보를 어떻게 제공하고 통제하는데 의존하다. 즉, 정보 제공 방식과 이데 대한 운전자의 반응을 정확하게 파악하고 예측하여야 ITS를 성공적으로 구축할 수 있다. 이 논문에서는 동적 차량 길잡이 장치의 효용성을 평가하기 위한 확률적 통행배정모형을 개발하는 것이다. 개발된 통행배정모형은 운전자의 동적행태조정(Dynamic Behavioural Adjustment)을 명백하게 확솔 과정(Stochastic Process)으로 표현하여 기존의 모형에 비해 통해자들의 행태를 더욱 실제적으로 반영한다. 특히, 각 통행자들에게 K개의 최소경로시간을 제공해줌으로 인하여 통행자의 노선선택에 대한 선택폭을 증가시켜준다. 통행경로의 선택폭의 증가는 쟁점으로 대두되는 문제(교통항제소에서는 차량 길잡이 보유 운전자에게 체계최적(System Optimum)와 이용자최적(User Equilibrium)중 어떠한 원칙하에 교통정보를 제공하여야 하는가에 대한 해결 방안이다. 왜냐하면 만약 교통급제소에서 운전자에게 통행정보를 체계 최상을 하기 위해 정보를 제공하고자 하면, 길잡이 장착 운전자는 더 이상 제공된 정보를 따르지 않고 자기 스스로의 경에 의해 이용자 최상을 달성하고자 할 것이다. 이 논문의 목적은 이러한 복잡한 통행자의 경로선택행위를 반영하는 확률적 평형 통행 배정 모형을 여러가지 통계기법을 도입하여 개발하는 것이다.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.1
• /
• pp.111-118
• /
• 2015

This paper deals with the routing and wavelength assignment problem (RWAP) that decides the best lightpaths for multiple packet demands for (s,t) in optical communication and assigns the minimum number of wavelengths to given lightpaths. There has been unknown of polynomial-time algorithm to obtain the optimal solution for RWAP. Hence, the RWAP is classified as NP-complete problem and one can obtain the approximate solution in polynomial-time. This paper decides the shortest main and alternate lightpath with same hop count for all (s,t) for given network in advance. When the actual demands of communication for particular multiple packet for (s,t), we decrease the maximum utilized edge into b utilized number using these dual-paths. Then, we put these (s,t) into b-wavelength bins without duplicated edge. This algorithm can be get the optimal solution within O(kn) computational complexity. For two experimental data, the proposed algorithm shows that can be obtain the known optimal solution.

• Journal of Korean Society of Transportation
• /
• v.26 no.2
• /
• pp.89-100
• /
• 2008

In an urban network controlled by traffic signals, there is an interaction between the signal timing and the routes chosen by individual road users. This study develops a bi level programming model for traffic signal optimization in networks with path based traffic assignment. In the bi level programming model, genetic algorithm approach has been proposed to solve upper level problem for a signalized road network. Path based traffic assignment using column generation technique which is proposed by M.H. Xu, is applied at the lower-level. Genetic Algorithm provieds a feasible set of signal timings within specified lower and upper bounds signal timing variables and feeds into lower level problem. The performance of this model is investigated in numerical experiment in a sample network. In result, optimal signal settings and user equilibrium flows are made.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.1033-1043
• /
• 1998

In this paper, we present an improved multicasting path assignment algorithm based on the minimum cost spanning tree. In the method presented in this paper, a multicasting path is assigned preferentially when a node to be received is found among the next degree nodes of the searching node in the multicasting path assignment of the constrained steiner tree (CST). If nodes of the legacy group exist between nodes of the new group, a new path among the nodes of new group is assigned as long as the nodes may be excluded from the new multicasting path assignment taking into consideration characteristics of nodes in the legacy group. In assigning the multicasting path additionally, where the source and destination nodes which can be set for the new multicasting path exist in the domain of identical network (local area network) and conditions for degree constraint are satisfied, a method of producing and assigning a new multicasting path is used. The results of comparison of CST with MCSTOP, MCSTOp algorithm enhanced performance capabilities about the communication cost, the propagation delay, and the computation time for the multicasting assignment paths more than CST algorithm. Further to this, research activities need study for the application of the international standard protocol(multicasting path assignment technology in the multipoint communication service (MCS) of the ITU-T T.120).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.526-529
• /
• 2007

무선센서네트워크 환경에서 활용될 수 잇는 대표적인 계층적 라우팅 프로토콜로는 Zigbee(지그비) 계층구조 라우팅과 IETF의 6LoWPAN WG에 드래프트로 제출되었던 HiLow 프로토콜 등이 있다. 이들 계층구조 라우팅 프로토콜은 깊이 우선(Depth-first) 방식과 폭 우선(Width-first) 방식을 각각 사용하여 자동 주소 할당을 수행한 후 이를 이용해 계층적 경로 배정이 되도록 한다. 이에 따라 망상의 노드들이 물리적으로 가까운 위치에 존재하더라도 경로는 계층적으로 제공되어 데이터 전달에 많은 흡 수가 소요된다. 본 논문에서는 이러한 경로 배정 시 발생되는 비효율성을 개선하고 싱크(Sink) 주위 노드의 에너지 소모율을 줄일 수 있는 경로 배정 알고리즘을 제안한다.

• Journal of Korean Society of Transportation
• /
• v.17 no.5
• /
• pp.69-78
• /
• 1999

This paper defines the reliable based route choice Principle and formulates the reliability based equilibrium traffic assignment using the Principle. The reliability is defined as the difference of travel demand and capacity using the interference theory of the system engineering. An efficient solution a1gorithm based on Frank-Wo1fe algolithm is Presented to calculate and compare the reliability based traffic assignment with conventional travel time based assignment using small and large scaled road networks. The results show that reliability based traffic assignment converges to equilibrium solution in a reasonable computing time. The equilibrium link flows between reliability and travel time based traffic assignment differ each other in the sense that reliability based assignment is assigned based on the maximum difference of travel demand and link capacity whilst travel time based is assigned on the shortest travel time.

• Journal of IKEEE
• /
• v.7 no.1 s.12
• /
• pp.80-87
• /
• 2003

This paper proposes a routing scheme for multi-hop LEO satellite networks with inter-satellite links aiming for reducing the number of link handovers while keeping the efficient use of network resource. The proposed routing scheme controls the link handovers by taking account of the deterministic LEO satellite system dynamics, geographical location of a ground terminal and statistic information of call duration. The performance of the proposed routing scheme has been evaluated and compared with previous routing schemes in terms of average number of link handovers during a call, the call blocking and dropping probability, and the network utilization.

• Proceedings of the KOR-KST Conference
• /
• 1998.10a
• /
• pp.31-40
• /
• 1998

본 연구의 목적은 기존의 Cell Transmission(1994, Daganzo) 교통류 이론을 기반으로 동적통행배정 모형을 개발하는 것이다. 이 모형은 동적 O-D 발생모듈, HOV 차선모듈, 분류부 분할모델, 링크비용함수 모듈, 최단경로 탐색 모듈등으로 구성된다. 이 모델에서 적용하는 교통류 모델은 각 링크를 동일한 특성을 가지는 셀로 구분하여 셀내의 진입시간과 진출시간을 계산하여 링크비용을 계산하는데 이것은 비용의 과대·과소 추정을 피할 수 있으며 교통지체 현상을 현실적으로 표현해 줄 수 있는 장점이 있다. 또한 HOV 차선 모듈에 의해 수단별 교통류 진행 및 비용고려가 가능하며 HOV 차선의 평가 및 분석이 가능하다. 기존의 동적통행배정모형은 매 시간대별 출발지에서 균형상태를 추구하는 통행배정기법을 사용하고 있지만 이 모델은 분류되는 노드를 가상의 출발점이라고 가정하여 각 시간대별로 최단경로를 탐색하여 균형상태를 추구해나가는 기법을 적용하고 있다. 각 셀별 차량을 목적지별, 차종별, 대기시간별로 추적하여 진행시키며 분류부에서는 최단경로를 탐색하여 배분된다. 또한 진행하고자 하는 셀의 용량과 현재 셀의 밀도를 고려함으로서 용량제약 하에서의 동적통행배정모형을 적용하고 있다. 이 모형은 고속로의 합류부 및 분류부의 교통특성을 세밀히 분석할 수 있으며, TCS 및 램프미터링과 접목하여 고속도로 운영에 이용될 수 있으며, 고속도로 중·장기적인 계획에 이용될 수 있다.

• Journal of Advanced Marine Engineering and Technology
• /
• v.36 no.2
• /
• pp.302-308
• /
• 2012

Self-configuration network model is to overcome the limits of data communications at sea. As a research for enhancing the connectivity and scalability of data networks at sea using the diversity and heterogeneity of the data networks on land, in this paper, a routing scheme (NLTCR) based on not conventional hop counts but distances to destination ships is introduced. The NLTCR seeks an optimal route by normalized distances to a destination, and transmission characteristics of applications and carriers. Performance is evaluated and compared with those of the max-win (MWR) and the normalized transmission characteristics (NTCR) based schemes.