• Title/Summary/Keyword: transit network

Search Result 219, Processing Time 0.03 seconds

A Transit Assignment Model using Genetic Algorithm (유전자 알고리즘을 이용한 대중교통 통행배정모형 개발)

  • 이신해;최인준;이승재;임강원
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.1
    • /
    • pp.65-75
    • /
    • 2003
  • In these days, public transportation has become important because of serious traffic congestion. But. there are few researches in public transportation compared with researches in auto. Accordingly, the purpose of paper is development of transit assignment model, which considers features of public transportation, time table, transfer capacity of vehicle, common line, etc. The transit assignment model developed in this paper is composed of two parts. One part is search for optimum path, the other part is network loading. A Genetic algorithm has been developed in order to search for alternative shortest path set. After the shortest paths have been obtained in the genetic algorithm, Logit-base stochastic loading model has been used to obtain the assigned volumes.

A Study on Disaster Evacuation System in Busan Urban Transit using LoRa Wireless Network (LoRa 무선네트워크 기반 부산도시철도 재난대피 시스템 적용에 관한 연구)

  • Lee, Moo-Hyun;Park, Hee-Chul;Kim, Nam-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.417-419
    • /
    • 2016
  • Internet of things(IoT) services should be available to provide unattended operation in a remote area, long battery life, low-cost infrastructure, two-way communication platform. Urban transit in Busan is made up of the wire-based infrastructure except for voice infrastructure of transmit/receive and new data infrastructure is required for Internet of things(IoT) services. Urban transit environments in Busan were analyzed in order to apply LoRa Wireless Network(the standard communication way of IoT) and proposes a building after a Disaster Evacuation System.

  • PDF

A Study on Capacity Calculation of Power Supply System for Light Rail Transit (경량전철 전력공급시스템의 용량 산정에 관한 연구)

  • 백병산;서광덕;김종구
    • Proceedings of the KSR Conference
    • /
    • 2000.11a
    • /
    • pp.696-703
    • /
    • 2000
  • This paper describes the capacity calculation of power supply system for light Rail Transit Three factors are considered for the design i.e. substation arrangements, line configuration and substation power capacity. In this study, we considered all of them for capacity calculation of power supply system for LRT. At first DC-fed-traction system is introduced on an outline, a characteristics of train and fed network, and design method of substation arrangements. Optimal design procedures are described, and program for capacity calculation of the system is presented. In addition, the computer simulated results are computed with the conventional simple calculation method.

  • PDF

Hierarchical Inter-domain Load Balanced QoS Routing (계층적 도메인간 부하분산 QoS 라우팅)

  • Hong, Jong-Joon;Kim, Seung-Hoon;Lee, Kyoon-Ha
    • The KIPS Transactions:PartC
    • /
    • v.9C no.5
    • /
    • pp.671-678
    • /
    • 2002
  • In this paper, we propose hierarchical inter-domain load balanced QoS routing in a large scale of network. And a scheme of calculating resources'costs for precomputation schemes in hierarchical routing is proposed, and a scheme for selecting a path among multiple precomputed paths is proposed. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load then selects paths with the probability of path selection. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. And these schemes make possible both global network resources' utilization and also load balancing.

Design of the Hybrid Tandem Configuration Automated Guided Vehicle Systems (혼합 직렬형태 자동반송시스템의 설계)

  • 장석화
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.22 no.52
    • /
    • pp.117-139
    • /
    • 1999
  • This paper is concerned about the hybrid tandem configuration as the design of the automated guided vehicle system(AGVs). The hybrid tandem configuration is that the manufacturing system is divided into several non-overlapping zones, workstations of each zone are linked by network configuration including loop. That is, the manufacturing system is divided into several non-overlapping small size networks, and at most two automated guided vehicles can be available in each network. The transit point is located at proper point between adjacent networks. The parts are transported to workstations in other network through the transit points. One of the objective functions in dividing into the hybrid tandem configuration is to minimize the maximum travel time of the divided networks, and other is to minimize the total travel distance of parts moved to workstations in other networks for the next processing. The model formulation is presented, and a numerical example is shown. Also, the performances of system for the hybrid tandem, tandem and network configuration are compared through the simulation. The results of this research will contribute to the development of material handling systems in the manufacturing system. Also, it will be applied in determining the transportation area of transportation vehicles and the number and size of the transportation fleet in the transportation problem of logistics management.

  • PDF

Traffic Capacity Estimate of Personal Rapid Transit System based on Digraph Model (소형자동궤도차량 시스템의 그래프 모델 기반 수송능력 추정)

  • Won, Jin-Myung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.3
    • /
    • pp.263-267
    • /
    • 2007
  • This study proposes a new methodology to estimate the traffic capacity of a personal rapid transit(PRT) system. The proposed method comprises three steps. The first step models the guideway network(GN) of PRT as a digraph, where its node and link represent a station and a one-way guideway link between two stations, respectively. Given local vehicle control strategies, the second step formulates the local traffic capacities through the nodes and links of the GN model. The third step estimates the worst-case local traffic demands based on a shortest-path routing algorithm and an empty vehicle allocation algorithm. By comparing the traffic estimates to the local traffic capacities, we can determine the feasibility of the given GN in traffic capacity.

Required Video Analytics and Event Processing Scenario at Large Scale Urban Transit Surveillance System (도시철도 종합감시시스템에서 요구되는 객체인식 기능 및 시나리오)

  • Park, Kwang-Young;Park, Goo-Man
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.3
    • /
    • pp.63-69
    • /
    • 2012
  • In this paper, we introduced design of intelligent surveillance camera system and typical event processing scenario for urban transit. To analyze video, we studied events that frequently occur in surveillance camera system. Event processing scenario is designed for seven representative situations(designated area intrusion, object abandon, object removal in designated area, object tracking, loitering and congestion measurement) in urban transit. Our system is optimized for low hardware complexity, real time processing and scenario dependent solution.

A Preliminary Strategic Study of Resilient Plot Utilization in Rail Transit Stations in the Realm of the City Center, Guided by the Density of Three-Dimensional-Path Public Space

  • Yuan Zhu;Zixin Luo
    • International Journal of High-Rise Buildings
    • /
    • v.13 no.1
    • /
    • pp.57-67
    • /
    • 2024
  • With the requirement of high quality and three-dimensional urban development, the public space areas city-center rail transit stations is expanded from the plots defined by the road network density to the plots defined by the three-dimensional public space density, covering the internal and external paths of the plots, which brings about the resilient pattern of plot utilization. This paper uses the isochronous three-dimensional influence realm model around the station areas to quantitatively analyze and compare the surrounding three-dimensional path density of public space, and initially proposes flexible use patterns of differently scaled plots under the multi-scale plots linkage, to effectively promote the overall accessibility of the station realm space.

On the Optimal Vehicle Routing of City-Wide PRT based on Synchronization (동기화 기반 City-Wide PRT의 최적경로설정 방안 연구)

  • Kim, Dong-Hee;Lee, Tae-Yun
    • Proceedings of the KSR Conference
    • /
    • 2010.06a
    • /
    • pp.1203-1208
    • /
    • 2010
  • Recently, there are environmental issues for sustainable transportation system to pursue the energy-efficient and environment-friendly public urban transit. These transportation system needs to offer demand-oriented high-quality service being on the same level with cab service for urban space. PRT(Personal Rapid Transit), small track-guided vehicle, is repeatedly mentioned as a possible alternative for the new urban public transportion system, but but there are not many researches on the operational optimal routing for PRT network. In this paper, the concept of PRT and general optimal routing methods are reviewed. And we suggest the optimal routing method for city-wide PRT network with multi-vehicles and stations, junctions and directional arcs. Futher research directions for PRT routing are presented.

  • PDF

Development of Time-Expanded Network using Hold-over Arcs (지체호를 사용하는 시간 전개형 네트워크의 개발)

  • Lee, Dal-Sang;Kim, Man-Sik;Lee, Young-Hae
    • IE interfaces
    • /
    • v.4 no.2
    • /
    • pp.25-34
    • /
    • 1991
  • The problem of scheduling the passage things with low transit priority to maximize the amonnt that can be sent during given time periods without interfering with the fixed schedule for passage things with high transit priority in a track, is treated in this paper. The problem is transformed into the Time Expanded Network without traverse time through the Ford and Fulkerson Model and the Enumeration Algorithm is developed for solutions using TENET GENerator(TENETGEN). Finally, the proposed algorithm is compared with Dinic's maximal-flow algorithm and examined for the availability of the procedures on the personal computer.

  • PDF