论文信息 - Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem - 字舞流文

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

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 refini...

Natashia Boland | Mike Hewitt | Martin W. P. Savelsbergh | Luke Marshall

[1] Amelia Regan,et al. On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints , 2009, Comput. Ind. Eng..

[2] Amelia C. Regan,et al. Local truckload pickup and delivery with hard time window constraints , 2002 .

[3] Thomas L. Magnanti,et al. Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[4] Martin W. P. Savelsbergh,et al. The price of discretizing time: a study in service network design , 2019, EURO J. Transp. Logist..

[5] Nicole Wieberneit,et al. Service network design for freight transportation: a review , 2007, OR Spectr..

[6] Martin W. P. Savelsbergh,et al. The Continuous-Time Service Network Design Problem , 2017, Oper. Res..

[7] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .

[8] Teodor Gabriel Crainic,et al. Service network design in freight transportation , 2000, Eur. J. Oper. Res..

[9] Sanjeeb Dash,et al. A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows , 2012, INFORMS J. Comput..