Pages that link to "Item:Q1614046"

The following pages link to Computational study of state-of-the-art path-based traffic assignment algorithms (Q1614046):

Displaying 15 items.

• A modified gradient projection algorithm for solving the elastic demand traffic assignment problem (Q337015) (← links)
• A framework for and empirical study of algorithms for traffic assignment (Q337346) (← links)
• A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost (Q636547) (← links)
• An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem (Q652866) (← links)
• A turning restriction design problem in urban road networks (Q976491) (← links)
• Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model (Q1027595) (← links)
• Solving the combined modal split and traffic assignment problem with two types of transit impedance function (Q1752876) (← links)
• A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem (Q1761957) (← links)
• An \(N\)-path user equilibrium for transportation networks (Q1991373) (← links)
• Modeling mode and route similarities in network equilibrium problem with go-green modes (Q2357861) (← links)
• Issues in the implementation of the DSD algorithm for the traffic assignment problem (Q2433525) (← links)
• A path-based double projection method for solving the asymmetric traffic network equilibrium problem (Q2458917) (← links)
• A bi-objective turning restriction design problem in urban road networks (Q2514872) (← links)
• Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size (Q2669769) (← links)
• Day-to-day signal retiming scheme for single-destination traffic networks based on a flow splitting approach (Q6147917) (← links)