A dynamic programming based heuristic for locating stops in public transportation networks.
Benjamin OttoNils BoysenPublished in: Comput. Ind. Eng. (2014)
Keyphrases
- dynamic programming
- transportation networks
- traveling salesman problem
- road network
- dynamic programming algorithms
- travel time
- stereo matching
- lagrangian relaxation
- network design problem
- travel cost
- exhaustive search
- linear programming
- combinatorial optimization
- state space
- greedy algorithm
- dp matching
- reinforcement learning
- coarse to fine
- optimal policy
- shortest path
- knapsack problem
- feasible solution
- mixed integer programming
- error rate
- cost function
- search algorithm
- neural network