Cyclic inventory routing in a line-shaped network
详细信息    查看全文
文摘

We formalize the cyclic inventory routing problem in a line-shaped network.

The problem is relevant, e.g., to routing feeder ships and tow trains.

A complexity analysis identifies cases solvable in polynomial time.

For the NP-hard cases, a dynamic programming procedure is developed.

The computational study identifies costly routing policies.

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

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

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