共查询到20条相似文献,搜索用时 0 毫秒
1.
Despite rapid advances of information technologies for intelligent parking systems, it remains a challenge to optimally manage limited parking resources in busy urban neighborhoods. In this paper, we use dynamic location-dependent parking pricing and reservation to improve system-wide performance of an intelligent parking system. With this system, the parking agency is able to decide the spatial and temporal distribution of parking prices to achieve a variety of objectives, while drivers with different origins and destinations compete for limited parking spaces via online reservation. We develop a multi-period non-cooperative bi-level model to capture the complex interactions among the parking agency and multiple drivers, as well as a non-myopic approximate dynamic programming (ADP) approach to solve the model. It is shown with numerical examples that the ADP-based pricing policy consistently outperforms alternative policies in achieving greater performance of the parking system, and shows reliability in handling the spatial and temporal variations in parking demand. 相似文献
2.
The greatest hurdle facing road pricing reform is political commitment. With rare exception, efforts to introduce significant reform in road pricing, aimed at raising sufficient revenue to ensure that road investment and ongoing maintenance is secured, without an additional impost to users above current outlays, while at the same time reducing traffic congestion, has fallen largely on politically non-supportive ears. The big challenge is to convince politicians (and their advisers) that it is possible to reform road pricing so that users are made better off (at least the great majority) in terms of time spent travelling and monies outlaid, and that government secures growing levels of revenue, but with at least some funds being used to improve public transport and the existing road network. This paper identifies the major issues that make much of the academic research into road pricing somewhat limited in terms of achieving real change. Staging reform is an appealing way forward, but ensuring the order and timing of events to secure progress is the big challenge. We offer some suggestions, including some ideas on new language designed to increase the level of buy in, and recognise that progress through action will require compromises in respect of an ‘ideal’ economically efficient pricing reform agenda. 相似文献
3.
Quantifying the benefit of responsive pricing and travel information in the stochastic congestion pricing problem 总被引:1,自引:0,他引:1
Lauren M. Gardner Stephen D. Boyles 《Transportation Research Part A: Policy and Practice》2011,45(3):204-218
This paper is concerned with roadway pricing amidst the uncertainty which characterizes long-term transportation planning. Uncertainty is considered both on the supply-side (e.g., the effect of incidents on habitual route choice behavior) and on the demand-side (e.g., due to prediction errors in demand forecasting). The framework developed in this paper also allows the benefits of real-time travel information to be compared directly against the benefits of responsive pricing, allowing planning agencies to identify the value of these policy options or contract terms in publicly-operated toll roads. Specifically, six scenarios reflect different combinations of policy options, and correspond to different solution methods for optimal tolls. Demonstrations are provided on both the Sioux falls and Anaheim networks. Results indicate that providing information to drivers implemented alongside responsive tolling may reduce expected total system travel time by over 9%, though more than 8% of the improvement is due to providing information, with the remaining 1% improvement gained from responsive tolling. 相似文献
4.
We consider a two-stage stochastic extension of the bilevel pricing model introduced by Labbé et al. (1998). In the first stage, the leader sets tariffs on a subset of arcs of a transportation network, with the aim of maximizing profits while, at the lower level, flows are assigned to cheapest paths of a multicommodity transportation network. In the second stage, the situation repeats itself under the constraint that tariffs should not differ too widely from those set at the first stage, a condition that frequently arises in practice. We analyze properties of the model, provide numerical illustrations, and open avenues for further research into this area. 相似文献
5.
One critical operational issue of air cargo operation faced by airlines is the control over the sales of their limited cargo space. Since American Airlines’ successful implementation in the post-deregulation era, revenue management (RM) has become a common practice for the airline industry. However, unlike the air passenger operation supported by well-developed RM systems with advanced decision models, the decision process in selling air cargo space to freight forwarders is usually based on experience, without much support from optimization techniques. This study first formulates a multi-dimensional dynamic programming (DP) model to present a network RM problem for air cargo. In order to overcome the computational challenge, this study develops two linear programming (LP) based models to provide the decision support operationally suitable for airlines. In addition, this study further introduces a dynamic adjustment factor to alleviate the inaccuracy problem of the static LP models in estimating resource opportunity cost. Finally, a numerical experiment is performed to validate the applicability of the developed model and solution algorithm to the real-world problems. 相似文献
6.
This study explores two nonparametric machine learning methods, namely support vector regression (SVR) and artificial neural networks (ANN), for understanding and predicting high-speed rail (HSR) travelers’ choices of ticket purchase timings, train types, and travel classes, using ticket sales data. In the train choice literature, discrete choice analysis is the predominant approach and many variants of logit models have been developed. Alternatively, emerging travel choice studies adopt non-utility-based methods, especially nonparametric machine learning methods including SVR and ANN, because (1) those methods do not rely on assumptions on the relations between choices and explanatory variables or any prior knowledge of the underlying relations; (2) they have superb capabilities of iteratively identifying patterns and extracting rules from data. This paper thus contributes to the HSR train choice literature by applying and comparing SVR and ANN with a real-world case study of the Shanghai-Beijing HSR market in China. A new normalized metric capturing both the load factor and the booking lead time is proposed as the target variable and several train service attributes, such as day of week, departure time, travel time, fare, are identified as input variables. Computational results demonstrate that both SVR and ANN can predict the train choice behavior with high accuracy, outperforming the linear regression approach. Potential applications of this study, such as rail pricing reform, have also been identified. 相似文献
7.
John F. Mcdonald 《Transportation》1995,22(4):353-369
This article examines urban highway congestion pricing in the instance in which it is not possible to levy a congestion toll on a major portion of the urban road system. This case is pertinent because of technical and/or political constraints. The article uses economic theory and numerical examples to show that the optimum second-best toll can vary appreciably from the optimal tolls in a regime in which efficient tolls can be imposed on all routes. 相似文献
9.
José Holguín-Veras 《Transportation Research Part A: Policy and Practice》2011,45(8):802-824
The paper develops a set of analytical formulations to study the behavior of the urban delivery industry in response to cordon time-of-day pricing, time-distance pricing, and comprehensive financial policies targeting carriers and receivers. This is accomplished by modeling the behavior of receivers in response to financial incentives, and the ensuing behavior of the carrier in response to both pricing and the receivers’ decisions concerning off-hour deliveries. The analytical formulations consider both the base case condition, and a mixed operation with both regular hour and off-hour deliveries; two pricing schemes: cordon time of day, and time-distance pricing; two types of operations: single-tour, and multi-tour carriers; and three different scenarios in terms of profitability of the carrier operation, which include an approximation to the best case, the expected value, and the worst case. The analyses, both theoretical and numerical, highlight the limitations of pricing-only approaches. In the case of cordon time of day pricing, the chief conclusion is that it is of limited use as a freight demand management tool because: (1) in a competitive market the cordon toll cannot be transferred to the receivers as it is a fixed cost and (2) the structure of the cost function, that only provides an incentive to the carrier to switch to the off-hours when all the receivers in the tour switch to the off-hours. The analyses of time-distance pricing clearly indicate that, though its tolls could be transferred to the receivers and provide an incentive for behavior change, the magnitude of the expected toll transfers under real life conditions are too small to have any meaningful impact on receivers choice of delivery times. In essence, the key policy implication is that in order to change the joint behavior of carrier and receivers, financial incentives—or programs that foster unassisted off-hour deliveries—should be made available to receivers in exchange for their commitment to do off-hour deliveries. As the paper proves, if a meaningful number of receivers switch to the off-hours, the carriers are likely to follow suit. 相似文献
10.
Benoit Crevier Jean-François Cordeau Gilles Savard 《Transportation Research Part B: Methodological》2012,46(1):100-119
In the rail industry, profit maximization relies heavily on the integration of logistics activities with an improved management of revenues. The operational policies chosen by the carrier have an important impact on the network yield and thus on global profitability. This paper bridges the gap between railroad operations planning and revenue management. We propose a new bilevel mathematical formulation which encompasses pricing decisions and network planning policies such as car blocking and routing as well as train make-up and scheduling. An exact solution approach based on a mixed integer formulation adapted to the problem structure is presented, and computational results are reported on randomly generated instances. 相似文献
11.
Mobility management (MM) is a transportation management policy that uses “soft” measures to attempt to reduce car use and
promote sustainable transportation modes such as public transport, bicycles, and walking. Using communication and other means,
MM induces voluntarily change towards more sustainable transportation modes. We implemented MM marketing to promote an experimental
community bus service. This project had two components: a questionnaire conducted in the service area and a monthly newsletter.
The questionnaire was more than a survey; it also communicated information about the bus and helped promote bus use. One month
after the survey, we implemented a follow-up survey targeting the initial survey respondents. Results suggest that the MM
program produced a general increase in bus use, as well as mouth-to-mouth advertising, that helped promote bus use. 相似文献
12.
High Occupancy Toll (HOT) lanes are emerging as a solution to the underutilization of High Occupancy Vehicle (HOV) lanes and also a means to generate revenue for the State Departments of Transportation. This paper proposes a method to determine the toll price dynamically in response to the changes in traffic condition, and describes the procedures for estimating the essential parameters. Such parameters include expected delays, available capacity for toll-paying vehicles and distribution of travelers’ value of time (VOT). The objective function of the proposed pricing strategy can be flexibly modified to minimize delay, maximize revenue or combinations of specified levels of delay and revenue. Real-world data from a 14-mile of freeway segment in the San Francisco Bay Area are used to demonstrate the applicability and feasibility of the proposed method, and findings and implications from this case study are discussed. 相似文献
13.
We propose a competitive on-demand mobility model using a multi-server queue system under infinite-horizon look-ahead. The proposed approach includes a novel dynamic optimization algorithm which employs a Markov decision process (MDP) and provides opportunities to revolutionize conventional transit services that are plagued by high cost, low ridership, and general inefficiency, particularly in disadvantaged communities and low-income areas. We use this model to study the implications it has for such services and investigate whether it has a distinct cost advantage and operational improvement. We develop a dynamic pricing scheme that utilizes a balking rule that incorporates socially efficient level and the revenue-maximizing price, and an equilibrium-joining threshold obtained by imposing a toll on the customers who join the system. Results of numerical simulations based on actual New York City taxicab data indicate that a competitive on-demand mobility system supported by the proposed model increases the social welfare by up to 37% on average compared to the single-server queuing system. The study offers a novel design scheme and supporting tools for more effective budget/resource allocation, planning, and operation management of flexible transit systems. 相似文献
14.
Accurate short-term arrival forecasting is essential information for railway operators to conduct daily operations such as demand management strategies. Conventional time series methods apply historical arrival data which is the accumulation of reservations to project future arrivals. This study aims to utilize reservation data directly and proposes a novel advanced booking model by using the framework of case-based reasoning. The proposed model contains four modules with distinctive functions for similarity evaluation, instance selection, arrival projection, and parameter search. We have the constructed model tested on fourteen daily arrival series and compared its out-of-sample accuracy with that of four traditional benchmarks. The empirical results show that in average the proposed self-learning model may reduce at least 11% of mean square errors (MSE). Moreover, the learning scheme in the model may achieve significant reduction of MSE comparing with performance of other naïve versions. 相似文献
15.
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. 相似文献
16.
This paper investigates evolutionary implementation of congestion pricing schemes to minimize the system cost and time, measured in monetary and time units, respectively, with the travelers’ day-to-day route adjustment behavior and their heterogeneity. The travelers’ heterogeneity is captured by their value-of-times. First, the multi-class flow dynamical system is proposed to model the travelers’ route adjustment behavior in a tolled transportation network with multiple user classes. Then, the stability condition and properties of equilibrium is examined. We further investigate the trajectory control problem via dynamic congestion pricing scheme to derive the system cost, time optimum, and generally, Pareto optimum in the sense of simultaneous minimization of system cost and time. The trajectory control problem is modeled by a differential–algebraic system with the differential sub-system capturing the flow dynamics and the algebraic one capturing the pricing constraint. The explicit Runge–Kutta method is proposed to calculate the dynamic flow trajectories and anonymous link tolls. The method allows the link tolls to be updated with any predetermined periods and forces the system cost and/or time to approach the optimum levels. Both analytical and numerical examples are adopted to examine the efficiency of the method. 相似文献
17.
Dušan Teodorović Konstantinos Triantis Praveen Edara Yueqin Zhao Snežana Mladenović 《运输规划与技术》2013,36(4):399-416
Abstract Planners, engineers and economists have introduced various demand management methods in an attempt to reduce the fast growing traffic congestion. The basic idea behind various demand management strategies is to force drivers to travel and use transportation facilities more during off-peak hours and less during peak hours, as well as to increase the usage of underutilized routes. In this paper, a new demand management concept – Auction-based Congestion Pricing – is proposed and modeled. 相似文献
18.
This article presents the economic rationale for road pricing and provides some scale on the magnitude of peak period tolls that might be justified. It discusses the impacts of such tolls on congestion, air quality and economic development and suggests a long term strategy towards areawide implementation of peak period pricing. It discusses current trends which are increasing the likelihood for implementation of congestion pricing and toll roads in the future. In particular, it discusses some aspects of the 1991 Intermodal Surface Transportation Efficiency Act (ISTEA) which will eliminate some of the current restraints on congestion pricing and toll highways.Abbreviations ETC
Electronic toll collection
- FHWA
Federal Highway Administration
- HOV
High occupancy vehicle
- ISTEA
Intermodal Surface Transportation Efficiency Act
- LOS
Level of service
- TCM
Transportation control measure
- V/C
Volume-to-capacity ratio
- VMT
Vehicle mile(s) of travel
- vphpl
Vehicles per hour per lane 相似文献
19.
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%. 相似文献
20.
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. 相似文献