• Title/Summary/Keyword: 운송행렬

Search Result 11, Processing Time 0.022 seconds

Analysis on the Korean Highway in 2011 and 2017 Using Algorithms of Accessibility indices (접근성 지표의 알고리즘을 이용한 2011년과 2017년의 우리나라 고속도로 분석)

  • Lee, Gwangyeon;Park, Kisoeb
    • Journal of the Korea Society for Simulation
    • /
    • v.27 no.4
    • /
    • pp.9-18
    • /
    • 2018
  • This paper proposes new algorithms of accessibility indices to analyze the connectivity of the Korean highway network. First of all, we find a transportation network that presents Korea's highway network in graphs in 2011 and 2017. And we analyze and compare the nation's highway network in 2011 and 2017 using concepts such as associated number, the relative distance, the accessibility, the degree of connectivity, the index of dispersion, the diameter of graph theory. To do this, an algorithm is presented which can easily obtain various accessibility indices from a given transportation network. Using the simulation results of this study, we can find city that is the center of traffic in the highway transportation network. In addition, cities that are included in the network but are relatively underdeveloped can be found and used as basic data for enhancing the connectivity of the nationwide traffic in the future. Moreover, the proposed algorithms of accessibility indices, which are modeled on highway transport networks, can help identify the accessibility space structure of each city and provide criteria for efficient and reasonable selection of alternatives in various regional planning processes, including transportation.

Industry Linkage Analysis and Link Structure Network Analysis of Water Transportation Industry (수상 운송업의 산업연관분석 및 연계구조 네트워크 분석)

  • Park, Sung-Min;Park, Chan-Kwon
    • Journal of Convergence for Information Technology
    • /
    • v.12 no.3
    • /
    • pp.85-107
    • /
    • 2022
  • This study is to analyze the induced effect, network connectivity, and network visualization of the water transportation industry on the overall economy in relation to all industries. For this, various inducement coefficients of the water transportation industry are analyzed using industry linkage analysis and unit structure matrix, and network visualization analysis is performed using network connectivity and NetDraw using Ucinet 6 that utilizes unit structure matrix and inverse matrix function. As a result of the study, analysis results of input coefficient, production inducement coefficient, value-added inducement coefficient, and inter-industry chain effect were presented as various inducement coefficients in the water transportation industry. content was presented. Through this study, the current position and status of the water transportation industry and its relationship with all industries were confirmed, and the strategic relationship with which industries it should be presented was presented. In the future, it is necessary to further analyze the current status and trends of various induced effects, connectivity (centrality), and network visualization analysis using industry-related analysis published since the 2000s.

The Development of Optimal Path Model for Transport of Hazardous Materials (위험물 소송을 위한 최적경로모형 개발)

  • 조용성;오세창
    • Proceedings of the KOR-KST Conference
    • /
    • 1998.10b
    • /
    • pp.508-508
    • /
    • 1998
  • 위험물 차량사고는 일반차량의 교통사고시 발생하는 인명피해, 재산피해, 교통지체 외에 부가적으로 환경적 영향에 의한 엄청난 인명 및 재산손실을 유발시킬 수 있다. 따라서 이러한 위험물차량사고를 예방하고 피해를 최소로 줄이기 위해서는 위험물수송경로의 신중하고 체계적인 결정이 필수적이라 할 수 있다. 외국의 경우, 위험물의 방출이 미치는 환경적 영향에 대한 인식이 확대되면서 위험물 수송시 응급처리에 관한 연구, 위험물 수송에 따른 위험도 평가에 관한 연구, 위험물 수송시 고려해야할 여러 조건에 관한 연구, 위험물 수송경로 설정에 관한 연구 등이 진행되고 있다. 반면에 우리 나라는 위험물차량관리와 사고처리에 대해 실시간적인 관리를 목표로 하는 국가차원의 계획을 수립하고는 있지만, 현재 이와 관련된 연구는 거의 없는 실정이다. 앞으로 산업발달에 따른 위험물수송량의 증가와 환경의식의 변화에 따라 위험물수송 및 사고처리 등에 관한 연구가 필요할 것이다. 따라서, 본 연구는 위험물차량의 운송경로를 결정할 때 고려해야 할 여러 가지의 기준 및 목표에 따라 위험물수송경로를 설정하는 모형을 제시함으로써 위험물수송에 수반되는 위험을 최소화하면서 위험물차량의 통행시간, 거리, 비용 등을 최적화하여 위험물수송의 안전 및 운영효율성을 향상시키고자 한다. 먼저, 위험물 수송경로의 기준지표로 사용될 위험도를 산정하기 위해 링크 주변노출인구, 밀도 등을 변수로 하는 모형식을 제안하고, 두 번째로 산정된 위험도를 기반으로 최적경로를 결정하는 알고리즘을 제안하였다. 마지막으로 가상 네트웍에 본 연구에서 제안된 모형을 적용하고 현재 일반적으로 사용되는 최단경로와 비교·분석하였다.것은 운송거리와 운송비용이 각각 주요한 변수라는 것이다. 모형의 타당성을 검증하기 위해서는 logilikelihood 값을 구하여 $\rho$^2분석을 시행하였다. 여기서는 각 품목별로 $\rho$^2값이 약 0.15~0.3의 비교적 높은 수치를 보여주고 있으므로 모형의 설명력이 어느 정도 있다는 것이 아울러 증명이 되었다. 상관관계에 대한 분석에서는 영업용 차량간의 상관관계가 높게 나타났으며, 이는 곧 영업용 화물차량을 적재중량별로 구분하는 것이 별 의미가 없음을 의미한다. 다시 말하면 자가용 차량을 보유하고 있지 않은 회사는 다른 운송전문업체에 화물운송을 의뢰하게 되므로 출하중량에 따라 화물차량을 구분하는 것에 대해서 그다지 큰 고려를 하지 않는 것으로 해석할 수가 있다.적합함을 재확인함. 6. 혼잡초기를 제외한 혼잡기간 중 대기행렬길이는 밀도데이터 없이도 혼잡 상류부의 도착교통량과 병목지점 본선통과교통량만을 이용하여 추정이 가능함. 7. 이상에 연구한 결과를 토대로, 고속도로 대기행렬길이를 산정할 수 있는 기초적인 도형을 제시함.벌레를 대상으로 처리한 Phenthoate EC가 96.38%의 방제가로 약효가 가장 우수하였고 3월중순 및 4월중순 월동후 암컷을 대상으로 처리한 Machine oil, Phenthoate EC 및 Trichlorfon WP는 비교적 약효가 낮았다.>$^{\circ}$E/$\leq$30$^{\circ}$NW 단열군이 연구지역 내에서 지하수 유동성이 가장 높은 단열군으로 추정된다. 이러한 사실은 3개 시추공을 대상으로 실시한 시추공 내 물리검층과 정압

  • PDF

The Assignment-Swap Algorithm for Large-scale Transportation Problem with Incomplete Cost Lists (불완전 비용 리스트를 가진 대규모 수송문제의 배정-교환 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.6
    • /
    • pp.51-58
    • /
    • 2015
  • This paper suggests assignment-swap algorithm with time complexity O(mn) to obtain the optimal solution for large-scale of transportation problem (TP) with incomplete cost lists. Generally, the TP with complete cost lists can be solved with TSM (Transportation Simplex Method). But, we can't be solved for large-scale of TP with TSM. Especially. It is hard to solve for large-scale TP with incomplete cost lists using TSM. Therefore, experts simply using commercial linear programming package. Firstly, the proposed algorithm applies assignment strategy of transportation quantity to ascending order of transportation cost. Then, we reassign from surplus of supply to shortage of demand. Secondly, we perform the 2-opt and 1-opt swap optimization to obtain the optimal solution. Upon application to $31{\times}15$ incomplete cost matrix problem, the proposed assignment-swap algorithm more improves the solution than LINGO of commercial linear programming.

The Estimation Model of an Origin-Destination Matrix from Traffic Counts Using a Conjugate Gradient Method (Conjugate Gradient 기법을 이용한 관측교통량 기반 기종점 OD행렬 추정 모형 개발)

  • Lee, Heon-Ju;Lee, Seung-Jae
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.1 s.72
    • /
    • pp.43-62
    • /
    • 2004
  • Conventionally the estimation method of the origin-destination Matrix has been developed by implementing the expansion of sampled data obtained from roadside interview and household travel survey. In the survey process, the bigger the sample size is, the higher the level of limitation, due to taking time for an error test for a cost and a time. Estimating the O-D matrix from observed traffic count data has been applied as methods of over-coming this limitation, and a gradient model is known as one of the most popular techniques. However, in case of the gradient model, although it may be capable of minimizing the error between the observed and estimated traffic volumes, a prior O-D matrix structure cannot maintained exactly. That is to say, unwanted changes may be occurred. For this reason, this study adopts a conjugate gradient algorithm to take into account two factors: estimation of the O-D matrix from the conjugate gradient algorithm while reflecting the prior O-D matrix structure maintained. This development of the O-D matrix estimation model is to minimize the error between observed and estimated traffic volumes. This study validates the model using the simple network, and then applies it to a large scale network. There are several findings through the tests. First, as the consequence of consistency, it is apparent that the upper level of this model plays a key role by the internal relationship with lower level. Secondly, as the respect of estimation precision, the estimation error is lied within the tolerance interval. Furthermore, the structure of the estimated O-D matrix has not changed too much, and even still has conserved some attributes.

기계학습을 이용한 수출 컨테이너의 무게그룹 분류

  • Gang, Jae-Ho;Gang, Byeong-Ho;Ryu, Gwang-Ryeol;Kim, Gap-Hwan
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2005.05a
    • /
    • pp.77-86
    • /
    • 2005
  • 컨테이너 터미널에서는 장치장으로 반입되는 수출 컨테이너의 무게를 몇 단계 그룹으로 나누고 각 무게그룹 별로 모아서 장치한다. 이는 수출 컨테이너를 선박에 싣는 적하 작업 시 선박의 안정성을 위하여 무거운 무게그룹의 컨테이너들을 장치장에서 먼저 반출하여 선박의 바닥 쪽에 놓기 위함이다. 하지만 반입되는 컨테이너의 무게그룹을 결정할 때 사용하는 운송사로부터 받은 무게정보는 부정확한 경우가 많아 하나의 스택(stack)에 서로 다른 무게그룹에 속하는 컨테이너들이 섞이게 된다. 이로 인하여 무거운 무게그룹의 컨테이너를 반출할 때 해당 컨테이너의 상단에 놓여진 보다 가벼운 무게그룹의 컨테이너들을 임시로 옮겨야 하는 재취급(rehandling, reshuffling)이 발생하게 된다. 적하작업 시 장치장에서 재취급이 빈번히 발생하면 작업이 지연되므로 터미널 생산성 향상을 위해서는 재취급 발생을 가급적 줄여야 한다. 본 논문에서는 기계학습 기법을 적용하여 반입 컨테이너의 무게그룹을 보다 정확히 추정하는 방안을 제안한다. 또한 탐색을 통하여 분류기 생성에 관여하는 비용행렬(cost matrix)을 조정함으로써 재취급 발생을 줄일 수 있는 분류기(classifier)를 생성하는 방안을 함께 소개한다. 실험 결과 본 논문에서 제안하는 방안 적용 시 재취급 발생을 $5{\sim}7%$ 정도 줄일 수 있음을 예상할 수 있었다.

  • PDF

Numerical Analysis for Nonlinear Static and Dynamic Responses of Floating Crane with Elastic Boom (붐(Boom)의 탄성을 고려한 해상크레인의 비선형 정적/동적 거동을 위한 수치 해석)

  • Cha, Ju-Hwan;Park, Kwang-Phil;Lee, Kyu-Yeul
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.34 no.4
    • /
    • pp.501-509
    • /
    • 2010
  • A floating crane is a crane-mounted ship and is used to assemble or to transport heavy blocks in shipyards. In this paper, the static and dynamic response of a floating crane and a heavy block that are connected using elastic booms and wire ropes are described. The static and dynamic equations of surge, pitch, and heave for the system are derived on the basis of flexible multibody system dynamics. The equations of motion are fully coupled and highly nonlinear since they involve nonlinear mass matrices, elastic stiffness matrices, quadratic velocity vectors, and generalized external forces. A floating frame of reference and nodal coordinates are employed to model the boom as a flexible body. The nonlinear hydrostatic force, linear hydrodynamic force, wire-rope force, and mooring force are considered as the external forces. For numerical analysis, the Hilber-Hughes-Taylor method for implicit integration is used. The dynamic responses of the cargo are analyzed with respect to the results obtained by static and numerical analyses.

Numerical Analysis of a Two-Dimensional N-P-N Bipolar Transistor-BIPOLE (2차원 N-P-N 바이폴라 트랜지스터의 수치해석-BIPOLE)

  • 이종화
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.21 no.2
    • /
    • pp.71-82
    • /
    • 1984
  • A programme, called BIPOLE, for the numerical analysis of twotimensional n-p-n bipolar transistors was developed. It has included the SRH and Auger recolnbination processes, the mobility dependence on the impurity density and the electric field, and the band-gap narrowing effect. The finite difference equations of the fundamental semiconductor equations are formulated using Newton's method for Poisson's equation and the divergence theorem for the hole and electron continuity equations without physical restrictions. The matrix of the linearized equations is sparse, symmetric M-matrix. For the solution of the linearized equations ICCG method and Gummel's algorithm have been employed. The programme BIPOLE has been applied to various kinds of the steady-state problems of n-p-n transistors. For the examples of applications the variations of common emitter current gain, emitter and diffusion capacitances, and input and output characteristics are calculated. Three-dimensional representations of some D.C. physical quantities such as potential and charge carrier distributions were displayed. This programme will be used for the nome,rical analysis of the distortion phenom ana of two-dimensional n-p-n transistors. The BIPOLE programme is available for everyone.

  • PDF

A spatial panel regression model for household final consumption expenditure based on KTX effects (공간패널모형을 이용한 KTX 개통이 지역소비에 미친 영향 분석)

  • Na, Young;Kim, Yongku
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.5
    • /
    • pp.1147-1154
    • /
    • 2016
  • Impact of Korea train express (KTX) on the regional economy in Korea has been studied by many researchers. Current research is limited in the lack of quantitative research using a statistical model to study the effect of KTX on regional economy. This paper analyses the influence of KTX to the household final consumption expenditure, which is one of important regional economic index, using spatial panel regression model. The spatial structure is introduced through spatial autocorrelation matrix using adjacency of KTX connection. The result shows a significant effect of Korea train express on the regional economy.

Learning a Classifier for Weight Grouping of Export Containers (기계학습을 이용한 수출 컨테이너의 무게그룹 분류)

  • Kang, Jae-Ho;Kang, Byoung-Ho;Ryu, Kwang-Ryel;Kim, Kap-Hwan
    • Journal of Intelligence and Information Systems
    • /
    • v.11 no.2
    • /
    • pp.59-79
    • /
    • 2005
  • Export containers in a container terminal are usually classified into a few weight groups and those belonging to the same group are placed together on a same stack. The reason for this stacking by weight groups is that it becomes easy to have the heavier containers be loaded onto a ship before the lighter ones, which is important for the balancing of the ship. However, since the weight information available at the time of container arrival is only an estimate, those belonging to different weight groups are often stored together on a same stack. This becomes the cause of extra moves, or rehandlings, of containers at the time of loading to fetch out the heavier containers placed under the lighter ones. In this paper, we use machine learning techniques to derive a classifier that can classify the containers into the weight groups with improved accuracy. We also show that a more useful classifier can be derived by applying a cost-sensitive learning technique, for which we introduce a scheme of searching for a good cost matrix. Simulation experiments have shown that our proposed method can reduce about 5$\sim$7% of rehandlings when compared to the traditional weight grouping method.

  • PDF