Heinz Spiess’s research while affiliated with Université de Montréal and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (8)


Deterministic Time Table Transit Assignment
  • Chapter

January 2002

·

83 Reads

·

10 Citations

Isabelle Constantin

·

·

Heinz Spiess

The basic timetable based assignment problem is to find an optimal path for a passenger, given an origin node, a destination node, and departure or arrival time information. The deterministic transit assignment does not necessarily minimize the total elapsed travel time, but rather uses weight factors and non-time-based cost elements in determining the optimal path. Therefore, the algorithm tracks both time (to determine the feasibility of a path) and cost (to determine the attractiveness of a path).


Strategic planning of freight transportation: STAN, an interactive-graphic system
  • Article
  • Full-text available

January 1990

·

430 Reads

·

112 Citations

Transportation Research Record Journal of the Transportation Research Board

STAN is an interactive-graphic system for national or regional strategic planning of multimode multiproduct transportation systems. Briefly described are the general concepts underlying the system, the data base structure, the assignment procedures, and the results. Data and results from an actual application are used to illustrate these concepts.

Download

Optimal Strategies: A New Assignment Model for Transit Networks

April 1989

·

4,803 Reads

·

772 Citations

Transportation Research Part B Methodological

We describe a model for the transit assignment problem with a fixed set of transit lines. The traveler chooses the strategy that allows him or her to reach his or her destination at minimum expected cost. First we consider the case in which no congestion effects occur. For the special case in which the waiting time at a stop depends only on the combined frequency, the problem is formulated as a linear programming problem of a size that increases linearly with the network size. A label-setting algorithm is developed that solves the latter problem in polynomial time. Nonlinear cost extensions of the model are considered as well.


An efficient implementation of the PARTAN variant of the linear approximation method for network equilibrium problem

January 1987

·

143 Reads

·

92 Citations

The PARTAN variant of the linear approximation method is adapted for solving the network equilibrium problem. A simple and efficient algorithm is stated. Its properties are analyzed by using algebraic and geometric approaches. Its computational efficiency on small and large scale problems is compared to that of the linear approximation method.


On Binary Mode Choice/Assignment Models

February 1983

·

29 Reads

·

77 Citations

Transportation Science

The paper considers the two mode equilibrium road and transit assignment model which incorporates a zonal aggregate mode choice model. The paper reformulates this special structure network equilibrium model as a variational inequality and demonstrates that the origin to destination demands and travel costs, link flows and link travel costs are unique when appropriate sufficient conditions are satisfied. The existence of equivalent optimization formulations of special versions of this problem are demonstrated.


The Convergence of Diagonalization Algorithms for Fixed Demand Asymmetric Network Equilibrium Problems

December 1982

·

73 Reads

·

131 Citations

Transportation Research Part B Methodological

We provide a sufficient condition for the convergence of diagonalization algorithms for equilibrium traffic assignment problems with asymmetric Jacobian matrix B(v) of the link user cost mapping s(v) of the flow v. When , where D(v*) > 0 is the diagonal of B(v*) and v* is the equilibrium flow, we demonstrate a local convergence theorem for nonlinear cost functions. The implication of this result for practical applications of the model are outlined.



Urban transportation planning using interactive graphics

19 Reads

A. Babin

·

·

L. James-Lefebvre

·

[...]

·

L. D. Gallio

The following are discussed: EMME/2--interactive graphic method for road and transit planning; Jeffries freeway corridor transit design project by using the IGTD system; Applications of interactive graphics in urban transit analysis; Mapping origin-destination patterns in space and time by using interactive graphics; Graphical and mathematical methods in the analysis of urban gasoline consumption.

Citations (7)


... For a comprehensive overview of schedule-based assignment models, refer to Nuzzolo and Crisalli (2004) literature review. It covers deterministic network loading models in works like Carraresi et al. (1996), Nguyen et al. (2001), and Constantin et al. (2002), as well as stochastic network loading approaches in other studies (Cascetta et al., 1996;Crisalli, 1999;Nuzzolo & Crisalli, 1997;. Additionally, schedulebased mode-run choice models are applied in urban and regional settings, for instance in Nielsen and Frederiksen (1970) and Crisalli and Rosati (2004), to explore transit system path choices. ...

Reference:

Estimating Schedule-Based Assignment Models for High-Speed Rail (HSR) Services Using Multiple Data Sources
Deterministic Time Table Transit Assignment
  • Citing Chapter
  • January 2002

... Output from the model include traffic volume, travel speed, and travel time for each link. Detailed information about the program can be found in [34,35]. Among many available assignment tools provided in EMME4, second line approximation (SOLA) assignment was used in this study. ...

EMME/2: Interactive graphic method for road and transit planning
  • Citing Article
  • January 1982

Transportation Research Record Journal of the Transportation Research Board

... STraM is based on the multimodal transport network design modeling framework STAN (Crainic et al., 1990a). To this starting point, we add two aspects that have not traditionally been included in national freight transport models, but that are crucial for strategic planning of transport systems decarbonization. ...

Strategic planning of freight transportation: STAN, an interactive-graphic system

Transportation Research Record Journal of the Transportation Research Board

... The UE traffic assignment problem (UE-TAP) can be formulated as a convex nonlinear program [16] and solved by the Frank-Wolfe algorithm [17]. However, owing to the classical method's high complexity and limited efficiency, three main streams of solution algorithms have emerged: link-based algorithms [18][19][20], bush-based methods [21][22][23], and path-based algorithms [24][25][26]. More recently, parallel computing strategies have been explored to enhance both efficiency and scalability in solving UE-TAP [27][28][29][30][31]. ...

An efficient implementation of the PARTAN variant of the linear approximation method for network equilibrium problem

... The underlying graph used in assignment models either represents the network in terms of the connections between stations and their respective frequencies, or using a time-dependent graph where each connection corresponds to a specific trip-segment which is in the service of a certain line. These two representations correspond to frequency-based -which was formulated and solved as a linear problem by [SF89] -and schedule-based assignment models -formulated first by [NRC01], respectively. The interested reader may refer to [GFH + 16] for a review of the fundamentals of public transport assignment modeling. ...

Optimal Strategies: A New Assignment Model for Transit Networks

Transportation Research Part B Methodological

... Other classic works that analyze the formulation of the equilibrium problem, the uniqueness of the solution and the solution algorithm are Dafermos [9,15], Florian and Spiess [16], Fisk and Nguyen [17], Fisk and Boyce [18], Nagurney [19], Hammond [20], Nguyen and Dupuis [21], Marcotte and Guelatt [22], and Auchmuty [23]. More recent analyses, focusing for the most part on the design, implementation, and comparison of solution algorithms for the trafc assignment problem, including cases with asymmetric interactions, are found in Chen et al. [24], Panicucci et al. [25], and Sancho et al. [26]. ...

The Convergence of Diagonalization Algorithms for Fixed Demand Asymmetric Network Equilibrium Problems
  • Citing Article
  • December 1982

Transportation Research Part B Methodological