An approximation algorithm for the k-fixed depots problem.
Aristotelis GiannakosMhand HifiR. KheffacheRachid OuafiPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- experimental evaluation
- times faster
- detection algorithm
- theoretical analysis
- computational complexity
- preprocessing
- significant improvement
- improved algorithm
- computationally efficient
- simulated annealing
- computational cost
- k means
- fixed size
- high accuracy
- input data
- recognition algorithm
- segmentation algorithm
- objective function
- convergence rate
- error bounds
- learning algorithm
- error tolerance
- approximation ratio
- neural network
- combinatorial optimization
- matching algorithm
- monte carlo
- clustering method
- particle swarm optimization
- scheduling problem
- evolutionary algorithm
- search space
- optimal solution