A Two-Stage Matheuristic Algorithm for Classical Inventory Routing Problem.
Zhouxing SuShihao HuangChungen LiZhipeng LüPublished in: IJCAI (2020)
Keyphrases
- learning algorithm
- preprocessing
- computational complexity
- experimental evaluation
- experimental study
- single pass
- significant improvement
- cost function
- np hard
- dynamic programming
- detection algorithm
- times faster
- least squares
- tree structure
- matching algorithm
- estimation algorithm
- recognition algorithm
- improved algorithm
- k means
- path planning
- network flow
- classification algorithm
- particle swarm optimization
- segmentation method
- optimization algorithm
- computationally efficient
- expectation maximization
- simulated annealing
- worst case
- semi supervised
- computational cost
- search space
- similarity measure
- feature extraction