Finding \(K\) shortest looping paths with waiting time in a time--window network
From MaRDI portal
Publication:2504439
DOI10.1016/j.apm.2005.05.005zbMath1163.90387OpenAlexW2124626211MaRDI QIDQ2504439
Publication date: 25 September 2006
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2005.05.005
Related Items (4)
Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs ⋮ Shortest path problems with left-side time windows ⋮ Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms ⋮ Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction
Cites Work
- Unnamed Item
- The shortest path problem with forbidden paths
- An algorithm for ranking paths that may contain cycles
- An algorithm for the ranking of shortest paths
- Finding the first \(K\) shortest paths in a time-window network.
- Finding the \(k\) shortest paths in parallel
- Finding \(K\) shortest looping paths in a traffic-light network
- The first \(K\) shortest unique-arc walks in a traffic-light network
- An efficient algorithm for K shortest simple paths
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Data Structures and Computer Science Techniques in Operations Research
- Finding the k Shortest Paths
- An efficient implementation of an algorithm for findingK shortest simple paths
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- The first K minimum cost paths in a time-schedule network
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Fibonacci heaps and their uses in improved network optimization algorithms
- Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
- An Appraisal of Some Shortest-Path Algorithms
- Finding the K Shortest Loopless Paths in a Network
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
This page was built for publication: Finding \(K\) shortest looping paths with waiting time in a time--window network
