• Publications
  • Influence
A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION. IN: THE AUTOMOBILE
  • R. Dial
  • Engineering, Mathematics
  • 1 June 1971
This paper presents a probabilistic assignment model that attempts to circumvent path enumeration. It assigns trips to all reasonable paths simultaneously, in such a way that the resulting effect isExpand
  • 717
  • 50
A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration
  • R. Dial
  • Computer Science
  • 1 December 2006
TLDR
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. Expand
  • 204
  • 25
Algorithm 360: shortest-path forest with topological ordering [H]
  • R. Dial
  • Computer Science
  • CACM
  • 1 November 1969
TLDR
row one of IL down the right edge of a strip of paper using the same spacing as for the observations. Expand
  • 373
  • 22
A MODEL AND ALGORITHM FOR MULTICRITERIA ROUTE-MODE CHOICE
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 itsExpand
  • 102
  • 14
Autonomous dial-a-ride transit introductory overview
Abstract This paper introduces a modernized version of many-to-few dial-a-ride called autonomous dial-a-ride transit (ADART), which employs fully-automated order-entry and routing-and-schedulingExpand
  • 101
  • 11
A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles
In this paper, we describe a computerized procedure for scheduling mass transit crews and vehicles. The procedure differs from previous methods in that rather than first scheduling vehicles and thenExpand
  • 119
  • 10
A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
Abstract Dynamic programming (DP) algorithms for the traveling salesman problem (TSP) can easily incorporate time dependent travel times, time windows, and precedence relationships which presentExpand
  • 165
  • 9
Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
  • R. Dial
  • Mathematics, Computer Science
  • Transp. Sci.
  • 1 May 1996
TLDR
This paper describes a bicriterion equilibrium traffic assignment model that accurately forecasts path choices and consequent total arc flows for a stochastically diverse set of trips. Expand
  • 119
  • 9
A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
TLDR
This paper examines different algorithms for calculating shortest path from one node to all other nodes in a network by examining the effect of innovative computer science list structures and labeling techniques on algorithmic performance. Expand
  • 241
  • 7
Minimal-revenue congestion pricing part I: A fast algorithm for the single-origin case
  • R. Dial
  • Computer Science
  • 1 April 1999
TLDR
This paper derives a simple fast algorithm for computing minimal-revenue tolls in a single-origin network. Expand
  • 112
  • 5