An algorithm to compute time-balanced clusters for the delivery logistics problem.
Adriana Menchaca-MendezElizabeth MonteroMarisol Flores-GarridoLuis Miguel AntonioPublished in: Eng. Appl. Artif. Intell. (2022)
Keyphrases
- experimental evaluation
- computational cost
- dynamic programming
- cost function
- k means
- detection algorithm
- input data
- high accuracy
- preprocessing
- search space
- np hard
- objective function
- learning algorithm
- optimization algorithm
- times faster
- matching algorithm
- subspace clustering
- particle swarm optimization
- expectation maximization
- data clustering
- clustering method
- probabilistic model
- segmentation algorithm
- worst case
- computational complexity
- similarity measure
- image segmentation