A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing.
Katrin HeßlerStefan IrnichPublished in: Oper. Res. Lett. (2022)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- improved algorithm
- optimization algorithm
- learning algorithm
- similarity measure
- weighting coefficients
- exhaustive search
- convergence rate
- cost function
- high accuracy
- simulated annealing
- expectation maximization
- theoretical analysis
- segmentation algorithm
- np hard
- detection algorithm
- computational cost
- classification algorithm
- k means
- tree structure
- neural network
- optimal parameters
- globally optimal
- space complexity
- preprocessing
- times faster
- matching algorithm
- linear programming
- experimental evaluation