Railway timetabling: a maximum bottleneck path algorithm for finding an additional train path.
Fredrik LjunggrenKristian PerssonAnders PetersonChristiane SchmidtPublished in: Public Transp. (2021)
Keyphrases
- matching algorithm
- times faster
- theoretical analysis
- learning algorithm
- detection algorithm
- simulated annealing
- k means
- significant improvement
- experimental evaluation
- dynamic programming
- path length
- computational cost
- search space
- optimal path
- objective function
- path finding
- clustering algorithm
- shortest path
- selection algorithm
- segmentation algorithm
- particle swarm optimization
- high accuracy
- np hard
- optimal solution
- linear programming
- worst case
- path planning
- convex hull
- convergence rate
- lower bound
- similarity measure
- image segmentation
- scatter search
- minimum length
- method finds
- hamiltonian path