C. H. Robinson Uses Heuristics to Solve Rich Vehicle Routing Problems
Abstract
We consider a wide family of vehicle routing problem variants with many complex and practical constraints, known as rich vehicle routing problems, which are faced on a daily basis by C.H. Robinson (CHR). Since CHR has many customers, each with distinct requirements, various routing problems with different objectives and constraints should be solved. We propose a set partitioning framework with a number of route generation algorithms, which have shown to be effective in solving a variety of different problems. The proposed algorithms have outperformed the existing technologies at CHR on 10 benchmark instances and since, have been embedded into the company's transportation planning and execution technology platform.
Cite
@article{arxiv.1912.13157,
title = {C. H. Robinson Uses Heuristics to Solve Rich Vehicle Routing Problems},
author = {Ehsan Khodabandeh and Lawrence V. Snyder and John Dennis and Joshua Hammond and Cody Wanless},
journal= {arXiv preprint arXiv:1912.13157},
year = {2020}
}
Comments
12 pages, 3 figures, and 3 tables