A Many-to-One Algorithm to Solve a Many-to-Many Matching Problem for Routing.
Wenjing GuoWouter Beelaerts van BloklandRudy R. NegenbornPublished in: ICCL (2018)
Keyphrases
- matching algorithm
- experimental evaluation
- optimization algorithm
- learning algorithm
- computational complexity
- clustering method
- detection algorithm
- dynamic programming
- matching process
- times faster
- linear programming
- optimal solution
- recognition algorithm
- worst case
- segmentation algorithm
- image matching
- preprocessing
- k means
- genetic algorithm
- convergence rate
- combinatorial optimization
- ant colony optimization
- search space
- mobile robot
- significant improvement
- expectation maximization
- np hard
- high accuracy
- probabilistic model
- computational cost