On the integrated production, inventory, and distribution routing problem

Lei Lei, Shuguang Liu, Andrzej Ruszczynski, Sunju Park

Research output: Contribution to journalArticle

114 Citations (Scopus)

Abstract

The integrated Production, Inventory, and Distribution Routing Problem (PIDRP) is concerned with coordinating production, inventory, and delivery operations to meet customer demand with the objective of minimizing the cost. The PIDRP considered in this paper also involves heterogeneous transporters with noninstantaneous traveling times and multiple customer demand centers each with its own inventory capacity. Optimally solving such an integrated problem is in general difficult due to its combinatorial nature, especially when transporter routing is involved. We propose a two-phase solution approach to this problem. Phase I solves a mixed-integer program which includes all the constraints in the original model but with the transporter routings being restricted to direct shipments between facilities and customer demand centers. The resulting optimal solution to phase I is always feasible to the original model. Phase II solves an associated consolidation problem to handle the potential inefficiency of direct shipment. The delivery consolidation problem is formulated as a capacitated transportation problem with additional constraints and is solved heuristically. Unlike the classical decoupled approach, this two-phase approach does not separate the optimization for the production lot sizes and the transportation schedules. Its main advantage lies in its ability to simultaneously coordinate the production, inventory, and transportation operations of the entire planning horizon, without the need to aggregate the demand or relax the constraints on transportation capacities. This enables us to quickly identify a quality suboptimal solution to the original complex problem. The suboptimality is, however, due to the simplified assumption that in phase I only direct shipment is deployed, which is then partially corrected for by the effort of phase II. We evaluate the performance of this proposed two-phase approach and report on its application to a real-life supply network.

Original languageEnglish
Pages (from-to)955-970
Number of pages16
JournalIIE Transactions (Institute of Industrial Engineers)
Volume38
Issue number11
DOIs
Publication statusPublished - 2006 Nov 1

Fingerprint

Consolidation
Planning
Costs

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

Lei, Lei ; Liu, Shuguang ; Ruszczynski, Andrzej ; Park, Sunju. / On the integrated production, inventory, and distribution routing problem. In: IIE Transactions (Institute of Industrial Engineers). 2006 ; Vol. 38, No. 11. pp. 955-970.
@article{aec548a858e84bab93ee701b9b5b2de5,
title = "On the integrated production, inventory, and distribution routing problem",
abstract = "The integrated Production, Inventory, and Distribution Routing Problem (PIDRP) is concerned with coordinating production, inventory, and delivery operations to meet customer demand with the objective of minimizing the cost. The PIDRP considered in this paper also involves heterogeneous transporters with noninstantaneous traveling times and multiple customer demand centers each with its own inventory capacity. Optimally solving such an integrated problem is in general difficult due to its combinatorial nature, especially when transporter routing is involved. We propose a two-phase solution approach to this problem. Phase I solves a mixed-integer program which includes all the constraints in the original model but with the transporter routings being restricted to direct shipments between facilities and customer demand centers. The resulting optimal solution to phase I is always feasible to the original model. Phase II solves an associated consolidation problem to handle the potential inefficiency of direct shipment. The delivery consolidation problem is formulated as a capacitated transportation problem with additional constraints and is solved heuristically. Unlike the classical decoupled approach, this two-phase approach does not separate the optimization for the production lot sizes and the transportation schedules. Its main advantage lies in its ability to simultaneously coordinate the production, inventory, and transportation operations of the entire planning horizon, without the need to aggregate the demand or relax the constraints on transportation capacities. This enables us to quickly identify a quality suboptimal solution to the original complex problem. The suboptimality is, however, due to the simplified assumption that in phase I only direct shipment is deployed, which is then partially corrected for by the effort of phase II. We evaluate the performance of this proposed two-phase approach and report on its application to a real-life supply network.",
author = "Lei Lei and Shuguang Liu and Andrzej Ruszczynski and Sunju Park",
year = "2006",
month = "11",
day = "1",
doi = "10.1080/07408170600862688",
language = "English",
volume = "38",
pages = "955--970",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "11",

}

On the integrated production, inventory, and distribution routing problem. / Lei, Lei; Liu, Shuguang; Ruszczynski, Andrzej; Park, Sunju.

In: IIE Transactions (Institute of Industrial Engineers), Vol. 38, No. 11, 01.11.2006, p. 955-970.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On the integrated production, inventory, and distribution routing problem

AU - Lei, Lei

AU - Liu, Shuguang

AU - Ruszczynski, Andrzej

AU - Park, Sunju

PY - 2006/11/1

Y1 - 2006/11/1

N2 - The integrated Production, Inventory, and Distribution Routing Problem (PIDRP) is concerned with coordinating production, inventory, and delivery operations to meet customer demand with the objective of minimizing the cost. The PIDRP considered in this paper also involves heterogeneous transporters with noninstantaneous traveling times and multiple customer demand centers each with its own inventory capacity. Optimally solving such an integrated problem is in general difficult due to its combinatorial nature, especially when transporter routing is involved. We propose a two-phase solution approach to this problem. Phase I solves a mixed-integer program which includes all the constraints in the original model but with the transporter routings being restricted to direct shipments between facilities and customer demand centers. The resulting optimal solution to phase I is always feasible to the original model. Phase II solves an associated consolidation problem to handle the potential inefficiency of direct shipment. The delivery consolidation problem is formulated as a capacitated transportation problem with additional constraints and is solved heuristically. Unlike the classical decoupled approach, this two-phase approach does not separate the optimization for the production lot sizes and the transportation schedules. Its main advantage lies in its ability to simultaneously coordinate the production, inventory, and transportation operations of the entire planning horizon, without the need to aggregate the demand or relax the constraints on transportation capacities. This enables us to quickly identify a quality suboptimal solution to the original complex problem. The suboptimality is, however, due to the simplified assumption that in phase I only direct shipment is deployed, which is then partially corrected for by the effort of phase II. We evaluate the performance of this proposed two-phase approach and report on its application to a real-life supply network.

AB - The integrated Production, Inventory, and Distribution Routing Problem (PIDRP) is concerned with coordinating production, inventory, and delivery operations to meet customer demand with the objective of minimizing the cost. The PIDRP considered in this paper also involves heterogeneous transporters with noninstantaneous traveling times and multiple customer demand centers each with its own inventory capacity. Optimally solving such an integrated problem is in general difficult due to its combinatorial nature, especially when transporter routing is involved. We propose a two-phase solution approach to this problem. Phase I solves a mixed-integer program which includes all the constraints in the original model but with the transporter routings being restricted to direct shipments between facilities and customer demand centers. The resulting optimal solution to phase I is always feasible to the original model. Phase II solves an associated consolidation problem to handle the potential inefficiency of direct shipment. The delivery consolidation problem is formulated as a capacitated transportation problem with additional constraints and is solved heuristically. Unlike the classical decoupled approach, this two-phase approach does not separate the optimization for the production lot sizes and the transportation schedules. Its main advantage lies in its ability to simultaneously coordinate the production, inventory, and transportation operations of the entire planning horizon, without the need to aggregate the demand or relax the constraints on transportation capacities. This enables us to quickly identify a quality suboptimal solution to the original complex problem. The suboptimality is, however, due to the simplified assumption that in phase I only direct shipment is deployed, which is then partially corrected for by the effort of phase II. We evaluate the performance of this proposed two-phase approach and report on its application to a real-life supply network.

UR - http://www.scopus.com/inward/record.url?scp=33748518397&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33748518397&partnerID=8YFLogxK

U2 - 10.1080/07408170600862688

DO - 10.1080/07408170600862688

M3 - Article

AN - SCOPUS:33748518397

VL - 38

SP - 955

EP - 970

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 11

ER -