A Pseudo-Polynomial Time Algorithm for a Special Multiobjective Order Picking Problem.
Özgür ÖzpeynirciCansu KandemirPublished in: Int. J. Inf. Technol. Decis. Mak. (2015)
Keyphrases
- optimization algorithm
- computational complexity
- multi objective
- learning algorithm
- evolutionary algorithm
- worst case
- experimental evaluation
- objective function
- recognition algorithm
- detection algorithm
- linear programming
- np hard
- cost function
- dynamic programming
- computational cost
- probabilistic model
- significant improvement
- k means
- preprocessing
- special case
- simulated annealing
- particle swarm optimization
- search space
- matching algorithm
- differential evolution
- min cost