Convergence to Equilibrium in Dynamic Traffic Networks when Route Cost Is Decay Monotone

Mounce, Richard
August 2007
Transportation Science;Aug2007, Vol. 41 Issue 3, p409
Academic Journal
This paper addresses the issue of convergence to equilibrium in dynamic traffic assignment. Within-day time is considered to be a continuous variable, so that traffic flows and costs are functions of within-day time. Flow propagates along routes connecting origin-destination (OD) pairs with the demand for travel between each OD pair considered to be rigid (fixed from day to day although it can vary within day). Day-to-day time is also modelled as continuous with the day-to-day dynamical system derived naturally from the usual dynamical user equilibrium (DUE) condition. This paper focuses on the bottleneck model, which has deterministic vertical queueing at bottleneck link exits when flow exceeds capacity. A new property called decay monotonicity is introduced. The link delay (and hence link cost) function is shown to be a decay monotone function of link flow provided that the link capacity is continuously differentiable and positive. In a restricted version of the single bottleneck per route case, it is shown that link cost decay monotonicity implies route cost decay monotonicity. Decay monotonicity of the route cost function is shown to be sufficient for convergence to equilibrium of the dynamical system.


Related Articles

  • A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem. Archetti, Claudia; Bertazzi, Luca; Laporte, Gilbert; Speranza, Maria Grazia // Transportation Science;Aug2007, Vol. 41 Issue 3, p382 

    We consider a distribution problem in which a product has to be shipped from a supplier to several retailers over a given time horizon. Each retailer defines a maximum inventory level. The supplier monitors the inventory of each retailer and determines its replenishment policy, guaranteeing that...

  • An application of genetic and tabu searches to the freight railroad operating plan problem. Gorman, Michael Francis // Annals of Operations Research;1998, Vol. 78 Issue 1-4, p51 

    This paper addresses the joint train-scheduling and demand-flow problem for a major US freight railroad. No efficient optimization techniques are known to solve the NP-hard combinatorial optimization problem. Genetic search is used to find acceptable solutions; however, its performance is found...

  • Branch-and-Bound Strategies for Dynamic Programming. Morin, Thomas L.; Marsten, Roy E. // Operations Research;Jul/Aug76, Vol. 24 Issue 4, p611 

    This paper shows how branch-and..bound methods can be used to reduce storage and, possibly, computational requirements in discrete dynamic programs. Relaxations and fathoming criteria are used to identify and to eliminate states whose corresponding subpolicies could not lead to optimal policies....

  • Incorporating Pricing Decisions into the Stochastic Dynamic Fleet Management Problem. Topaloglu, Huseyin; Powell, Warren // Transportation Science;Aug2007, Vol. 41 Issue 3, p281 

    This paper shows how to coordinate the decisions on pricing and fleet management of a freight carrier. We consider a setting where the carrier announces its prices at the beginning of a certain time horizon and the load arrivals over this horizon depend on the announced prices. Assuming that the...

  • Shortfall risk minimising strategies in the binomial model: characterisation and convergence. Favero, Gino; Vargiolu, Tiziano // Mathematical Methods of Operations Research;2006, Vol. 64 Issue 2, p237 

    In this paper we study the dependence on the loss function of the strategy, which minimises the expected shortfall risk when dealing with a financial contingent claim in the particular situation of a binomial model. After having characterised the optimal strategies in the particular cases when...

  • Wanted: transit vision. Merrion, Paul // Crain's Chicago Business;6/21/2004, Vol. 27 Issue 25, p4 

    Chicago's, Illinois truck-congested streets are a prime candidate for some of the billions of dollars in proposed new federal spending to move the nation's freight more efficiently, provided that the state and city go after that money with innovative, high-impact projects. While the bill awaits...

  • THE SHIFTING BOTTLENECK PROCEDURE FOR JOB SHOP SCHEDULING. Adams, Joseph; Balas, Egon; Zawack, Daniel // Management Science;Mar88, Vol. 34 Issue 3, p391 

    We describe an approximation method for solving the minimum makespan problem of job shop scheduling. It sequences the machines one by one, successively, taking each time the machine identified as a bottleneck among the machines not yet sequenced. Every time after a new machine is sequenced, all...

  • Around Africa with a fridge.  // Truck & Driver;Jun2008, p18 

    The article describes the transport of a 50-meter-long, 40-tonne cold box from England to Zambia. The giant cooler traveled by ship to Walvis Bay in Namibia. It was then attached to two 10-axle Goldhofer heavy-duty trailer modules hauled by Mercedes Actros Titan tractors and took the 2,400...

  • Pricing in Dynamic Vehicle Routing Problems. Figliozzi, Miguel Andres; Mahmassani, Hani S.; Jaillet, Patrick // Transportation Science;Aug2007, Vol. 41 Issue 3, p302 

    The principal focus of this paper is to study carrier pricing decisions for a type of vehicle routing problems defined in a competitive and dynamic environment. This paper introduces the vehicle routing problem in a competitive environment (VRPCE) as an extension of the traveling-salesman...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics