• Title/Summary/Keyword: Origin/Destination

Search Result 246, Processing Time 0.033 seconds

A Study on the Origin/Destination of Trading Cargoes with China for the Pyungtaek Port's Development (평택항 발전을 위한 대중국 수출입화물의 기종점(O/D) 연구)

  • Kim, Sae-Ro-Na;Bang, Hui-Seok
    • Journal of Korea Port Economic Association
    • /
    • v.20 no.2
    • /
    • pp.53-71
    • /
    • 2004
  • The container throughput of China, after the joining in the WTO, has begun to increase notably. As a result, China is busy building new ports continuously. In accordance with China's situation Korea promote the development plans of ports and marketing strategy to attract the increasing cargo traffics with China, including transhipment cargoes. To build the competition strategy and the panning port for trading cargoes with China, an analysis on origin/destination is necessary. The cargo volume from/to the particular port(Korea/China) and origin/destination of traffic are important factors in the requirement for the port development. Therefore, in the era that trading with China is rapidly increasing, this study is performed to analyze the port's usage of transporting the cargos and the origin/destination of trading cargoes with china. Also this paper suggests to the competitive strategies of Pyungtaek Port to attract cargoes particularly from/to China.

  • PDF

Selection of the Optimal Traffic Counting Links using Integer Program Method for Improving the Estimation of Origin Destination Matrix (기종점 OD행렬의 추정력 향상을 위한 교통량 관측구간 선정)

  • Lee, Heon-Ju;Lee, Seung-Jae;Park, Yong-Kil
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.6
    • /
    • pp.57-66
    • /
    • 2004
  • When we estimate an origin-destination matrix from traffic counts. origin-destination matrix estimation from traffic counts according to the selected optimal traffic counting links is method for improving the results of origin-destinaation matrix estimation and for increasing economic efficiency. This paper proposed model of selecting traffic counting links using integer program technique, and selected a traffic counting links using this model, and estimated and origin-destingtion matrix from traffic counts according to the selected optimal traffic counting links. Also, we compared a result of estimating origin-destination matrix from the selected optimal traffic counting links using this model to a result of estimating origin-destination matrix from the randomly selected traffic counting links. The error analysis result was more improved a result of origin-destination matrix estimation using this model than a result of randomly selected links.

Finding the One-to-One Optimum Path Considering User's Route Perception Characteristics of Origin and Destination (Focused on the Origin-Based Formulation and Algorithm) (출발지와 도착지의 경로인지특성을 반영한 One-to-One 최적경로탐색 (출발지기반 수식 및 알고리즘을 중심으로))

  • Shin, Seong-Il;Sohn, Kee-Min;Cho, Chong-Suk;Cho, Tcheol-Woong;Kim, Won-Keun
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.7 s.85
    • /
    • pp.99-110
    • /
    • 2005
  • Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

Analysis of Airline Network using Incheon and Narita Passenger Flight Origin-Destination Data (인천/나리타 공항의 여객기 출.도착 데이터를 이용한 항공노선 분석 연구)

  • Baik, Euiyoung;Cho, Jaehee
    • Journal of Information Technology Applications and Management
    • /
    • v.20 no.1
    • /
    • pp.87-106
    • /
    • 2013
  • This study is to explore the airline network patterns of Incheon and Narita International Airports using passenger flight departure and arrival data of the two airports. The so-called Origin-Destination data is collected from the airports' websites and some of the important data items are flight number, city of origin, destination city, departure/arrival time, number of flights, and delay time. A snowflake schema dimensional model is proposed and implemented. Tableau Public, a well-known visual analytic tool, is used to connect the dimensional model and played an important role in navigating the data space to find interesting and visual patterns among corresponding airports and airlines. For the efficiency of analyzing this spacious data mart, data visualization method was used. Four types of visualization method proposed by Yau was used; visualizing patterns over time, visualizing proportions, visualizing relationships, and visualizing spatial relationships. The strength of connectivity of each flight segments is calculated to evaluate the degree of globalization of Seoul and Tokyo. We anticipate that various patterns and new findings produced by the data mart would provide airline managers, airport authorities, and policy makers in the field of travel and transportation with insightful information.

A Study on the Weighting and Expansion of Sample O-D Freight Data, Focusing on the Seoul Metropolitan Area (대도시권 화물 기종점 통행량 전수화에 관한 연구 - 수도권 지역을 중심으로 -)

  • Kim, Kang-Soo;Cho, Hey-Jin
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.26 no.5D
    • /
    • pp.755-761
    • /
    • 2006
  • Though freight origin and destination data is essential for analysing transport investment and planning logistics facilities, the study on the establishment of the freight origin and destination data is very rare. The purpose of this study is to introduce a method on weight and expansion of sample freight data focusing on the Seoul metropolitan area. In particular, this study suggests the weight and expansion method which consider truck and commodity tonnage together. This paper also discuss the origin and destination trips in Seoul metropolitan area. This paper will contribute to establish more reliable freight origin and destination data.

Prediction of Volumes and Estimation of Real-time Origin-Destination Parameters on Urban Freeways via The Kalman Filtering Approach (칼만필터를 이용한 도시고속도로 교통량예측 및 실시간O-D 추정)

  • 강정규
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.3
    • /
    • pp.7-26
    • /
    • 1996
  • The estimation of real-time Origin-Destination(O-D) parameters, which gives travel demand between combinations of origin and destination points on a urban freeway network, from on-line surveillance traffic data is essential in developing an efficient ATMS strategy. On this need a real-time O-D parameter estimation model is formulated as a parameter adaptive filtering model based on the extended Kalman Filter. A Monte Carlo test have shown that the estimation of time-varying O-D parameter is possible using only traffic counts. Tests with field data produced the interesting finding that off-ramp volume predictions generated using a constant freeway O-D matrix was replaced by real-time estimates generated using the parameter adaptive filter.

  • PDF

Impact of Spatial Accessibility Index, Based on Road Network and Actual Trips, on Housing Price (도로 네트워크와 통행량 기반의 공간 접근성 지수가 주택가격에 미치는 영향)

  • Chae, Jung Pyo;Sung, Hyungun
    • Journal of Korea Planning Association
    • /
    • v.54 no.2
    • /
    • pp.76-83
    • /
    • 2019
  • This study aims to empirically identify the effect of spatial accessibility, based on travel, on housing prices in the Korean capital region. More specifically, it has two research purposes: First, investigating the effect of comprehensive spatial accessibility, based on road network and actual trips from origin to destination, on average apartment price (Korean Won per square meter) at the level of Eup, Myeon and Dong; Second, identifying better accessibility index between Hansen's and Kalogirou and Foley's ones. The former represents a road-based travel time decay function with destination trips, while the latter is a function with origin trips as well as destination ones. The study employs spatial economic models considering spatial auto-correlative relationship as an appropriate methodology with such control independent indicators as population density, road density, educational environment and distances from CBDs. Analysis results demonstrate that spatial accessibility, based on road network and actual trips from origin to destination, has a statistically significant impacts on housing price in the region. Our empirical evidence proves that the Hansen index is more appropriate than the other in estimating housing price impacts.

A Design for Optimal Models of Inventory-Distribution System with Back-Ordered Case (부재고를 갖는 재고.수송시스템의 최적모형설계)

  • 우태희;조남호
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.20 no.43
    • /
    • pp.25-36
    • /
    • 1997
  • The purpose of this paper is to structure a new integrated model that can minimize the total cost for the transportation and inventory systems between m origin points, where origin i has a supply of a commodity, such as distribution centers or warehouses, and n destination points, where destination j requires the commodity. In this case, demands of the destination points are assumed random variables which have a known probability distribution. We will find optimal distribution centers which transport the commodity to the destination points and suggest optimal inventory policy to the selected distribution center which find the optimal pair $$ and safety stock level that minimize total cost with back-ordered case. This new model is formulated as a 0-1 nonlinear integer programming problem. To solve the problem, this paper proposes heuristic computational procedures and program and provides numerical examples.

  • PDF

Railway logistics plan by analyzing origin & destination of possible mad goods by railway (철송가능 육송품목의 기종점 분석을 통한 철도물류 활성화방안)

  • Park, Eun-Kyung
    • Proceedings of the KSR Conference
    • /
    • 2009.05a
    • /
    • pp.1708-1727
    • /
    • 2009
  • Even though we usually analyze logistic market based on confined railway logistics, but this study would like to judge what is potential demand transferable to railway goods through accurate analysis of railway sharing rates by the analysis of origin and destination of each item in total freight transportation market. Accordingly, by analyzing each items transferable to railway, excluding items stuck to original market, this study wants to choose some major items which are expected to lasting demand and activate railway logistics plan by focusing on major items for marketing strategy.

  • PDF

The Maximum Origin-Destination Flow Path Problem in a Directed Network (유방향 네트워크에서 최대물동량경로 문제에 관한 연구)

  • Seong Gi-Seok;Song Seong-Heon
    • Journal of the military operations research society of Korea
    • /
    • v.18 no.2
    • /
    • pp.151-166
    • /
    • 1992
  • In this paper, we define a problem finding a simple path that maximizes the sum of the satisfied Origin-Destination (O-D) flows between nodes covered by that path as a Maximum O-D Flow Path Problem(MODEP). We established a formulation and suggested a method finding MODEP in a directed network. The method utilizes the constraint relaxation technique and the Dual All Integer Algorithm.

  • PDF