Dynamic system optimum simultaneous route and departure time choice problems: Intersection-movement-based formulations and comparisons
In this paper, the authors propose intersection-movement-based models to formulate dynamic system optimum simultaneous route and departure time choice (DSO-SRDTC) problems over general networks and compare the models with the link-based and path-based counterparts. Each of these three types of models has four variants, which are formed by whether to consider first-in-first-out (FIFO) constraints and non-vehicle holding (NVH) constraints. In all three types of DSO-SRDTC models and their variants, the link transmission model (LTM) is incorporated as their traffic flow model. The DSO-SRDTC problems without FIFO constraints are formulated as linear programming (LP) problems, while the DSO-SRDTC problems with FIFO constraints are formulated as non-convex non-linear programming problems. The authors find that existing link-based NVH constraints cannot completely eliminate vehicle holding (VH) solutions, and propose both intersection-movement-based and path-based NVH constraints, which can completely eliminate VH solutions. The authors also prove that the link-based, intersection-movement-based, and path-based models of DSO-SRDTC problems without FIFO constraints are equivalent in terms of obtaining the same optimal total system travel cost (TSTC). However, the three types of models for DSO-SRDTC problems with FIFO constraints can obtain different optimal TSTCs. Based on the solution properties of the DSO-SRDTC problems with FIFO constraints, branch-and-bound algorithms are modified to solve the DSO-SRDTC problems with FIFO constraints for global optima. Numerical examples are set up to demonstrate the properties and performance of the proposed models. To the best of their knowledge, the authors are the pioneers to provide intersection-movement-based formulations for DSO-SRDTC problems and analyze their mathematical properties.
- Record URL:
- Record URL:
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/issn/01912615
-
Supplemental Notes:
- © 2018 Elsevier Ltd. All rights reserved. Abstract reprinted with permission of Elsevier.
-
Authors:
- Long, Jiancheng
-
0000-0002-2256-622X
- Wang, Chao
- Szeto, W Y
-
0000-0001-7059-3532
- Publication Date: 2018-9
Language
- English
Media Info
- Media Type: Web
- Features: Appendices; Figures; References; Tables;
- Pagination: pp 166-206
-
Serial:
- Transportation Research Part B: Methodological
- Volume: 115
- Issue Number: 0
- Publisher: Elsevier
- ISSN: 0191-2615
- Serial URL: http://www.sciencedirect.com/science/journal/01912615
Subject/Index Terms
- TRT Terms: Branch and bound algorithms; Departure time; Dynamic traffic assignment; Intersections; Linear programming; Nonlinear programming; Route choice; Traffic flow; Travel costs
- Identifier Terms: Link Transmission Model
- Subject Areas: Highways; Operations and Traffic Management;
Filing Info
- Accession Number: 01727019
- Record Type: Publication
- Files: TRIS
- Created Date: Dec 30 2019 7:54PM