Dynamic programming based metaheuristics for the dial-a-ride problem.
Ulrike RitzingerJakob PuchingerRichard F. HartlPublished in: Ann. Oper. Res. (2016)
Keyphrases
- dynamic programming
- variable neighborhood search
- metaheuristic
- combinatorial optimization
- tabu search
- state space
- linear programming
- optimization problems
- optimal control
- dp matching
- column generation
- greedy algorithm
- markov decision processes
- stereo matching
- optimization method
- particle swarm optimization
- traveling salesman problem
- path relinking
- solution space
- special case
- genetic algorithm
- ant colony optimization
- dynamic programming algorithms
- single machine scheduling problem
- minimum spanning tree
- hybrid method
- reinforcement learning
- coarse to fine
- knapsack problem
- simulated annealing
- linear program
- routing problem
- sequence alignment
- single machine
- information systems