Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods

....The most comprehensive guide to designing practical and efficient algorithms!.... The Algorithm Design Manual, Second Edition "...the book is an algorithm-implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations [and] extensive bibliography make the book an invaluable resource for everyone interested in the subject." --ACM Computing Reviews "It has all the right ingredients: rich contents, friendly, personal language, subtle humor, the right references, and a plethora of pointers to resources."-- P. Takis Metaxas, Wellesley College "This is the most approachable book on algorithms I have." -- Megan Squire, Elon University, USA This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency. Expanding onthe first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students. The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques, provides accessible instructionon methods for designing and analyzing computer algorithms. The second part, Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography. NEW to the second edition: Doubles the tutorial material and exercises over the first edition Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them Includes several NEW "war stories" relating experiences from real-world applications Provides up-to-date links leading to the very best algorithm implementations available in C, C++, and Java ADDITIONAL Learning Tools: Exercises include "job interview problems" from major software companies Highlighted take-home lesson boxes emphasize essential concepts Provides comprehensive references to both survey articles and the primary literature Exercises points to relevant programming contest challenge problems Many algorithms presented with actual code (written in C) as well as pseudo-code A full set of lecture slides and additional material available at www.algorist.com Written by a well-known algorithms researcher who received the IEEE Computer Science and Engineering Teaching Award, this new edition of The Algorithm Design Manual is an essential learning tool for students needing a solid grounding in algorithms, as well as a special text/reference for professionals who need an authoritative and insightful guide. Professor Skiena is also author of the popular Springer text, Programming Challenges: The Programming Contest Training Manual.

http://www.r-5.org/files/books/computers/algo-list/common/Steven_Skiena-The_Algorithm_Design_Manual-EN.pdf

The Algorithm Design Manual

Routing and scheduling of vehicles and crews: The state of the art

Network Optimization: Continuous and Discrete Models

We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of shortest paths algorithms. The interaction between the experimental evaluation of algorithm behavior and the theoretical analysis of algorithm performance plays an important role in our research.

Shortest paths algorithms: theory and experimental evaluation

This paper presents a novel user-equilibrium (UE) traffic assignment algorithm, which under conventional assumptions, promises to compute UE arc flows to acceptable precision, regardless of the network’s topology, size or congestion: • The algorithm takes the simple approach of shifting flow from a costliest path to a cheapest path until the costs of all used paths are within a given ϵ of the cheapest • Because of being path-based, it avoids tailing • In spite of being path-based, it neither stores nor enumerates paths • These efficiencies derive from decomposing the problem into a sequence of easy single-origin problems on acyclic sub-networks Solutions to this sequence of sub-network flows converge rapidly to a sharp practical estimate of UE arc flows—as is amply demonstrated by tests using the Chicago region’s 40,000-arc network model

A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration

: This paper examines different algorithms for calculating the shortest path from one node to all other nodes in a network. More specifically, we seek to advance the state-of-the-art of computer implementation technology for such algorithms and the problems they solve by examining the effect of innovative computer science list structures and labeling techniques on algorithmic performance. The study shows that the procedures examined indeed exert a powerful influence on solution efficiency, with the identity of the best dependent upon the topology of the network and the range of the arc distance coefficients. The study further discloses that the shortest path algorithm previously documented as the most efficient is dominated for all problem structures by the new methods, which are sometimes an order of magnitude faster. (Author)

A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees.

Using an idea proposed independently by Quandt and Schneider, the paper declares mode choice to be a special instance of route choice. It describes a (non-logit) model which includes in its route-choice mechanism the decision variables traditionally associated with mode choice. With the assumption that each traveller selects the route which minimizes his own personal linear choice function, it is clear that the routes with a nonzero chance of being picked are only those not dominated by any other path (e.g. are not both costlier and longer than any other path). The precise probability of a route being chosen is just the integral over the appropriate portion of the probability density of the coefficients of the choice function. The integration limits are implied by the amount of each disutility on each of the undominated routes. An algorithm is given which is quite efficient in finding these paths in a large and complex multimodal network.

A model and algorithm for multicriteria route-mode choice

This short note presents a formal description of a fast and robust shortest path algorithm. Modeled on an algorithm of Pape (1974), it requires less memory store than most algorithms and at the same time permits arc lengths to range between -x and +x. It is described in a machine processable language called SDL. The note opens with a brief introduction to SDL syntax. (Author/TRRL)

Shortest path forest with topological ordering: An algorithm description in SDL

Urban transportation planning models consume untold hours of computer time building zillions of min-path trees. Their networks have tens of thousands of arcs, accommodate several trip classes, and solve the traffic equilibrium problem via many, many iterations of min-path calculations for thousands of origins and destinations. This paper presents a simple algorithm that couples restricted reduced-cost analysis with label-correcting, which can reduce this min-path tree building time substantially. For a given origin, the algorithm rapidly transforms a tree for one class to that for next class. Test results using synthetic data suggest that its application to real networks should experience speedups of at least a factor of 2.0 and perhaps beyond 5.0.

Robert B. Dial

Papers

A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration

A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees.

A model and algorithm for multicriteria route-mode choice

Shortest path forest with topological ordering: An algorithm description in SDL

An Efficient Algorithm for Building Min-Path Trees for all Origins in a Multi-Class Network