共查询到20条相似文献,搜索用时 0 毫秒
1.
Priced managed lanes are increasingly being used to better utilize the existing capacity of the roadway to relieve congestion and offer reliable travel time to road users. In this paper, we investigate the optimization problem for pricing managed lanes with multiple entrances and exits which seeks to maximize the revenue and minimize the total system travel time (TSTT) over a finite horizon. We propose a lane choice model where travelers make online decisions at each diverge point considering all routes on a managed lane network. We formulate the problem as a deterministic Markov decision process and solve it using the value function approximation (VFA) method for different initializations. We compare the performance of the toll policies predicted by the VFA method against the myopic revenue policy which maximizes the revenue only at the current timestep and two heuristic policies based on the measured densities on the managed and general purpose lanes (GPLs). We test the results on four different test networks. The primary findings from our research suggest the usefulness of the VFA method for determining dynamic tolls. The best-found objective value from the method at its termination is better than other heuristics for all test networks with average improvements in the objective ranging between 10% and 90% for revenue maximization and 0–27% for TSTT minimization. Certain VFA initializations obtain best-found toll profiles within first 5–50 iterations which warrants computational time savings. Our findings also indicate that the revenue-maximizing optimal policies follow the “jam-and-harvest” behavior where the GPLs are pushed towards congestion in the earlier time steps to generate higher revenue in the later time steps, a characteristic not observed for the policies minimizing TSTT. 相似文献
2.
The city of San Francisco is undertaking a large-scale controlled parking pricing experiment. San Francisco has adopted a performance goal of 60–80% occupancy for its metered parking. The goal represents an heuristic performance measure intended to reduce double parking and cruising for parking, and improve the driver experience; it follows a wave of academic and policy literature that calls for adjusting on-street parking prices to achieve similar occupancy targets. In this paper, we evaluate the relationship between occupancy rules and metrics of direct policy interest, such as the probability of finding a parking space and the amount of cruising. We show how cruising and arrival rates can be simulated or estimated from hourly occupancy data. Further, we evaluate the impacts of the first two years of the San Francisco program, and conclude that rate changes have helped achieve the City’s occupancy goal and reduced cruising by 50%. 相似文献
3.
This paper investigates how recurrent parking demand can be managed by dynamic parking pricing and information provision in the morning commute. Travelers are aware of time-varying pricing information and time-varying expected occupancy, through either their day-to-day experience or online information provision, to make their recurrent parking choices. We first formulate the parking choices under the User Equilibrium (UE) conditions using the Variational Inequality (VI) approach. More importantly, the System Optimal (SO) parking flow pattern and SO parking prices are also derived and solved efficiently using Linear Programming. Under SO, any two parking clusters cannot be used at the same time by travelers between more than one Origin–Destination (O–D) pairs. The SO parking flow pattern is not unique, which offers sufficient flexibility for operators to achieve different management objectives while keeping the flow pattern optimal. We show that any optimal flow pattern can be achieved by charging parking prices in each area that only depend on the time or occupancy, regardless of origins and destinations of users of this area. In the two numerical experiments, the best system performance is usually achieved by pricing the more preferred (convenient) area such that it is used up to a terminal occupancy of around 85–95%. Optimal pricing essentially balances the parking congestion (namely cruising time) and the level of convenience. 相似文献
4.
In congested urban areas, it remains a pressing challenge to reduce unnecessary vehicle circling for parking while at the same time maximize parking space utilization. In observance of new information technologies that have become readily accessible to drivers and parking agencies, we develop a dynamic non-cooperative bi-level model (i.e. Stackelberg leader–follower game) to set parking prices in real-time for effective parking access and space utilization. The model is expected to fit into an integrated parking pricing and management system, where parking reservations and transactions are facilitated by sensing and informatics infrastructures, that ensures the availability of convenient spaces at equilibrium market prices. It is shown with numerical examples that the proposed dynamic parking pricing model has the potential to virtually eliminate vehicle circling for parking, which results in significant reduction in adverse socioeconomic externalities such as traffic congestion and emissions. 相似文献
5.
Mei-Ting Tsai Chih-Peng Chu 《Transportation Research Part D: Transport and Environment》2012,17(2):145-148
This paper investigates a parking reservation mechanism to reduce car cruising to find parking. To consider the benefits for drivers and parking facility providers, we charge drivers for making reservations in addition to parking fees, by introducing a reservation pricing model that makes reservation prices equivalent to the value of saved search time. By modeling the number of vacant spaces as a stochastic variable, and applying binomial pricing methods, parking reservation prices are obtained. Numerical examples based on the data for two parking facilities in Taiwan are given. 相似文献
6.
The dynamic shortest path problem with time-dependent stochastic disruptions consists of finding a route with a minimum expected travel time from an origin to a destination using both historical and real-time information. The problem is formulated as a discrete time finite horizon Markov decision process and it is solved by a hybrid Approximate Dynamic Programming (ADP) algorithm with a clustering approach using a deterministic lookahead policy and value function approximation. The algorithm is tested on a number of network configurations which represent different network sizes and disruption levels. Computational results reveal that the proposed hybrid ADP algorithm provides high quality solutions with a reduced computational effort. 相似文献
7.
With increasing auto demands, efficient parking management is by no means less important than road traffic congestion control. This is due to shortages of parking spaces within the limited land areas of the city centers in many metropolises. The parking problem becomes an integrated part of traffic planning and management. On the other hand, it is a fact that many private parking spots are available during daytime in nearby residential compound because those residents drive their cars out to work. These temporarily vacant parking lots can be efficiently utilized to meet the parking demand of other drivers who are working at nearby locations or drivers who come for shopping or other activities. This paper proposes a framework and a simple model for embracing shared use of residential parking spaces between residents and public users. The proposed shared use is a winning strategy because it maximizes the use of private resources to benefit the community as a whole. It also creates a new business model enabled by the fast-growing mobile apps in our daily lives. 相似文献
8.
Due to unexpected demand surge and supply disruptions, road traffic conditions could exhibit substantial uncertainty, which often makes bus travelers encounter start delays of service trips and substantially degrades the performance of an urban transit system. Meanwhile, rapid advances of information and communication technologies have presented tremendous opportunities for intelligently scheduling a bus fleet. With the full consideration of delay propagation effects, this paper is devoted to formulating the stochastic dynamic vehicle scheduling problem, which dynamically schedules an urban bus fleet to tackle the trip time stochasticity, reduce the delay and minimize the total costs of a transit system. To address the challenge of “curse of dimensionality”, we adopt an approximate dynamic programming approach (ADP) where the value function is approximated through a three-layer feed-forward neural network so that we are capable of stepping forward to make decisions and solving the Bellman’s equation through sequentially solving multiple mixed integer linear programs. Numerical examples based on the realistic operations dataset of bus lines in Beijing have demonstrated that the proposed neural-network-based ADP approach not only exhibits a good learning behavior but also significantly outperforms both myopic and static polices, especially when trip time stochasticity is high. 相似文献
9.
Universities, like other types of public and private institutions, when located in a city, have both positive and negative impacts on the area where they are situated. On the one hand, they contribute to the prestige of the area; on the other hand, they are large generators/attractors of traffic. The ability to successfully balance the pros and cons of the urban location of these large traffic-generating institutions is crucial for their success and for the livability of the city. In this paper this issue has been analyzed selecting as a representative case the University of Trieste.The aim of the research is to understand: (a) how mode choice decisions are made by the teaching and administrative staff and by the students at the various locations where academic activities take place, and (b) how they would be affected by 8 different transport management policies. It is found that changing the parking regulations (via the annual permit cost, the hourly parking fee, the number of parking spaces and the location of the parking lots) greatly influences mode choice in favor of bus use, especially for teaching and administrative staff and in the suburban locations. The students would be impacted by such changes only if an hourly parking tariff is introduced. The alternative approach of fully subsidizing the bus services would also have a large impact on bus ridership, affecting the mode choice in particular of the teaching staff and in the main university suburban sites.Since the implementation of these bus-favoring policies could face the opposition either of the university staff or of the bus company, two more balanced policy mixes were tested: the first one, increasing parking price and imposing new parking restrictions, would increase bus ridership by 19%; the second one, reducing both bus and parking subsidies, would increase bus ridership by 13%. 相似文献
10.
Parking problem becomes one of major issues in the city transportation management since the spatial resource of a city is limited and the parking cost is expensive. Lots of cars on the road should spend unnecessary time and consume energy during searching for parking due to limited parking space. To cope with these limitations and give more intelligent solutions to drivers in the selection of parking facility, this study proposes a smart parking guidance algorithm. The proposed algorithm supports drivers to find the most appropriate parking facility considering real-time status of parking facilities in a city. To suggest the most suitable parking facility, several factors such as driving distance to the guided parking facility, walking distance from the guided parking facility to destination, expected parking cost, and traffic congestion due to parking guidance, are considered in the proposed algorithm. To evaluate the effectiveness of the proposed algorithm, simulation tests have been carried out. The proposed algorithm helps to maximize the utilization of space resources of a city, and reduce unnecessary energy consumption and CO2 emission of wandering cars since it is designed to control the utilization of parking facility efficiently and reduce traffic congestion due to parking space search. 相似文献
11.
When total parking supply in an urban downtown area is insufficient, morning commuters would choose their departure times not only to trade off bottleneck congestion and schedule delays, but also to secure a parking space. Recent studies found that an appropriate combination of reserved and unreserved parking spaces can spread the departures of those morning commuters and hence reduce their total travel cost. To further mitigate both traffic congestion and social cost from competition for parking, this study considers a parking reservation scheme with expiration times, where commuters with a parking reservation have to arrive at parking spaces for the reservation before a predetermined expiration time. We first show that if all parking reservations have the same expiration time, it is socially preferable to set the reservations to be non-expirable, i.e., without expiration time. However, if differentiated expiration times are properly designed, the total travel cost can be further reduced as compared with the reservation scheme without expiration time, since the peak will be further smoothed out. We explore socially desirable equilibrium flow patterns under the parking reservation scheme with differentiated expiration times. Finally, efficiencies of the reservation schemes are examined. 相似文献
12.
Pierre Merlin 《运输规划与技术》2013,36(1):39-52
A decade of increasing Federal attention to urban transportation needs has culminated in the 1970 Urban Mass Transportation Assistance Act. This Act is intended to provide 10 thousand million dollars over the next 12 years in Federal assistance money to urban public transportation systems. This paper examines the needs of selected U.S. cities as a basis for (1) understanding the vast, various and complex transportation needs of urban areas throughout the country, and (2) assessing the sufficiency of these funds. The sample cities have been placed into three broad categories based on the state of development of their transportation systems. In Category I cities, the essential need is to ensure the survival of bus systems for the use of non‐drivers, or to provide some other viable alternative to the automobile; in Category II cities, the primary needs are to relieve auto congestion and to improve public transportation components, while in Category III cities, the primary need is massive investment to improve and to extend public transportation facilities. It is concluded that the presently intended Federal funding level for transportation will not meet the financial requirements of the Category III cities. 相似文献
13.
This paper aims at investigating how the pricing strategy of European airlines is affected by code-share agreements on international routes. Our data cover several routes linking the main UK airports to many European destinations and includes posted fares collected at different days before departure. By analyzing the temporal profile of airline fares, we identify three main results. First, code-share increases fares especially for early bookers. Second, the higher prices in code-shared flights are offered by marketing carriers. Finally, in single operator code-shared flights (unilateral code-share), the pricing profile is flatter than under parallel code-share. 相似文献
14.
Decision planning for an efficient fleet management is crucial for airlines to ensure a profit while maintaining a good level of service. Fleet management involves acquisition and leasing of aircraft to meet travelers' demand. Accordingly, the methods used in modeling travelers' demand are crucial as they could affect the robustness and accuracy of the solutions. Compared with most of the existing studies that consider deterministic demand, this study proposes a new methodology to find optimal solutions for a fleet management decision model by considering stochastic demand. The proposed methodology comes in threefold. First, a five‐step modeling framework, which is incorporated with a stochastic demand index (SDI), is proposed to capture the occurrence of uncertain events that could affect the travelers' demand. Second, a probabilistic dynamic programming model is developed to optimize the fleet management model. Third, a probable phenomenon indicator is defined to capture the targeted level of service that could be achieved satisfactorily by the airlines under uncertainty. An illustrative case study is presented to evaluate the applicability of the proposed methodology. The results show that it is viable to provide optimal solutions for the aircraft fleet management model. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
15.
Morning commuters choose their departure times based on a combination of factors—the chances of running into bottleneck congestion, the likely schedule delays, and parking space availability. This study investigates the morning commute problem with both bottleneck congestion and parking space constraints. In particular, it considers the situation when some commuters have reserved parking spots while others have to compete for public ones on a first-come-first-served basis. Unlike the traditional pure bottleneck model, the rush-hour dynamic traffic pattern with a binding parking capacity constraint varies with the relative proportions of the two classes of commuters. It is found that an appropriate combination of reserved and unreserved parking spots can temporally relieve traffic congestion at the bottleneck and hence reduce the total system cost, because commuters without a reserved parking spot are compelled to leave home earlier in order to secure a public parking spot. System performance is quantified in terms of the relative proportions of the two classes of commuters and is compared with those in the extreme cases when all auto commuters have to compete for parking and when none of them have to compete for one. 相似文献
16.
This study is the first in the literature to model the joint equilibrium of departure time and parking location choices when commuters travel with autonomous vehicles (AVs). With AVs, walking from parking spaces to the work location is not needed. Instead, AVs will drop off the commuters at the workplace and then drive themselves to the parking spaces. In this context, the equilibrium departure/arrival profile is different from the literature with non-autonomous vehicles (non-AVs). Besides modeling the commuting equilibrium, this study further develops the first-best time-dependent congestion tolling scheme to achieve the system optimum. Also, a location-dependent parking pricing scheme is developed to replace the tolling scheme. Furthermore, this study discusses the optimal parking supply to minimize the total system cost (including both the travel cost and the social cost of parking supply) under either user equilibrium or system optimum traffic flow pattern. It is found that the optimal planning of parking can be different from the non-AV situation, since the vehicles can drive themselves to parking spaces that are further away from the city center and walking of commuters is avoided. This paper sheds light on future parking supply planning and traffic management. 相似文献
17.
In studies of parking policy, the role of parking pricing has been addressed. Most researches have focused on the determination of a proper price for city parking spaces that are open to the public and it is now evident that price is used by authorities as a tool to manage transport demand. However, studies of parking pricing that pertain to privately-owned parking resources are few and in particular, the problem of setting a proper price for physical market parking has rarely been studied, such as a mall’s ‘dual-pricing portfolio’ decision for the simultaneous determination of a parking fee and the consumer spending required for free parking (i.e., the ‘threshold’). This is a common problem for most malls, but the different agents involved (e.g., the visitors, the mall, the marketplace and the parking lot departments) usually have diverse goals, so the decision must take account of a multiplicity of criteria and subtle relationships. In order to systematically support this type of inter-departmental decision process, a decision model that includes an analytical decision-aid process and the relevant programming models is established. A numerical example verifies the proposed model by taking the data for a mall in Taiwan and the implications, in terms of management, are given. This systematic computational model can be generalized to any type of commercial market that requires a (new) parking pricing policy. 相似文献
18.
Abstract The current air traffic system faces recurrent saturation problems. Numerous studies are dedicated to this issue, including the present research on a new dynamic regulation filter holding frequent trajectory optimisations in a real-time sliding horizon loop process. We consider a trajectory optimisation problem arising in this context, where a feasible four-dimensional (4D) trajectory is to be built and assigned to each regulated flight to suppress sector overloads while minimising the cost of the chosen policy. We model this problem with a mixed integer linear programme and solve it with a branch-and-price approach. The pricing sub-problem looks for feasible trajectories in a dynamic three-dimensional (3D) network and is solved with a specific algorithm based on shortest path labelling algorithms and on dynamic programming. Each algorithm is tested on real-world data corresponding to a complete traffic day in the European air traffic system; experimental results, including computing times measurement, validate the solution process. 相似文献
19.
This study examines the price and flow dynamics under a tradable credit scheme, when the credits can be traded in a free market. A continuous dynamic model in a finite time horizon is proposed to describe the travelers’ learning behavior and the evolution of network flows and credit price, and then the existence and uniqueness of the equilibria are established. The conditions for stability and convergence of the dynamic system as the time horizon extends to infinity and the impact of limited implementation time horizon on the system behavior are investigated. 相似文献
20.
This paper provides a globally optimal solution to an important problem: given a real-world route, what is the most energy-efficient way to drive a vehicle from the origin to the destination within a certain period of time. Along the route, there may be multiple stop signs, traffic lights, turns and curved segments, roads with different grades and speed limits, and even leading vehicles with pre-known speed profiles. Most of such route information and features are actually constraints to the optimal vehicle speed control problem, but these constraints are described in two different domains. The most important concept in solving this problem is to convert the distance-domain route constraints to some time-domain state and input constraints that can be handled by optimization methods such as dynamic programming (DP). Multiple techniques including cost-to-go function interpolation and parallel computing are used to reduce the computation of DP and make the problem solvable within a reasonable amount of time on a personal computer. 相似文献