• Title, Summary, Keyword: 차량운용계획

Search Result 22, Processing Time 0.03 seconds

Study on Relationship between Turn-back Time and Assignment of Trainsets (철도 차량의 반복시간과 소요량 사이의 관계 고찰)

  • Ki, Hyung-seo;Oh, Suk-mun;Park, Dongjoo
    • Journal of the Korean Society for Railway
    • /
    • v.19 no.6
    • /
    • pp.802-814
    • /
    • 2016
  • This study examines the relationship between the operational turnaround time and the rolling stock requirements. In this study, the operational turnaround time of rolling stock is divided into physical turnback time and waiting time. This paper presents a variety of models and estimation results of the existing studies on operational turnaround time. The proposed estimation model of the operational turnaround time in this study is designed to minimize the operational turnaround time in terminus stations, while the rolling stock requirement is reduced. The developed estimation model was applied in a real-world example, and it was found that the operational turnaround time and the required rolling stocks were lessened compared with the current condition. The method presented in this paper is expected to be utilized in train operational planning and rolling stock routing plans, thereby minimizing the rolling stock requirements of existing railway operating authorities.

A Study on the Mathematical Programming Approach to the Subway Routing Problem (지하철 차량운용 문제에 대한 수리적 해법에 관한 연구)

  • Kim, Kyung-Min;Hong, Soon-Heum
    • Proceedings of the KSR Conference
    • /
    • /
    • pp.1731-1737
    • /
    • 2007
  • This paper considers subway routing problem. Given a schedule of train to be routed by a railway stock, the routing problem determines a sequence of trains while satisfying turnaround time and maintenance restrictions. Generally, the solution of routing problem is generated from set partition formulation solved by column generation method, a typical integer programming approach for train-set. However, we find the characteristics of metropolitan subway which has a simple rail network, a few end stations and 13 departure-arrival patterns. We reflect a turn-around constraint due to spatial limitations has no existence in conventional railroad. Our objective is to minimize the number of daily train-sets. In this paper, we develop two basic techniques that solve the subway routing problem in a reasonable time. In first stage, we formulate the routing problem as a Min-cost-flow problem. Then, in the second stage, we attempt to normalize the distance covered to each routes and reduce the travel distance using our heuristic approach. Applied to the current daily timetable, we could find the subway routings, which is an approximately 14% improvement on the number of train-sets reducing 15% of maximum traveling distance and 8% of the standard deviation.

  • PDF

화제의 인물-Robert Harper

  • Korea Defense Industry Association
    • Defense and Technology
    • /
    • no.10
    • /
    • pp.70-71
    • /
    • 1989
  • 무인차량 합동계획실의 책임자인 Rovert Harper 해병 중령은 "배우는 태도"를 견지하고 있다고 말하였다. 이런 태도는 전장에서 로보트를 운용할 운용자들에게도 적용된다. Harper씨는 그의 가장 큰 임무가 그러한 기술에 대한 사전지식이 거의 없는 보병에게 로보트의 효용을 보여주는 것이라고 밝혔다. 육군과 해병의 합동사업실은 9월 캘리포니아 Camp Pendleton에서 광섬유 케이블에 연결되어 원격조종되는 로보트 차량의 공동 실물설명회를 준비하고 있다. 이 설명회에 이어 육군 및 해병여단의 여러 부대에서 실제 훈련을 통해 로보트 기술소개를 하고, 1995년까지 로보트 차량을 배치할수 있는 방안을 모색하고 있다

  • PDF

User Interface for Unmanned Combat Vehicle Based on Mission Planning and Global Path Planning (임무계획 및 전역경로계획에 기반한 무인전투차량의 운용자 인터페이스 구현)

  • Lee, Ho-Joo;Lee, Young-Il;Park, Yong-Woon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.12 no.6
    • /
    • pp.689-696
    • /
    • 2009
  • In this paper, a new user interface for unmanned combat vehicle(UCV) is developed based on the mission planning and global path planning. In order to complete a tactical mission given to an UCV, it is essential to design an effective interface scheme between human and UCV considering changing combat environment and characteristics of the mission. The user interface is mainly composed of two parts, mission planning and global path planning, since they are important factors to accomplish combat missions. First of all, mission types of UCV are identified. Based on mission types, the concept of mission planning for UCVs is presented. Then a new method for global path planning is devised. It is capable of dealing with multiple grid maps to consider various combat factors so that paths suitable for the mission be generated. By combining these two, a user interface method is suggested. It is partially implemented in the Dog-horse Robot of ADD and its effectiveness is verified.

A study on Decision Model of Disuse Status for the Commercial Vehicles Considering the Military Operating Environment

  • Lee, Jae-Ha;Moon, Ho-Seok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.1
    • /
    • pp.141-149
    • /
    • 2020
  • The proportion of commercial vehicles currently used by the private sector among the vehicles operated by the military is very high at 58% and plans to increase further in the future. As the proportion of commercial vehicles in the military has increased, it is also an important issue to determine whether to disuse of commercial vehicles. At present, the decision of disuse of commercial vehicles is subjectively judged by vehicle technical inspector using design life and vehicle usage information. However, the difference according to the military operation environment is not reflected and objective judgment criteria are not presented. The purpose of this study is to develop a model to determine the disuse status of commercial vehicles in consideration of military operating environment. The data used in the study were 1,746 commercial vehicles of three types: cars, vans and trucks. Using the information of the operating area, climate characteristic, vehicle condition the decision model of disuse status was constructed using the classification machine learning technique. The proposed decision model of disuse status has an average accuracy of about 97% and can be used in the field. Based on the results of the study, the policy suggestions were proposed in the short and long term to improve the performance of decision model of disuse status of commercial vehicles in the future and to establish a new data construction method within the logistics information system.

A study of Multi-commodity Pickup IT Delivery VRSP with Time-window (배달과 수거를 포함한 다품목 수송차량 배차문제에 관한 연구)

  • 조용철;이창호
    • Proceedings of the Safety Management and Science Conference
    • /
    • /
    • pp.91-94
    • /
    • 2000
  • 본 연구에서는 차량용량이 같지 않은 복수의 다른 종류의 차량을 고려하여, 차량이 이동하면서 배달과 수거를 동시에 수행하고 수거지점으로부터 화물을 수거하여 차고지로 운송하는 귀로 화물(Backhauls)을 갖는 PDP(Pickup and Delivery Problem)문제를 그 연구 대상으로 한다. 동시에 차량을 통해 이동되는 품목이 단일 품목이 아니고, 배달 및 수거시간제약조건을 갖는 다품목 시간제약 수송차량 배차문제를 Time-space network를 이용하여 정수선형계획문제로 정식화한다. 이를 최적화 S/W LINGO를 이용하여 위의 모든 제약조건을 만족하면서 운용되는 차량수와 차량의 이동경로를 최소화하는 해를 구하고, 분석한 내용을 보여주고자 한다. 덧붙여 위 문제의 입·출력자료를 데이터베이스화하여 지리정보시스템(Geographic Information System : GIS)과 통합한 차량운행경로결정 지원시스템을 구축하기 위한 방법을 제시하고자 한다.

  • PDF

캐비닛(Cabinet)의 새로운 생산기술 개념

  • Choe, Jong-O
    • Defense and Technology
    • /
    • no.8
    • /
    • pp.44-51
    • /
    • 1988
  • 캐비닛은 전장에서 기동성 있는 작업공간을 제시하며, 군의 이에 대한 이용도는 이동정비, 지휘통신, 물자수송 등의 측면에서 날로 증가하고 있다. 다음 내용은 서독의 캐비닛 개선에 관한 내용을 번역한 것으로, 개념.계획.완성의 순서로 서술하였다. 이런 점에서 캐비닛은 모체차량으로부터 분리, 운용될수 있어야 하며 핵 및 고주파로부터 방호될 수 있어야 한다는 개념이다. 또한 모체차량의 적재능력 한계로 가능한 캐비닛 자체는 가벼운 재질과 특수제작공법으로 적절한 견고성을 유지할수 있도록 발전시키고 있으며, 사용목적에 알맞도록 캐비닛 내부를 설계, 장비시키고 있는바, 이러한 개선개발 추세를 관련업체나 연구 종사자들이 이해함으로써 개발후 이용도 측면에서 그 효과를 크게 기대할수 있어야 할 것이다.

  • PDF

A study on Development of method for Train Schedule Simulation (철도 차량운행계획 시뮬레이션 방법론 개발에 대한 연구)

  • Shin, Dae-Sup;Park, Eun-Kyung;Lee, Jin-Sun;Lee, Seon-Ha
    • Journal of the Korean Society for Railway
    • /
    • v.15 no.1
    • /
    • pp.88-95
    • /
    • 2012
  • Presently, because making process of train service plan consist of various constraint condition, for example structure of track, structure of track in station, train maintenance time and others for considering to be necessary of train management, it has been had extremely complex structure problems. For these reasons, it has big problems to compare analysis for various train service time-table. A study suggest methodology to choice service the most effective schedule and plan of train put before comparative analysis on making train diamond picture's expected effect of established possible various train time-table in making process of train service schedule for improving effectiveness and organization of train service schedule establishment. A study uses Line-Blocking theory for analyzing train service time-table and analyze example for regional train Sadang to Ansan section in 4line.

An Analysis of Traffic Characteristics of the Basic Sections of Urban Expressway -in the case of SHIN-CHUN DaeRo in Tae-gu- (도시고속도로 기본구간의 교통특성분석 -대구신천대로를 대상으로-)

  • 김갑수;신판식
    • Journal of Korean Society of Transportation
    • /
    • v.16 no.4
    • /
    • pp.99-112
    • /
    • 1998
  • 국가경제의 기반시설인 지역간 고속도로와는 달리 도시고속도로는 도시내 교통을 담당하는 교통시설로서 대부분의 도시에서 건설중이거나 운용 중에 있다. 연속류 도로라는 시설측면을 지역간 고속도로와 비슷하나 이용주체, 차량구성비, 정시성, 제한속도 등 그 성격에는 다소 차이가 있을 것으로 판단된다. 이런 이유에서 현재 도시고속도로의 계획이나 운영에 대한 지침이 지역간 고속도로의 계획 및 운영에 대한 지침과 동일시 되고 있다는 점은 불합리한 것으로 판단된다. 그러므로, 본 연구에서는 도시고속도로의 계획과 운영에 대한 지침을 마련하기 위해 현재 운영중인 대구신천대로를 대상으로 교통류특성 등 기초적 연구를 수행하였다. 연구결과를 간략하게 나타내면 다음과 같다. . 교통류 모형분석에서 기존의 Greenshield 모형이 설명력 90%이상을 나타냈다. . 승용차환산계수 분석에서 중형차량이 1.16, 대형차량이 1.47로 분석되었다. . 용량분석에서 최대관측교통량은 4,684pcphpl, 차두시간분석은 2,432pcphpl, 교통류 모형에서는 2,422pcphpl로 분석되어, 대구신천대로의 서비스용량은 2,300pcphpl에 가까운 것으로 판단되며, 차로폭, 측방여유폭에 따른 보정으로 이상적 조건에서의 용량은 약 2,400pcphpl로 분석되었다. 이 결과는 도시고속도로가 지역간 고속도로의 기본교통용량 2,200pcphpl보다 약 200대 정도 높을 것으로 추정된다.

  • PDF

An Enumeration Algorithm for Generating the Candidate Routings in a Set Partitioning Problem Approach to the Rolling Stock Requirement Plan (철도차량소요계획에 대한 집합분할문제 접근에서 후보운용생성을 위한 열거알고리즘)

  • 김성호;김동희;최태성
    • Journal of the Korean Society for Railway
    • /
    • v.7 no.4
    • /
    • pp.326-331
    • /
    • 2004
  • A routing is the path that an actual trainset follows as it moves from one train to another train in a timetable. The number of routings is equivalent to the number of trainsets required to cover the timetable. The primary factors of rolling stock requirement plan include evaluating the minimum number of routings. This can be formulated as a set partitioning problem and solved using enumeration method or column generation method. In this paper we presents an enumeration algorithm which is useful to implement the enumeration method for the rolling stock requirement plan.