We consider a pickup and delivery problem with cross-docks.
All requests transit through at least one cross-dock.
We formulate the problem as a mixed integer linear program.
We develop an adaptive large neighborhood search heuristic for it.
This heuristic consistently yields optimal or near-optimal solutions.