An efficient algorithm for a bicriterion traffic assignment problem

MaRDI QIDQ4352985zbMATH OpenFDO

Authors P. Marcotte, Daoli Zhu

Publication date 4 September 1997

zbMATH Keywords

bicriterion traffic assignmentinfinite-dimensional formulationnetwork structure

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Recommendations

• Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
• Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
• An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues
• scientific article; zbMATH DE number 123800

Cited in

(9)

• Efficient implementation of heuristics for the continuous network design problem
• The efficiency of greedy best response algorithm in road traffic assignment
• Mathematical Considerations on the Relationship between the Ordering of players and Winning Probability in Certain Types of Team Sports
• scientific article; zbMATH DE number 5524119 (Why is no real title available?)
• scientific article; zbMATH DE number 123800 (Why is no real title available?)
• A dual scheme for traffic assignment problems
• A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow
• Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
• A unified gradient projection algorithm for solving both discrete and continuous multiclass bi-criteria traffic assignment problems

This page was built for publication: An efficient algorithm for a bicriterion traffic assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352985)