Vehicle routing with cross-dock selection
详细信息    查看全文
文摘

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.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700