CH Robinson Uses Heuristics to Solve Rich Vehicle Routing Problems

被引:2
|
作者
Khodabandeh, Ehsan [1 ]
Snyder, Lawrence, V [2 ]
Dennis, John [3 ]
Hammond, Joshua [3 ]
Wanless, Cody [3 ]
机构
[1] Coupa Software, Chicago, IL 60654 USA
[2] Lehigh Univ, Ind & Syst Engn, Bethlehem, PA 18015 USA
[3] CH Robinson, Eden Prairie, MN 55347 USA
来源
INFORMS JOURNAL ON APPLIED ANALYTICS | 2022年 / 52卷 / 02期
关键词
rich vehicle routing problem; load planning; set partitioning; heuristic; VARIABLE NEIGHBORHOOD SEARCH; ALGORITHM; OPTIMIZATION;
D O I
10.1287/inte.2021.1090
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider a broad 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). Because CHR has many customers, each with distinct requirements, various routing problems with different objectives and constraints must be solved. We propose a novel framework for solving rich vehicle routing problems, which we demonstrate is effective in solving a variety of different problems. This framework, along with a simple user interface, has been wrapped into a new module and integrated into the company's transportation planning and execution technology platform. Since its implementation, this new module has outperformed the previously used third party technologies at CHR, significantly reduced setup times, and improved users' productivity as well as customer outcomes.
引用
收藏
页码:173 / 188
页数:17
相关论文
共 50 条