pith. sign in

arxiv: 1907.09651 · v1 · pith:6CZBIAMAnew · submitted 2019-07-23 · ⚛️ physics.soc-ph · math.OC

Integrating Travel Demand and Network Modelling: a Myth or Future of Transport Modelling

Ali Najmi , David Rey , Taha H. Rashidi , S. Travis Waller This is my paper

Pith reviewed 2026-05-24 17:21 UTC · model grok-4.3

classification ⚛️ physics.soc-ph math.OC
keywords supernetworktransport planning model systemactivity travel patternstraffic assignmentpublic transport capacitysplitting ratiosmulti-modalitytime-dependent network
0
0 comments X

The pith

A unified time-dependent supernetwork integrates activity choices, modes, times, parking and traffic assignment into one TPMS.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper formulates a Transport Planning Model System that places activity, sequence, mode, departure time and parking decisions inside a single time-dependent supernetwork. It adds an explicit capacitated public-transport layer and links the supernetwork to a traffic-assignment model through a set of splitting ratios. The structure is meant to keep the interdependencies among these choices intact while the network changes with time and congestion. A multi-visit routing formulation avoids enumerating repeated node visits. Numerical tests illustrate that the integrated system can reproduce observed patterns without running separate demand and supply modules.

Core claim

The central claim is that embedding all facets of activity-travel-pattern choice into a time-dependent supernetwork, formulating capacitated public transport explicitly, and connecting the supernetwork to assignment via splitting ratios produces a single model that respects the dynamic interdependencies among activity, mode, timing and route decisions.

What carries the argument

The time-dependent supernetwork that unifies activity-travel-pattern facets and is calibrated to assignment through splitting ratios.

If this is right

  • Dynamic congestion and time-of-day effects propagate directly into every choice dimension inside one structure.
  • Public-transport capacity limits are enforced at the same time as private-vehicle routing.
  • Multiple visits to the same location become feasible without exhaustive enumeration of paths.
  • Calibration to observed travel attributes occurs through a single set of splitting ratios rather than separate sub-models.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The approach could reduce the need for iterative feedback loops between demand and supply modules in large-scale planning studies.
  • If the splitting ratios prove stable across scenarios, the model might support faster evaluation of pricing or capacity policies that affect many choice dimensions simultaneously.
  • The same supernetwork construction might be adapted to include real-time information or stochastic travel times without rebuilding the entire choice set.

Load-bearing premise

The splitting ratios can spread trips across the supernetwork without erasing the interdependencies the model claims to preserve.

What would settle it

Run the integrated model and a set of separate demand-then-assignment models on the same survey data; if the joint distributions of activity, mode and departure time differ by less than sampling error, the unification adds no new information.

read the original abstract

In this paper, a novel transport planning model system (TPMS) is formulated which is built on the concepts of supernetworks, multi-modality, integrity and calibration. In the proposed formulation, activity travel pattern (ATP) choice facets including the choices of activity, activity sequence, mode, departure time, and parking location, are all unified into a time-dependent supernetwork. The proposed model accounts for the dynamicity of the network, including time-of-day and congestion effects. These help capturing the interdependencies among all different attributes of a full transport planning system. Moreover, the proposed TPMS explicitly formulates an operating capacitated public transport system. To allow visiting locations multiple times and to alleviate the complexity of the proposed supernetwork, a novel multi-visit vehicle routing problem is proposed which does not enumerate the node and link visits. In order to calibrate the model based on the major travel attributes of the travel survey data, a set of splitting ratios are introduced to distribute trips on the supernetwork. The model uses the splitting ratios to integrate the supernetwork and the traffic assignment model in a unified TPMS structure. At last, numerical examples are provided to demonstrate the advantages of the proposed approach.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper proposes a Transport Planning Model System (TPMS) that unifies activity travel pattern (ATP) choices—activity, sequence, mode, departure time, and parking—into a time-dependent supernetwork, explicitly formulates an operating capacitated public transport system, introduces a non-enumerative multi-visit vehicle routing problem to handle multiple visits, and introduces splitting ratios both to calibrate the model to travel survey data and to integrate the supernetwork with traffic assignment in a single unified structure. Numerical examples are provided to illustrate the approach.

Significance. If the splitting ratios can be shown not to override the interdependencies enforced by the supernetwork and capacitated PT formulation, and if the numerical examples are augmented with validation metrics, the TPMS could advance integrated transport modeling by offering a single time-dependent structure that captures dynamic network effects across multiple choice dimensions.

major comments (2)
  1. [Abstract] Abstract: The splitting ratios are introduced 'to calibrate the model based on the major travel attributes of the travel survey data' and 'to integrate the supernetwork and the traffic assignment model'. Because these ratios are fitted quantities whose justification is not derived from the supernetwork itself, they risk prescribing trip distributions directly and thereby rendering the claimed unification via dynamic and capacity constraints secondary rather than load-bearing.
  2. [Abstract] Abstract: The numerical examples are stated to 'demonstrate the advantages of the proposed approach', yet no validation metrics, error analysis, comparison against existing integrated models, or derivation details for the integration step are supplied, leaving the central claim without empirical grounding.
minor comments (1)
  1. [Abstract] The abstract lists 'integrity and calibration' among the foundational concepts but provides no elaboration on how integrity of the unified structure is preserved once splitting ratios are applied.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments on our manuscript proposing the TPMS. We respond to each major comment below, clarifying the role of splitting ratios and the scope of the numerical examples while indicating revisions where appropriate.

read point-by-point responses

  1. Referee: [Abstract] Abstract: The splitting ratios are introduced 'to calibrate the model based on the major travel attributes of the travel survey data' and 'to integrate the supernetwork and the traffic assignment model'. Because these ratios are fitted quantities whose justification is not derived from the supernetwork itself, they risk prescribing trip distributions directly and thereby rendering the claimed unification via dynamic and capacity constraints secondary rather than load-bearing.

    Authors: The splitting ratios serve as a calibration mechanism to align aggregate flows with observed survey attributes (e.g., mode and activity shares) at designated supernetwork nodes. They do not prescribe individual trip distributions; instead, they initialize flows that are then subject to the full time-dependent supernetwork topology, dynamic link costs, and explicit capacity constraints on public transport. These constraints enforce interdependencies across activity sequence, mode, departure time, and parking choices. We will revise the methodology section to include an explicit demonstration (via additional equations or a small illustrative sub-network) showing that the dynamic and capacity constraints remain the primary load-bearing elements after ratio application. revision: partial

  2. Referee: [Abstract] Abstract: The numerical examples are stated to 'demonstrate the advantages of the proposed approach', yet no validation metrics, error analysis, comparison against existing integrated models, or derivation details for the integration step are supplied, leaving the central claim without empirical grounding.

    Authors: The numerical examples are intended as illustrations of the unified structure, the non-enumerative multi-visit VRP, and the splitting-ratio integration rather than as a full empirical validation. We agree that the absence of quantitative metrics and derivation details weakens the presentation. In revision we will expand the examples section with derivation details for the integration step, basic error measures (e.g., deviation from survey aggregates), and a clearer statement of the examples' illustrative purpose. A comprehensive benchmark against other integrated models lies outside the scope of this framework-proposal paper but will be noted as future research. revision: yes

Circularity Check

1 steps flagged

Splitting ratios fitted to survey data perform the claimed integration by construction

specific steps
  1. fitted input called prediction [Abstract]
    "In order to calibrate the model based on the major travel attributes of the travel survey data, a set of splitting ratios are introduced to distribute trips on the supernetwork. The model uses the splitting ratios to integrate the supernetwork and the traffic assignment model in a unified TPMS structure."

    Splitting ratios are calibrated/fitted to survey data to distribute trips; the paper then states these same ratios are what integrate the supernetwork with traffic assignment to create the 'unified TPMS structure.' The unification therefore holds by construction of the fitted inputs rather than by the time-dependent supernetwork or capacitated PT formulation enforcing interdependencies among activity/sequence/mode/time/parking choices.

full rationale

The paper's central claim is a unified TPMS that integrates supernetwork (unifying ATP choices) with traffic assignment while preserving interdependencies. However, the abstract explicitly states that splitting ratios are introduced 'to calibrate the model based on the major travel attributes of the travel survey data' and that 'the model uses the splitting ratios to integrate the supernetwork and the traffic assignment model in a unified TPMS structure.' This makes the integration step reduce directly to fitted parameters calibrated to data, rather than emerging from the supernetwork formulation or capacity constraints themselves. No other circular patterns (self-citation chains, ansatzes, or renamings) are evident from the provided text.

Axiom & Free-Parameter Ledger

1 free parameters · 2 axioms · 2 invented entities

The claim rests on domain assumptions about supernetwork expressiveness and on the introduction of splitting ratios as calibration parameters without external benchmarks or independent evidence for the ratios themselves.

free parameters (1)
  • splitting ratios
    Introduced to distribute trips on the supernetwork and to calibrate the model to major travel attributes from survey data.
axioms (2)
  • domain assumption A time-dependent supernetwork can represent and unify all listed ATP choice facets (activity, sequence, mode, departure time, parking) while incorporating congestion and time-of-day effects.
    Invoked as the foundation for the proposed TPMS formulation.
  • domain assumption A multi-visit vehicle routing problem can be formulated without enumerating node and link visits.
    Stated as the mechanism to keep the supernetwork tractable while allowing repeated visits.
invented entities (2)
  • TPMS (transport planning model system) no independent evidence
    purpose: Single unified structure that merges supernetwork demand choices with dynamic assignment
    Newly proposed model system whose integration is achieved via the splitting ratios.
  • multi-visit vehicle routing problem (non-enumerative) no independent evidence
    purpose: Allow multiple location visits inside the supernetwork without combinatorial explosion
    Novel problem formulation introduced to support the supernetwork construction.

pith-pipeline@v0.9.0 · 5752 in / 1472 out tokens · 30624 ms · 2026-05-24T17:21:34.211882+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

57 extracted references · 57 canonical work pages

  1. [1]

    Springer US, Boston, MA, pp

    The Split Delivery Vehicle Routing Problem: A Survey, in: The Vehicle Routing Problem: Latest Advances and New Challenges. Springer US, Boston, MA, pp. 103–122. https://doi.org/10.1007/978-0-387-77778-8_5 Arentze, T., Timmermans, H., 2004a. A learning-based transportation oriented simulation system. Transp. Res. Part B Methodol. 38, 613–633. https://doi.o...

    work page doi:10.1007/978-0-387-77778-8_5 2002

  2. [2]

    Analysis, modeling and solution of the concrete delivery problem. Eur. J. Oper. Res. 193, 820–835. https://doi.org/10.1016/J.EJOR.2007.11.011 Auld, J., Hope, M., Ley, H., Sokolov, V., Xu, B., Zhang, K.,

    work page doi:10.1016/j.ejor.2007.11.011 2007

  3. [3]

    POLARIS: Agent-based modeling framework development and implementation for integrated travel demand and network and operations simulations. Transp. Res. Part C Emerg. Technol. 64, 101–116. https://doi.org/10.1016/J.TRC.2015.07.017 Bar-Gera, H., Boyce, D.,

    work page doi:10.1016/j.trc.2015.07.017 2015

  4. [4]

    Origin-based algorithms for combined travel forecasting models. Transp. Res. Part B Methodol. 37, 405–422. https://doi.org/10.1016/S0191-2615(02)00020-6 Berghman, L., Leus, R., Spieksma, F.C.R.,

    work page doi:10.1016/s0191-2615(02)00020-6

  5. [5]

    Optimal solutions for a dock assignment problem with trailer transportation. Ann. Oper. Res. 213, 3–25. https://doi.org/10.1007/s10479-011-0971-7 Bhat, C.R., Guo, J.Y., Srinivasan, S., Sivakumar, A.,

    work page doi:10.1007/s10479-011-0971-7

  6. [6]

    Urban Plan

    Is the Sequential Travel Forecasting Paradigm Counterproductive? J. Urban Plan. Dev. 128, 169–183. https://doi.org/10.1061/(ASCE)0733-9488(2002)128:4(169) Boyce, D., Bar-gera, H.,

    work page doi:10.1061/(asce)0733-9488(2002)128:4(169 2002

  7. [7]

    Networks Spat

    Multiclass Combined Models for Urban Travel Forecasting. Networks Spat. Econ. 4, 115–124. https://doi.org/10.1023/B:NETS.0000015659.39216.83 Cascetta, E., Nguyen, S.,

    work page doi:10.1023/b:nets.0000015659.39216.83

  8. [8]

    A unified framework for estimating or updating origin/destination matrices from traffic counts. Transp. Res. Part B Methodol. 22, 437–455. https://doi.org/10.1016/0191-2615(88)90024-0 Chow, J.Y.J.,

    work page doi:10.1016/0191-2615(88)90024-0

  9. [9]

    Activity-Based Travel Scenario Analysis with Routing Problem Reoptimization. Comput. Civ. Infrastruct. Eng. 29, 91–106. https://doi.org/10.1111/mice.12023 34 Chow, J.Y.J., Djavadian, S.,

    work page doi:10.1111/mice.12023

  10. [10]

    Activity-based Market Equilibrium for Capacitated Multimodal Transport Systems. Transp. Res. Procedia 7, 2–23. https://doi.org/10.1016/J.TRPRO.2015.06.001 Chow, J.Y.J., Liu, H.,

    work page doi:10.1016/j.trpro.2015.06.001 2015

  11. [11]

    Generalized Profitable Tour Problems for Online Activity Routing System. Transp. Res. Rec. J. Transp. Res. Board 2284, 1–9. https://doi.org/10.3141/2284-01 Chow, J.Y.J., Nurumbetova, A.E.,

    work page doi:10.3141/2284-01

  12. [12]

    A multi-day activity-based inventory routing model with space– time–needs constraints. Transp. A Transp. Sci. 11, 243–269. https://doi.org/10.1080/23249935.2014.958120 Chow, J.Y.J., Recker, W.W.,

    work page doi:10.1080/23249935.2014.958120 2014

  13. [13]

    Inverse optimization with endogenous arrival time constraints to calibrate the household activity pattern problem. Transp. Res. Part B Methodol. 46, 463–479. https://doi.org/10.1016/J.TRB.2011.11.005 Cools, M., Moons, E., Wets, G.,

    work page doi:10.1016/j.trb.2011.11.005 2011

  14. [14]

    Calibrating Activity-Based Models with External Origin- Destination Information: overview of possibilities. Transp. Res. Rec. J. Transp. Res. Board 2175, 98–110. https://doi.org/10.3141/2175-12 Cordeau, J.-F., Laporte, G., Savelsbergh, M.W.P., Vigo, D.,

    work page doi:10.3141/2175-12

  15. [15]

    North Holland

    Vehicle Routing, in: Handbooks in Operations Research and Management Science: Transportation. North Holland. https://doi.org/10.1016/S0927-0507(06)14006-2 Daganzo, C.F., Sheffi, Y.,

    work page doi:10.1016/s0927-0507(06)14006-2

  16. [16]

    On Stochastic Models of Traffic Assignment. Transp. Sci. 11, 253–274. https://doi.org/10.1287/trsc.11.3.253 Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.,

    work page doi:10.1287/trsc.11.3.253

  17. [17]

    Solution of a Large-Scale Traveling-Salesman Problem. Oper. Res. 2, 393–410. https://doi.org/10.1007/978-3-540-68279-0_1 de Cea, J., Fernández, J.E., Dekock, V., Soto, A.,

    work page doi:10.1007/978-3-540-68279-0_1

  18. [18]

    Solving network equilibrium problems on multimodal urban transportation networks with multiple user classes. Transp. Rev. 25, 293–317. https://doi.org/10.1080/0144164042000335805 Fu, X., Lam, W.H.K.,

    work page doi:10.1080/0144164042000335805

  19. [19]

    Transportation (Amst)

    A network equilibrium approach for modelling activity-travel pattern scheduling problems in multi-modal transit networks with uncertainty. Transportation (Amst). 41, 37–55. https://doi.org/10.1007/s11116-013-9470-9 Ghiani, G., Improta, G.,

    work page doi:10.1007/s11116-013-9470-9

  20. [20]

    An efficient transformation of the generalized vehicle routing problem. Eur. J. Oper. Res. 122, 11–17. https://doi.org/10.1016/S0377-2217(99)00073-9 Gonzales, E.J., Daganzo, C.F.,

    work page doi:10.1016/s0377-2217(99)00073-9

  21. [21]

    Morning commute with competing modes and distributed demand: User equilibrium, system optimum, and pricing. Transp. Res. Part B Methodol. 46, 1519–1534. https://doi.org/10.1016/J.TRB.2012.07.009 Hao, J.Y., Hatzopoulou, M., Miller, E.J.,

    work page doi:10.1016/j.trb.2012.07.009 2012

  22. [22]

    Integrating an Activity-Based Travel Demand Model with Dynamic Traffic Assignment and Emission Models. Transp. Res. Rec. J. Transp. Res. Board 2176, 1–13. https://doi.org/10.3141/2176-01 Hart, W.E., Watson, J.-P., Woodruff, D.L.,

    work page doi:10.3141/2176-01

  23. [23]

    Pyomo: modeling and solving mathematical programs in Python. Math. Program. Comput. 3, 219–260. https://doi.org/10.1007/s12532-011-0026-8 Jara-Díaz, S.R.,

    work page doi:10.1007/s12532-011-0026-8

  24. [24]

    Transportation (Amst)

    On the goods-activities technical relations in the time allocation theory. Transportation (Amst). 30, 245–260. https://doi.org/10.1023/A:1023936911351 Kang, J.E., Recker, W.,

    work page doi:10.1023/a:1023936911351

  25. [25]

    The location selection problem for the household activity pattern problem. Transp. Res. Part B Methodol. 55, 75–97. https://doi.org/10.1016/J.TRB.2013.05.003 Kinable, J., Wauters, T., Vanden Berghe, G.,

    work page doi:10.1016/j.trb.2013.05.003 2013

  26. [26]

    The concrete delivery problem. Comput. Oper. Res. 48, 53–68. https://doi.org/10.1016/J.COR.2014.02.008 35 Konduri, K., Astroza, S., Sana, B., Pendyala, R., Jara-Díaz, S.,

    work page doi:10.1016/j.cor.2014.02.008 2014

  27. [27]

    Joint Analysis of Time Use and Consumer Expenditure Data. Transp. Res. Rec. J. Transp. Res. Board 2231, 53–60. https://doi.org/10.3141/2231-07 Konduri, K.C., Pendyala, R.M., Ahn, S., Kuby, M., Kaloush, K.,

    work page doi:10.3141/2231-07

  28. [28]

    INFOR Inf

    Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach. INFOR Inf. Syst. Oper. Res. 21, 61–75. https://doi.org/10.1080/03155986.1983.11731885 LeBlanc, L.J.,

    work page doi:10.1080/03155986.1983.11731885 1983

  29. [29]

    Transit system network design. Transp. Res. Part B Methodol. 22, 383–390. https://doi.org/10.1016/0191-2615(88)90042-2 Lenstra, J.K., Rinnooy Kan, A.H.G.,

    work page doi:10.1016/0191-2615(88)90042-2

  30. [30]

    Networks 11, 221–227

    Complexity of vehicle routing and scheduling problems. Networks 11, 221–227. https://doi.org/10.1002/net.3230110211 Liao, F., Arentze, T., Timmermans, H.,

    work page doi:10.1002/net.3230110211

  31. [31]

    Incorporating space–time constraints and activity-travel time profiles in a multi-state supernetwork approach to individual activity-travel scheduling. Transp. Res. Part B Methodol. 55, 41–58. https://doi.org/10.1016/J.TRB.2013.05.002 Liao, F., Arentze, T., Timmermans, H.,

    work page doi:10.1016/j.trb.2013.05.002 2013

  32. [32]

    Supernetwork Approach for Multimodal and Multiactivity Travel Planning. Transp. Res. Rec. J. Transp. Res. Board 2175, 38–46. https://doi.org/10.3141/2175-05 Liao, F., Arentze, T.A., Timmermans, H.J.P.,

    work page doi:10.3141/2175-05

  33. [33]

    Constructing personalized transportation networks in multi-state supernetworks: a heuristic approach. Int. J. Geogr. Inf. Sci. 25, 1885–1903. https://doi.org/10.1080/13658816.2011.556119 Lin, D.-Y., Eluru, N., Waller, S.T., Bhat, C.R., 2008a. Integration of Activity-Based Modeling and Dynamic Traffic Assignment. Transp. Res. Rec. J. Transp. Res. Board 207...

    work page doi:10.1080/13658816.2011.556119 1903

  34. [34]

    Network-oriented household activity pattern problem for system optimization. Transp. Res. Part C Emerg. Technol. 94, 250–269. https://doi.org/10.1016/J.TRC.2017.09.006 Liu, J., Zhou, X.,

    work page doi:10.1016/j.trc.2017.09.006 2017

  35. [35]

    Capacitated transit service network design with boundedly rational agents. Transp. Res. Part B Methodol. 93, 225–250. https://doi.org/10.1016/J.TRB.2016.07.015 Liu, P., Liao, F., Huang, H.-J., Timmermans, H.,

    work page doi:10.1016/j.trb.2016.07.015 2016

  36. [36]

    Dynamic activity-travel assignment in multi-state supernetworks. Transp. Res. Part B Methodol. 81, 656–671. https://doi.org/10.1016/J.TRB.2015.08.006 Lu, C.-C., Liu, J., Qu, Y., Peeta, S., Rouphail, N.M., Zhou, X.,

    work page doi:10.1016/j.trb.2015.08.006 2015

  37. [37]

    Eco-system optimal time-dependent flow assignment in a congested network. Transp. Res. Part B Methodol. 94, 217–239. https://doi.org/10.1016/J.TRB.2016.09.015 Lundgren, J.T., Peterson, A.,

    work page doi:10.1016/j.trb.2016.09.015 2016

  38. [38]

    A heuristic for the bilevel origin–destination-matrix estimation problem. Transp. Res. Part B Methodol. 42, 339–354. https://doi.org/10.1016/J.TRB.2007.09.005 Maghrebi, M., Rey, D., Waller, S.T., Sammut, C.,

    work page doi:10.1016/j.trb.2007.09.005 2007

  39. [39]

    Frequency optimization in public transportation systems: Formulation and metaheuristic approach. Eur. J. Oper. Res. 236, 27–36. https://doi.org/10.1016/J.EJOR.2013.11.007 Miller, E., Roorda, M.,

    work page doi:10.1016/j.ejor.2013.11.007 2013

  40. [40]

    Prototype Model of Household Activity-Travel Scheduling. Transp. Res. Rec. J. Transp. Res. Board 1831, 114–121. https://doi.org/10.3141/1831-13 Nagurney, A., Dong, J.,

    work page doi:10.3141/1831-13

  41. [41]

    Urban Location and Transportation in the Information Age: A Multiclass, Multicriteria Network Equilibrium Perspective. Environ. Plan. B Plan. Des. 29, 53–74. https://doi.org/10.1068/b2782 Najmi, A., Duell, M., Ghasri, M., Rashidi, T.H., Waller, S.T., 2018a. How Should Travel Demand and Supply Models Be Jointly Calibrated? Transp. Res. Rec. J. Transp. Res....

    work page doi:10.1068/b2782

  42. [42]

    Using Lagrangian Relaxation to Solve Ready Mixed Concrete Dispatching Problems. Transp. Res. Rec. J. Transp. Res. Board 2498, 84–90. https://doi.org/10.3141/2498-10 Noon, C.E., Bean, J.C.,

    work page doi:10.3141/2498-10

  43. [43]

    A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem. Oper. Res. 39, 623–632. https://doi.org/10.1287/opre.39.4.623 Ouyang, L.Q., Lam, W.H.K., Li, Z.C., Huang, D.,

    work page doi:10.1287/opre.39.4.623

  44. [44]

    Network User Equilibrium Model for Scheduling Daily Activity Travel Patterns in Congested Networks. Transp. Res. Rec. J. Transp. Res. Board 2254, 131–139. https://doi.org/10.3141/2254-14 Parsons Brinckerhoff,

    work page doi:10.3141/2254-14

  45. [45]

    New York Metropolitan Transportation Council (NYMTC), prepared by Parsons Brinckerhoff

    2010 Base Year Update and Validation of the NYMTC. New York Metropolitan Transportation Council (NYMTC), prepared by Parsons Brinckerhoff. Parsons Brinckerhoff,

    work page 2010

  46. [46]

    Florida Activity Mobility Simulator: Overview and Preliminary Validation Results. Transp. Res. Rec. J. Transp. Res. Board 1921, 123–130. https://doi.org/10.3141/1921-14 Pinjari, A.R., Bhat, C.R.,

    work page doi:10.3141/1921-14 1921

  47. [47]

    New mathematical models of the generalized vehicle routing problem and extensions. Appl. Math. Model. 36, 97–107. https://doi.org/10.1016/J.APM.2011.05.037 Powell, W.B., Sheffi, Y.,

    work page doi:10.1016/j.apm.2011.05.037 2011

  48. [48]

    The Convergence of Equilibrium Algorithms with Predetermined Step Sizes. Transp. Sci. 16, 45–55. https://doi.org/10.1287/trsc.16.1.45 Ramadurai, G., Ukkusuri, S.,

    work page doi:10.1287/trsc.16.1.45

  49. [49]

    Networks Spat

    Dynamic User Equilibrium Model for Combined Activity-Travel Choices Using Activity-Travel Supernetwork Representation. Networks Spat. Econ. 10, 273–292. https://doi.org/10.1007/s11067-008-9078-3 Recker, W..,

    work page doi:10.1007/s11067-008-9078-3

  50. [50]

    The household activity pattern problem: General formulation and solution. Transp. Res. Part B Methodol. 29, 61–77. https://doi.org/10.1016/0191-2615(94)00023-S Recker, W., Duan, J., Wang, H.,

    work page doi:10.1016/0191-2615(94)00023-s

  51. [51]

    Development of an Estimation Procedure for an Activity-Based 37 Travel Demand Model. Comput. Civ. Infrastruct. Eng. 23, 483–501. https://doi.org/10.1111/j.1467-8667.2008.00555.x Recker, W.W.,

    work page doi:10.1111/j.1467-8667.2008.00555.x 2008

  52. [52]

    A bridge between travel demand modeling and activity-based travel analysis. Transp. Res. Part B Methodol. 35, 481–506. https://doi.org/10.1016/S0191-2615(00)00006-0 Resat, H.G., Turkay, M.,

    work page doi:10.1016/s0191-2615(00)00006-0

  53. [53]

    Design and operation of intermodal transportation network in the Marmara region of Turkey. Transp. Res. Part E Logist. Transp. Rev. 83, 16–33. https://doi.org/10.1016/J.TRE.2015.08.006 Roorda, M.J., Miller, E.J., Habib, K.M.N.,

    work page doi:10.1016/j.tre.2015.08.006 2015

  54. [54]

    Validation of TASHA: A 24-h activity scheduling microsimulation model. Transp. Res. Part A Policy Pract. 42, 360–375. https://doi.org/10.1016/J.TRA.2007.10.004 Savelsbergh, M.W.P.,

    work page doi:10.1016/j.tra.2007.10.004 2007

  55. [55]

    Local search in routing problems with time windows. Ann. Oper. Res. 4, 285–305. https://doi.org/10.1007/BF02022044 Sheffi, Y.,

    work page doi:10.1007/bf02022044

  56. [56]

    A maximum likelihood model for estimating origin-destination matrices. Transp. Res. Part B Methodol. 21, 395–412. https://doi.org/10.1016/0191-2615(87)90037-3 Wahba, M., Shalaby, A.,

    work page doi:10.1016/0191-2615(87)90037-3

  57. [57]

    Transportation (Amst)

    Learning-based framework for transit assignment modeling under information provision. Transportation (Amst). 41, 397–417. https://doi.org/10.1007/s11116-013- 9510-5

    work page doi:10.1007/s11116-013-