Marine inventory routing: shipments planning
Marine inventory routing: shipments planning
复制标题
海运库存路线：发货计划
DOI：
10.1057/palgrave.jors.2601264
复制
发表时间：
2002
影响因子：
3.6
通讯作者：
D. Ronen
中科院分区：
文献类型：
--
作者：
D. Ronen
本文讨论了大容量液体散装产品的生产商所面临的运输规划问题。储罐容量有限的生产地通过船舶（或驳船）向存储容量也有限的消费目的地供应多种产品。运输的时间、起点、目的地和产品数量必须以最小化成本的方式确定，并且不违反两端的存储容量限制（既不会在起点停止生产，也不会在目的地耗尽库存）。混合整数规划模型用于在几分钟内获得具有成本效益的解决方案。一个基于成本的启发式算法是用来确保可接受的解决方案得到迅速。
This paper addresses a shipments-planning problem faced by producers of large volume liquid bulk products. Producing origins with limited tank storage capacity supply multiple products by ships (or barges) to consuming destinations that also have limited storage capacity. Timing, origin, destination, and product quantities of shipments have to be determined in a manner that minimizes costs and does not violate storage capacity constraints at both ends (neither stopping production at the origins, nor running out of stock at the destinations). A mixed integer-programming model is used to derive cost effective solutions within a few minutes. A cost-based heuristic algorithm is used to assure that acceptable solutions are obtained quickly.