Problem decomposition for traffic diversions

DOI10.1007/978-3-540-24664-0_24MaRDI QIDQ5713884zbMATH OpenOpenAlexFDO

Authors Quanshi Xia, Andrew Eremin, Mark Wallace

Publication date 27 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b96957

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Traffic problems in operations research (90B20) Combinatorial optimization (90C27)

Recommendations

• Solving multi-objective traffic assignment
• A convergent and efficient decomposition method for the traffic assignment problem
• scientific article; zbMATH DE number 3906199
• scientific article; zbMATH DE number 1488064
• Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
• scientific article; zbMATH DE number 89095
• A dual scheme for traffic assignment problems
• Decomposition techniques for the minimum toll revenue problem
• Methods for solving road network problems with disruptions

Cited in

(5)

• Constraint programming and operations research
• Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
• Logic-based Benders decomposition for large-scale optimization
• scientific article; zbMATH DE number 3906199 (Why is no real title available?)
• An integrated method for planning and scheduling to minimize tardiness

This page was built for publication: Problem decomposition for traffic diversions

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