A column generation-based heuristic algorithm for an inventory routing problem with perishable goods

被引：99

作者：

Le, Tung ^{[1
]}

Diabat, Ali ^{[2
]}

Richard, Jean-Philippe ^{[3
]}

Yih, Yuehwern ^{[4
]}

机构：

[1] Deccan Int, San Diego, CA 92121 USA

[2] Masdar Inst Sci & Technol, Abu Dhabi, U Arab Emirates

[3] Univ Florida, Gainesville, FL 32611 USA

[4] Purdue Univ, W Lafayette, IN 47907 USA

来源：

OPTIMIZATION LETTERS | 2013年 / 7卷 / 07期

关键词：

Inventory routing; Perishable goods; Column generation; Vehicle routing; Integer programming; MODEL;

D O I：

10.1007/s11590-012-0540-2

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

An inventory routing problem is a variation of the vehicle routing problem in which inventory and routing decisions are determined simultaneously over a given time horizon. The objective is to minimize the sum of transportation and inventory costs. In this paper, we study a specific inventory routing problem in which goods are perishable (PIRP). We develop a mathematical model for PIRP and exploit its structure to develop a column generation-based solution approach. Cutting planes are added to improve the formulation. We present computational experiments to demonstrate that our methodology is effective, and that the integration of routing and inventory can yield significant cost savings.

引用

页码：1481 / 1502

页数：22

共 27 条

[1] Industrial aspects and literature survey: Combined inventory management and routing [J].