Log In Sign Up

C. H. Robinson Uses Heuristics to Solve Rich Vehicle Routing Problems

by   Ehsan Khodabandeh, et al.

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.


page 7

page 8


Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attention

Many real-world vehicle routing problems involve rich sets of constraint...

Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem

Learning how to automatically solve optimization problems has the potent...

A review of approaches to modeling applied vehicle routing problems

Due to the practical importance of vehicle routing problems (VRP), there...

Solving the Joint Order Batching and Picker Routing Problem for Large Instances

In this work, we investigate the problem of order batching and picker ro...

A concise guide to existing and emerging vehicle routing problem variants

Vehicle routing problems have been the focus of extensive research over ...

Vehicle routing by learning from historical solutions

The goal of this paper is to investigate a decision support system for v...