Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem

Luke Marshall; Natashia Boland; Martin Savelsbergh; Mike Hewitt

doi:10.1287/TRSC.2020.0994

Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem

Luke Marshall
, Natashia Boland
, Martin Savelsbergh
, Mike Hewitt

Quinlan School of Business

Microsoft
Georgia Institute of Technology

Research output: Contribution to journal › Article › peer-review

Original language	American English
Journal	Transportation Science
Volume	55
Issue number	1
DOIs	https://doi.org/10.1287/TRSC.2020.0994
State	Published - Jan 1 2021

Disciplines

Applied Mathematics
Computer Sciences

Access to Document

10.1287/TRSC.2020.0994License: Unspecified

Cite this

@article{fa74496c55b943358824001e7e2064e9,

title = "Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem",

author = "Luke Marshall and Natashia Boland and Martin Savelsbergh and Mike Hewitt",

note = "We introduce an effective and efficient iterative algorithm for solving the continuous-time service network design problem. The algorithm achieves its efficiency by carefully and dynamically refining partially time-expanded network models so that only a small number of small integer programs, defined over these networks, need to be solved.",

year = "2021",

month = jan,

day = "1",

doi = "10.1287/TRSC.2020.0994",

language = "American English",

volume = "55",

journal = "Transportation Science",

issn = "1526-5447",

number = "1",

}

TY - JOUR

T1 - Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem

AU - Marshall, Luke

AU - Boland, Natashia

AU - Savelsbergh, Martin

AU - Hewitt, Mike

N1 - We introduce an effective and efficient iterative algorithm for solving the continuous-time service network design problem. The algorithm achieves its efficiency by carefully and dynamically refining partially time-expanded network models so that only a small number of small integer programs, defined over these networks, need to be solved.

PY - 2021/1/1

Y1 - 2021/1/1

UR - https://pubsonline.informs.org/doi/10.1287/trsc.2020.0994

U2 - 10.1287/TRSC.2020.0994

DO - 10.1287/TRSC.2020.0994

M3 - Article

SN - 1526-5447

VL - 55

JO - Transportation Science

JF - Transportation Science

IS - 1

ER -

Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem

Disciplines

Access to Document

Other files and links

Cite this