Optimising waiting at nodes in time-dependent networks: cost functions and applications
From MaRDI portal
Publication:1949565
DOI10.1007/s10957-012-0121-7zbMath1262.90185OpenAlexW1968569776MaRDI QIDQ1949565
Antonino Vitetta, Antonio Polimeni
Publication date: 8 May 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0121-7
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Travel time reliability in vehicle routing and scheduling with time windows
- Least possible time paths in stochastic, time-varying networks.
- Dynamic vehicle routing using genetic algorithms
- Shortest paths in time-dependent FIFO networks
- Shortest paths in piecewise continuous time-dependent networks
- Solving the \(k\)-shortest path problem with time windows in a time varying network
- The shortest route through a network with time-dependent internodal transit times
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- Ant colony system for a dynamic vehicle routing problem
- The Truck Dispatching Problem
- Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
- Reverse assignment: calibrating link cost functions and updating demand from traffic counts and time measurements
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- What you should know about the vehicle routing problem
- Dynamic shortest paths minimizing travel times and costs
- An Appraisal of Some Shortest-Path Algorithms
This page was built for publication: Optimising waiting at nodes in time-dependent networks: cost functions and applications
