Optimising waiting at nodes in time-dependent networks: cost functions and applications
From MaRDI portal
Publication:1949565
DOI10.1007/S10957-012-0121-7zbMATH Open1262.90185OpenAlexW1968569776MaRDI QIDQ1949565FDOQ1949565
Authors: Antonio Polimeni, Antonino Vitetta 
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
Recommendations
- Algorithms for minimum-cost paths in time-dependent networks with waiting policies
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Minimum weight paths in time-dependent networks
- scientific article; zbMATH DE number 6913891
- Time-varying shortest path problems with constraints
Cites Work
- Title not available (Why is that?)
- Least possible time paths in stochastic, time-varying networks.
- The truck dispatching problem
- Least expected time paths in stochastic, time-varying transportation networks
- Title not available (Why is that?)
- Travel time reliability in vehicle routing and scheduling with time windows
- An Appraisal of Some Shortest-Path Algorithms
- Shortest paths in time-dependent FIFO networks
- The shortest route through a network with time-dependent internodal transit times
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Ant colony system for a dynamic vehicle routing problem
- What you should know about the vehicle routing problem
- Solving the \(k\)-shortest path problem with time windows in a time varying network
- Shortest paths in piecewise continuous time-dependent networks
- Dynamic vehicle routing using genetic algorithms
- Dynamic shortest paths minimizing travel times and costs
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- Reverse assignment: calibrating link cost functions and updating demand from traffic counts and time measurements
Cited In (7)
- Delay reduction via Lagrange multipliers in stochastic network optimization
- Algorithms for minimum-cost paths in time-dependent networks with waiting policies
- A biologically inspired optimization algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths
- Time-dependent shortest path problems with penalties and limits on waiting
- A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits
- Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
- Time analysis for planning a path in a time-window network
This page was built for publication: Optimising waiting at nodes in time-dependent networks: cost functions and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949565)
