Hybrid CP and RKO solvers combined with local search improve expected next-day delivery coverage by +20 to +50 basis points over a greedy baseline on a single real-world middle-mile network instance.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
Hybrid CP and RKO solvers combined with local search improve expected next-day delivery coverage by +20 to +50 basis points over a greedy baseline on a single real-world middle-mile network instance.