首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
This paper addresses the optimal toll design problem for the cordon-based congestion pricing scheme, where both a time-toll and a nonlinear distance-toll (i.e., joint distance and time toll) are levied for each network user’s trip in a pricing cordon. The users’ route choice behaviour is assumed to follow the Logit-based stochastic user equilibrium (SUE). We first propose a link-based convex programming model for the Logit-based SUE problem with a joint distance and time toll pattern. A mathematical program with equilibrium constraints (MPEC) is developed to formulate the optimal joint distance and time toll design problem. The developed MPEC model is equivalently transformed into a semi-infinite programming (SIP) model. A global optimization method named Incremental Constraint Method (ICM) is designed for solving the SIP model. Finally, two numerical examples are used to assess the proposed methodology.  相似文献   

2.
In this paper, we address the discrete network design problem, which determines the addition of new roads to existing transportation network to optimize the transportation system performance. Road users are assumed to follow the traffic assignment principle of stochastic user equilibrium. A mixed‐integer nonlinear nonconvex problem is developed to model this discrete network design problem with stochastic user equilibrium. The original problem is relaxed into a convex mixed‐integer nonlinear program, whose solution provides a lower bound of the original problem. The relaxed problem is then embedded into two proposed global optimization solution algorithms to obtain the global optimal solution of the problem. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献   

3.
This paper presents a reliability‐based network design problem. A network reliability concept is embedded into the continuous network design problem in which travelers' route choice behavior follows the stochastic user equilibrium assumption. A new capacity‐reliability index is introduced to measure the probability that all of the network links are operated below their capacities when serving different traffic patterns deviating from the average condition. The reliability‐based network design problem is formulated as a bi‐level program in which the lower level sub‐program is the probit‐based stochastic user equilibrium problem and the upper level sub‐program is the maximization of the new capacity reliability index. The lower level sub‐program is solved by a variant of the method of successive averages using the exponential average to represent the learning process of network users on a daily basis that results in the daily variation of traffic‐flow pattern, and Monte Carlo stochastic loading. The upper level sub‐program is tackled by means of genetic algorithms. A numerical example is used to demonstrate the concept of the proposed framework.  相似文献   

4.
Sharma  Bibhuti  Hickman  Mark  Nassir  Neema 《Transportation》2019,46(1):217-232

This research aims to understand the park-and-ride (PNR) lot choice behaviour of users i.e., why PNR user choose one PNR lot versus another. Multinomial logit models are developed, the first based on the random utility maximization (RUM) concept where users are assumed to choose alternatives that have maximum utility, and the second based on the random regret minimization (RRM) concept where users are assumed to make decisions such that they minimize the regret in comparison to other foregone alternatives. A PNR trip is completed in two networks, the auto network and the transit network. The travel time of users for both the auto network and the transit network are used to create variables in the model. For the auto network, travel time is obtained using information from the strategic transport network using EMME/4 software, whereas travel time for the transit network is calculated using Google’s general transit feed specification data using a backward time-dependent shortest path algorithm. The involvement of two different networks in a PNR trip causes a trade-off relation within the PNR lot choice mechanism, and it is anticipated that an RRM model that captures this compromise effect may outperform typical RUM models. We use two forms of RRM models; the classical RRM and µRRM. Our results not only confirm a decade-old understanding that the RRM model may be an alternative concept to model transport choices, but also strengthen this understanding by exploring differences between two models in terms of model fit and out-of-sample predictive abilities. Further, our work is one of the few that estimates an RRM model on revealed preference data.

  相似文献   

5.
Understanding travellers’ behaviour is key element in transportation planning. This article presents a route choice model for metro networks that considers different time components as well as variables related to the transferring experience, train crowding, network topology and socio-demographic characteristics. The route choice model is applied to the London Underground and Santiago Metro networks, to make a comparison of the decision making process of the users on both cities. As all the variables are statistically significant, it is possible to affirm that public transport users take into account a wide variety of elements when choosing routes. While in London the travellers prefer to spend time walking, in Santiago is preferable to spend time waiting. Santiago Metro users are more willing to travel in crowded trains than London Underground users. Both user groups have a similar dispreference to transfers after controlling for the time spent on transfer, but different attitudes to ascending and descending transfers. Topological factors presented on a distorted Metro map are more important than actual topology to passengers’ route choice decisions.  相似文献   

6.
In this paper, we consider the continuous road network design problem with stochastic user equilibrium constraint that aims to optimize the network performance via road capacity expansion. The network flow pattern is subject to stochastic user equilibrium, specifically, the logit route choice model. The resulting formulation, a nonlinear nonconvex programming problem, is firstly transformed into a nonlinear program with only logarithmic functions as nonlinear terms, for which a tight linear programming relaxation is derived by using an outer-approximation technique. The linear programming relaxation is then embedded within a global optimization solution algorithm based on range reduction technique, and the proposed approach is proved to converge to a global optimum.  相似文献   

7.
In this paper, we investigate an area-based pricing scheme for congested multimodal urban networks with the consideration of user heterogeneity. We propose a time-dependent pricing scheme where the tolls are iteratively adjusted through a Proportional–Integral type feedback controller, based on the level of vehicular traffic congestion and traveler’s behavioral adaptation to the cost of pricing. The level of congestion is described at the network level by a Macroscopic Fundamental Diagram, which has been recently applied to develop network-level traffic management strategies. Within this dynamic congestion pricing scheme, we differentiate two groups of users with respect to their value-of-time (which related to income levels). We then integrate incentives, such as improving public transport services or return part of the toll to some users, to motivate mode shift and increase the efficiency of pricing and to attain equitable savings for all users. A case study of a medium size network is carried out using an agent-based simulator. The developed pricing scheme demonstrates high efficiency in congestion reduction. Comparing to pricing schemes that utilize similar control mechanisms in literature which do not treat the adaptivity of users, the proposed pricing scheme shows higher flexibility in toll adjustment and a smooth behavioral stabilization in long-term operation. Significant differences in behavioral responses are found between the two user groups, highlighting the importance of equity treatment in the design of congestion pricing schemes. By integrating incentive programs for public transport using the collected toll revenue, more efficient pricing strategies can be developed where savings in travel time outweigh the cost of pricing, achieving substantial welfare gain.  相似文献   

8.
This paper investigates the multimodal network design problem (MMNDP) that optimizes the auto network expansion scheme and bus network design scheme in an integrated manner. The problem is formulated as a single-level mathematical program with complementarity constraints (MPCC). The decision variables, including the expanded capacity of auto links, the layout of bus routes, the fare levels and the route frequencies, are transformed into multiple sets of binary variables. The layout of transit routes is explicitly modeled using an alternative approach by introducing a set of complementarity constraints. The congestion interaction among different travel modes is captured by an asymmetric multimodal user equilibrium problem (MUE). An active-set algorithm is employed to deal with the MPCC, by sequentially solving a relaxed MMNDP and a scheme updating problem. Numerical tests on nine-node and Sioux Falls networks are performed to demonstrate the proposed model and algorithm.  相似文献   

9.
Travel information continues to receive significant attention in the field of travel behaviour research, as it is expected to help reduce congestion by directing the network state from a user equilibrium towards a more efficient system optimum. This literature review contributes to the existing literature in at least two ways. First, it considers both the individual perspective and the network perspective when assessing the potential effects of travel information, in contrast to earlier studies. Secondly, it highlights the role of bounded rationality as well as that of non-selfish behaviour in route choice and in response to information, complementing earlier reviews that mostly focused on bounded rationality only. It is concluded that information strategies should be tailor-made to an individual's level of rationality as well as level of selfishness in order to approach system-optimal conditions on the network level. Moreover, initial ideas and future research directions are provided for assessing the potential of travel information in order to improve network efficiency of existing road networks.  相似文献   

10.
The paper concerns the conceptual design of a transport system for pedestrian areas. The proposed transport system is based on a fleet of eco-sustainable Personal Intelligent City Accessible Vehicles (PICAVs). The vehicles are shared through the day by different users and the following specific services will be provided: instant access, open ended reservation and one way trips. Referring to the proposed transport system, a new methodology to optimise the fleet dimension and its distribution among the stations is proposed in this paper. The problem faced is an optimisation problem where the cost function to be minimised takes into account both the transport system cost and the user costs that depend on the waiting times. A random search algorithm has been adopted. Given a fleet dimension and its distribution among the stations, the waiting times of the users are assessed by a microscopic simulation. The simulation model tracks the second-by-second activity of each PICAV user, as well as the second-by-second activity of each vehicle. The overall methodology has been implemented in an object-oriented simulator. The proposed transport system has been planned and simulated for the historical city centre of Genoa, Italy.  相似文献   

11.
We consider the problem of characterizing user equilibria and optimal solutions for routing in a given network. We extend the known models by considering users oblivious to congestion in the following sense: While in the typical user equilibrium setting the users follow a strategy that minimizes their individual cost by taking into account the (dynamic) congestion due to the current routing pattern, an oblivious user ignores congestion altogether; instead, he or she decides his routing on the basis of cheapest routes on a network without any flow whatsoever. These cheapest routes can be, for example, the shortest paths in the network without any flow. This model tries to capture the fact that a certain percentage of travelers base their route simply on the distances they observe on a map, without thinking (or knowing, or caring) about the delays experienced on this route due to their fellow travelers. In this work we study the effect of such users using as the measure of network performance its price of anarchy, i.e., the ratio of the total latency experienced by the users (oblivious or not) at equilibrium over the social optimum.  相似文献   

12.
This paper explores the effects of queue spillover in transportation networks, in the context of dynamic traffic assignment. A model of spatial queue is defined to characterize dynamic traffic flow and queuing formation in network links. Network users simultaneously choose departure time and travel route to minimize the travel cost including journey time and unpunctuality penalty. Using some necessary conditions of the dynamic user equilibrium, dynamic network flows are obtained exactly on some networks with typical structure. Various effects of queue spillover are discussed based on the results of these networks, and some new paradoxes of link capacity expansion have been found as a result of such effects. Analytical and exact results in these typical networks show that ignoring queuing length may generate biased solutions, and the link storage capacity is a very important factor concerning the performance of networks.  相似文献   

13.
Traffic metering offers great potential to reduce congestion and enhance network performance in oversaturated urban street networks. This paper presents an optimization program for dynamic traffic metering in urban street networks based on the Cell Transmission Model (CTM). We have formulated the problem as a Mixed-Integer Linear Program (MILP) capable of metering traffic at network gates with given signal timing parameters at signalized intersections. Due to the complexities of the MILP model, we have developed a novel and efficient solution approach that solves the problem by converting the MILP to a linear program and several CTM simulation runs. The solution algorithm is applied to two case studies under different conditions. The proposed solution technique finds solutions that have a maximum gap of 1% of the true optimal solution and guarantee the maximum throughput by keeping some vehicles at network gates and only allowing enough vehicles to enter the network to prevent gridlocks. This is confirmed by comparing the case studies with and without traffic metering. The results in an adapted real-world case study network show that traffic metering can increase network throughput by 4.9–38.9% and enhance network performance.  相似文献   

14.
This paper investigates the local and global impact of speed limits by considering road users’ non-obedient behavior in speed selection. Given a link-specific speed limit scheme, road users will take into account the subjective travel time cost, the perceived crash risk and the perceived ticket risk as determinant factors for their actual speed choice on each link. Homogeneous travelers’ perceived crash risk is positively related to their driving speed. When travelers are heterogeneous, the perceived crash risk is class-specific: different user classes interact with each other and choose their own optimal speed, resulting in a Nash equilibrium speed pattern. With the speed choices on particular roads, travelers make route choices, resulting in user equilibrium in a general network. An algorithm is proposed to solve the user equilibrium problem with heterogeneous users under link-specific speed limits. The models and algorithms are illustrated with numerical examples.  相似文献   

15.
Traffic signal timings in a road network can not only affect total user travel time and total amount of traffic emissions in the network but also create an inequity problem in terms of the change in travel costs of users traveling between different locations. This paper proposes a multi‐objective bi‐level programming model for design of sustainable and equitable traffic signal timings for a congested signal‐controlled road network. The upper level of the proposed model is a multi‐objective programming problem with an equity constraint that maximizes the reserve capacity of the network and minimizes the total amount of traffic emissions. The lower level is a deterministic network user equilibrium problem that considers the vehicle delays at signalized intersections of the network. To solve the proposed model, an approach for normalizing incommensurable objective functions is presented, and a heuristic solution algorithm that combines a penalty function approach and a simulated annealing method is developed. Two numerical examples are presented to show the effects of reserve capacity improvement and green time proportion on network flow distribution and transportation system performance and the importance of incorporating environmental and equity objectives in the traffic signal timing problems. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   

16.
This study deals with the sensitivity analysis of an equilibrium transportation networks using genetic algorithm approach and uses the bi‐level iterative sensitivity algorithm. Therefore, integrated Genetic Algorithm‐TRANSYT and Path Flow Estimator (GATPFE) is developed for signalized road networks for various level of perceived travel time in order to test the sensitivity of perceived travel time error in an urban stochastic road networks. Level of information provided to drivers correspondingly affects the signal timing parameters and hence the Stochastic User Equilibrium (SUE) link flows. When the information on road system is increased, the road users try to avoid conflicting links. Therefore, the stochastic equilibrium assignment concept tends to be user equilibrium. The GATPFE is used to solve the bi‐level problem, where the Area Traffic Control (ATC) is the upper‐level and the SUE assignment is the lower‐level. The GATPFE is tested for six‐junction network taken from literature. The results show that the integrated GATPFE can be applied to carry out sensitivity analysis at the equilibrium network design problems for various level of information and it simultaneously optimize the signal timings (i.e. network common cycle time, signal stage and offsets between junctions).  相似文献   

17.
The network design problem is usually formulated as a bi-level program, assuming the user equilibrium is attained in the lower level program. Given boundedly rational route choice behavior, the lower-level program is replaced with the boundedly rational user equilibria (BRUE). The network design problem with boundedly rational route choice behavior is understudied due to non-uniqueness of the BRUE. In this study, thus, we mainly focus on boundedly rational toll pricing (BR-TP) with affine link cost functions. The topological properties of the lower level BRUE set are first explored. As the BRUE solution is generally non-unique, urban planners cannot predict exactly which equilibrium flow pattern the transportation network will operate after a planning strategy is implemented. Due to the risk caused by uncertainty of people’s reaction, two extreme scenarios are considered: the traffic flow patterns with either the minimum system travel cost or the maximum, which is the “risk-prone” (BR-TP-RP) or the “risk-averse” (BR-TP-RA) scenario respectively. The upper level BR-TP is to find an optimal toll minimizing the total system travel cost, while the lower level is to find the best or the worst scenario. Accordingly BR-TP can be formulated as either a min –min or a min –max program. Solution existence is discussed based on the topological properties of the BRUE and algorithms are proposed. Two examples are accompanied to illustrate the proposed methodology.  相似文献   

18.
This paper is an attempt to develop a generic simulation‐based approach to assess transit service reliability, taking into account interaction between network performance and passengers' route choice behaviour. Three types of reliability, say, system wide travel time reliability, schedule reliability and direct boarding waiting‐time reliability are defined from perspectives of the community or transit administration, the operator and passengers. A Monte Carlo simulation approach with a stochastic user equilibrium transit assignment model embedded is proposed to quantify these three reliability measures of transit service. A simple transit network with a bus rapid transit (BRT) corridor is analysed as a case study where the impacts of BRT components on transit service reliability are evaluated preliminarily.  相似文献   

19.
Optimal toll design from a network reliability point of view is addressed in this paper. Improving network reliability is proposed as a policy objective of road pricing. A reliability‐based optimal toll design model, where on the upper level network performance including travel time reliability is optimized, while on the lower level a dynamic user‐equilibrium is achieved, is presented. Road authorities aim to optimize network travel time reliability by setting tolls in a network design problem. Travelers are influenced by these tolls and make route and trip decisions by considering travel times and tolls. Network performance reliability is analyzed for a degradable network with elastic and fluctuated travel demand, which integrates reliability and uncertainty, dynamic network equilibrium models, and Monte Carlo methods. The proposed model is applied to a small hypothesized network for which optimal tolls are derived. The network travel time reliability is indeed improved after implementing optimal tolling system. Trips may have a somewhat higher, but more reliable, travel time.  相似文献   

20.
The aim of the paper is to evaluate the performance of a new strategy which is able to control dynamic route guidance (DRG) systems, mainly in urban road networks. The purpose of this strategy is to achieve dynamic user equilibrium in the network, even in abnormal network conditions, for example when there is an unexpected increase in traffic volume. It is based on feedback concept and it reacts to the traffic conditions observed in real time by adopting a decentralized structure.A series of experiments was performed, by means of a traffic micro-simulator, in a section of an urban road network. In the situations examined, the results seem to be quite positive. The analyses of the link level show that all of the various travel alternatives to reach the destination become more advantageous for users if DRG devices become more widespread among vehicles. In some cases we observe that the strategy succeeds in maintaining the possible alternatives in equilibrium conditions, by distributing users among the feasible turns. At no point in our investigations do we observe an unstable behaviour of the system, even when the number of vehicles fitted with a DRG device increases.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号