• Title/Summary/Keyword: Congestion Management Model

Search Result 123, Processing Time 0.022 seconds

Multivariate Congestion Prediction using Stacked LSTM Autoencoder based Bidirectional LSTM Model

  • Vijayalakshmi, B;Thanga, Ramya S;Ramar, K
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.1
    • /
    • pp.216-238
    • /
    • 2023
  • In intelligent transportation systems, traffic management is an important task. The accurate forecasting of traffic characteristics like flow, congestion, and density is still active research because of the non-linear nature and uncertainty of the spatiotemporal data. Inclement weather, such as rain and snow, and other special events such as holidays, accidents, and road closures have a significant impact on driving and the average speed of vehicles on the road, which lowers traffic capacity and causes congestion in a widespread manner. This work designs a model for multivariate short-term traffic congestion prediction using SLSTM_AE-BiLSTM. The proposed design consists of a Bidirectional Long Short Term Memory(BiLSTM) network to predict traffic flow value and a Convolutional Neural network (CNN) model for detecting the congestion status. This model uses spatial static temporal dynamic data. The stacked Long Short Term Memory Autoencoder (SLSTM AE) is used to encode the weather features into a reduced and more informative feature space. BiLSTM model is used to capture the features from the past and present traffic data simultaneously and also to identify the long-term dependencies. It uses the traffic data and encoded weather data to perform the traffic flow prediction. The CNN model is used to predict the recurring congestion status based on the predicted traffic flow value at a particular urban traffic network. In this work, a publicly available Caltrans PEMS dataset with traffic parameters is used. The proposed model generates the congestion prediction with an accuracy rate of 92.74% which is slightly better when compared with other deep learning models for congestion prediction.

Simulation System for Earthmoving Operation with Traffic Flow

  • Kyoungmin Kim;Kyong Ju Kim;Hyeon Jeong Cho;Sang Kyu Lee
    • International conference on construction engineering and project management
    • /
    • 2009.05a
    • /
    • pp.1359-1363
    • /
    • 2009
  • The object of this research is to develop a simulation system for earthmoving operations in consideration of the impact of congestion in-between equipment and existing traffic flow around the site. The congestion in-between equipment and traffic flow affect work productivity. The conventional discrete event simulation, however, has limitations in simulating the flow of construction equipment. To consider the impact of congestion in-between equipment and existing traffic flow, in this paper, a multi-agent based simulation model that can realize characteristics of truck behavior more accurately to consider the impact of congestion was proposed. In this simulation model, multiple agents can identify environmental changes and adapt themselves to the new environment. This modeling approach is a better choice for this problem since it describes behavioral characteristics of each agent by sensing changes in dynamic surroundings. This study suggests a detailed system design of the multi-agent based simulation system.

  • PDF

An Efficient and Stable Congestion Control Scheme with Neighbor Feedback for Cluster Wireless Sensor Networks

  • Hu, Xi;Guo, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4342-4366
    • /
    • 2016
  • Congestion control in Cluster Wireless Sensor Networks (CWSNs) has drawn widespread attention and research interests. The increasing number of nodes and scale of networks cause more complex congestion control and management. Active Queue Management (AQM) is one of the major congestion control approaches in CWSNs, and Random Early Detection (RED) algorithm is commonly used to achieve high utilization in AQM. However, traditional RED algorithm depends exclusively on source-side control, which is insufficient to maintain efficiency and state stability. Specifically, when congestion occurs, deficiency of feedback will hinder the instability of the system. In this paper, we adopt the Additive-Increase Multiplicative-Decrease (AIMD) adjustment scheme and propose an improved RED algorithm by using neighbor feedback and scheduling scheme. The congestion control model is presented, which is a linear system with a non-linear feedback, and modeled by Lur'e type system. In the context of delayed Lur'e dynamical network, we adopt the concept of cluster synchronization and show that the congestion controlled system is able to achieve cluster synchronization. Sufficient conditions are derived by applying Lyapunov-Krasovskii functionals. Numerical examples are investigated to validate the effectiveness of the congestion control algorithm and the stability of the network.

Development of Traffic Congestion Prediction Module Using Vehicle Detection System for Intelligent Transportation System (ITS를 위한 차량검지시스템을 기반으로 한 교통 정체 예측 모듈 개발)

  • Sin, Won-Sik;Oh, Se-Do;Kim, Young-Jin
    • IE interfaces
    • /
    • v.23 no.4
    • /
    • pp.349-356
    • /
    • 2010
  • The role of Intelligent Transportation System (ITS) is to efficiently manipulate the traffic flow and reduce the cost in logistics by using the state of the art technologies which combine telecommunication, sensor, and control technology. Especially, the hardware part of ITS is rapidly adapting to the up-to-date techniques in GPS and telematics to provide essential raw data to the controllers. However, the software part of ITS needs more sophisticated techniques to take care of vast amount of on-line data to be analyzed by the controller for their decision makings. In this paper, the authors develop a traffic congestion prediction model based on several different parameters from the sensory data captured in the Vehicle Detection System (VDS). This model uses the neural network technology in analyzing the traffic flow and predicting the traffic congestion in the designated area. This model also validates the results by analyzing the errors between actual traffic data and prediction program.

Building a TDM Impact Analysis System for the Introduction of Short-term Congestion Management Program in Seoul (교통수요관리 방안의 단기적 효과 분석모형의 구축)

  • 황기연;김익기;엄진기
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.1
    • /
    • pp.173-185
    • /
    • 1999
  • The purpose of this study is to develope a forecasting model to implement short-term Congestion Management Program (CMP) based on TDM strategies in Seoul. The CMP is composed of three elements: 1) setting a goal of short-term traffic management. 2) developing a model to forecast the impacts of TDM alternatives, and 3) finding TDM measures to achieve the goal To Predict the impacts of TDM alternatives, a model called SECOMM (SEoul COngestion Management Model) is developed. The model assumes that trip generation and distribution are not changing in a short term, and that only mode split and traffic assignment are affected by TDM. The model includes the parameter values calibrated by a discrete mode choice model, and roadway and transit networks with 1,020 zones. As a TDM measure implement, it affects mode choice behavior first and then the speeds of roadway network. The chanced speed again affects the mode choice behavior and the roadway speeds. These steps continue until the network is equilibrated. The study recommends that CMP be introduced in Seoul, and that road way conditions be monitored regularly to secure the prediction accuracy of SECOMM. Also, TDM should be the major Policy tools in removing short-term congestion problems in a big city.

  • PDF

A Digital Twin Simulation Model for Reducing Congestion of Urban Railways in Busan (부산광역시 도시철도 혼잡도 완화를 위한 디지털 트윈 시뮬레이션 모델 개발)

  • Choi, Seon Han;Choi, Piljoo;Chang, Won-Du;Lee, Jihwan
    • Journal of Korea Multimedia Society
    • /
    • v.23 no.10
    • /
    • pp.1270-1285
    • /
    • 2020
  • As a representative concept of the fourth industrial revolution era where everything is digitized, digital twin means analyzing and optimizing a complex system using a simulation model synchronized with the system. In this paper, we propose a digital twin simulation model for the efficient operation of urban railways in Busan. Due to the geopolitical nature of Busan, where there are many mountains and narrow roads, the railways are more useful than other public transportation. However, this inversely results in a high level of congestion, which is an inconvenience to citizens and may be fatal to the spread of the virus, such as COVID19. Considering these characteristics, the proposed model analyzes the congestion level of the railways in Busan. The model is developed based on a mathematical formalism called discrete-event system specification and deduces the congestion level and the average waiting time of passengers depending on the train schedule. In addition, a new schedule to reduce the congestion level is derived through particle swarm optimization, which helps the efficient operation of the railways. Although the model is developed for the railways in Busan, it can also be used for railways in other cities where a high level of congestion is a problem.

Mathematical Modeling for Traffic Flow (교통흐름의 수학적 모형)

  • Lee, Seong-Cheol
    • Journal of the Korea Safety Management & Science
    • /
    • v.13 no.1
    • /
    • pp.127-131
    • /
    • 2011
  • Even if there are no causing factors such as car crash and road works, traffic congestion come from traffic growth on the road. In this case, estimation of traffic flow helps find the solution of traffic congestion problem. In this paper, we present a optimization model which used on traffic equilibrium problem and studied the problem of inverting shortest path sets for complex traffic system. And we also develop pivotal decomposition algorithm for reliability function of complex traffic system. Several examples are illustrated.

A Traffic Assignment Model in Multiclass Transportation Networks (교통망에서 다차종 통행을 고려하는 통행배정모형 수립)

  • Park, Koo-Hyun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.32 no.3
    • /
    • pp.63-80
    • /
    • 2007
  • This study is a generalization of 'stable dynamics' recently suggested by Nesterov and de Palma[29]. Stable dynamics is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with user equilibrium model that is common in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on the congestion. Therefore it is expected to be an useful analysis tool for transportation planners. An equilibrium in stable dynamics needs only maximum flow in each arc and Wardrop[33] Principle. In this study, we generalize the stable dynamics into the model with multiple traffic classes. We classify the traffic into the types of vehicle such as cars, buses and trucks. Driving behaviors classified by age, sex and income-level can also be classes. We develop an equilibrium with multiple traffic classes. We can find the equilibrium by solving the well-known network problem, multicommodity minimum cost network flow problem.

Parcel Locker Locations and Dynamic Vehicle Routing Problem with Traffic Congestion (교통 체증을 고려한 물품 보관함 위치 및 동적 차량 경로 문제)

  • Chaehyun Kim;Gitae Kim
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.47 no.2
    • /
    • pp.168-175
    • /
    • 2024
  • Due to the complexity of urban area, the city vehicle routing problem has been a difficult problem. The problem has involved factors such as parking availability, road conditions, and traffic congestion, all of which increase transportation costs and delivery times. To resolve this problem, one effective solution can be the use of parcel lockers located near customer sites, where products are stored for customers to pick up. When a vehicle delivers products to a designated parcel locker, customers in the vicinity must pick up their products from that locker. Recently, identifying optimal locations for these parcel lockers has become an important research issue. This paper addresses the parcel locker location problem within the context of urban traffic congestion. By considering dynamic environmental factors, we propose a Markov decision process model to tackle the city vehicle routing problem. To ensure more real situations, we have used optimal paths for distances between two nodes. Numerical results demonstrate the viability of our model and solution strategy.

First- and Second-best Pricing in Stable Dynamic Models (안정동력학 모형에서 최선 통행료 및 차선 통행료)

  • Park, Koo-Hyun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.34 no.4
    • /
    • pp.123-138
    • /
    • 2009
  • This study examined the first- and second-best pricing by stable dynamics in congested transportation networks. Stable dynamics, suggested by Nesterov and de Palma (2003), is a new model which describes and provides a stable state of congestion in urban transportation networks. The first-best pricing in user equilibrium models introduces user-equilibrium in the system-equilibrium by tolling the difference between the marginal social cost and the marginal private cost on each link. Nevertheless, the second-best pricing, which levies the toll on some, but not all, links, is relevant from the practical point of view. In comparison with the user equilibrium model, the stable dynamic model provides a solution equivalent to system-equilibrium if it is focused on link flows. Therefore the toll interval on each link, which keeps up the system-equilibrium, is more meaningful than the first-best pricing. In addition, the second-best pricing in stable dynamic models is the same as the first-best pricing since the toll interval is separately given by each link. As an effect of congestion pricing in stable dynamic models, we can remove the inefficiency of the network with inefficient Braess links by levying a toll on the Braess link. We present a numerical example applied to the network with 6 nodes and 9 links, including 2 Braess links.