An enhanced fragment algorithm with dynamic discretization discovery, formulation leveraging, and column enumeration for row elimination is competitive with or outperforms state-of-the-art exact solvers on PDPTW and TDDRP instances.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Enhancements of Fragment Based Algorithms for Vehicle Routing Problems
An enhanced fragment algorithm with dynamic discretization discovery, formulation leveraging, and column enumeration for row elimination is competitive with or outperforms state-of-the-art exact solvers on PDPTW and TDDRP instances.