Efficient modeling of travel in networks with time-varying link speeds

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0037(200009)36:2<80::AID-NET2>3.0.CO;2-B" /><80::AID-NET2>3.0.CO;2-B 10.1002/1097-0037(200009)36:2<80::AID-NET2>3.0.CO;2-BzbMath0971.90009OpenAlexW2036888763MaRDI QIDQ4519129

Mark E. T. Horn

Publication date: 8 November 2001

Full work available at URL: https://doi.org/10.1002/1097-0037(200009)36:2<80::aid-net2>3.0.co;2-b

zbMATH Keywords

vehicle routingvehicle schedulinglabel-setting algorithmtime-dependent networksfasted paths

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (12)

A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times ⋮ A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem ⋮ The traveling purchaser problem with time-dependent quantities ⋮ Time-dependent routing problems: a review ⋮ Ambulance location and relocation problems with time-dependent travel times ⋮ Online vehicle routing and scheduling with dynamic travel times ⋮ Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows ⋮ A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling ⋮ Shortest paths in piecewise continuous time-dependent networks ⋮ Finding least fuel emission paths in a network with time-varying speeds ⋮ On-Line Vehicle Routing and Scheduling With Time-Varying Travel Speeds ⋮ Vehicle routing and scheduling with dynamic travel times

Cites Work

• A note on two problems in connexion with graphs
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• Shortest-path algorithms: Taxonomy and annotation
• Minimum weight paths in time-dependent networks
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• Shortest paths with euclidean distances: An explanatory model
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: Efficient modeling of travel in networks with time-varying link speeds