Speed-up Heuristic for an On-Demand Ride-Pooling Algorithm.
Roman EngelhardtFlorian DandlKlaus BogenbergerPublished in: CoRR (2020)
Keyphrases
- optimal solution
- running times
- experimental evaluation
- learning algorithm
- cost function
- dynamic programming
- k means
- high accuracy
- matching algorithm
- depth first search
- greedy heuristic
- np hard
- recognition algorithm
- times faster
- improved algorithm
- combinatorial optimization
- optimization algorithm
- convergence rate
- bin packing
- input data
- computational cost
- neural network
- genetic algorithm
- packing problem
- optimal or near optimal
- solution quality
- extremal optimization
- benchmark problems
- convex hull
- path planning
- tabu search
- detection algorithm
- theoretical analysis
- expectation maximization
- particle swarm optimization
- simulated annealing
- worst case
- objective function