### Abstract

The inventory-routing problem is a distribution problem in which each customer maintains a local inventory of a product such as heating oil and consumes a certain amount of that product each day. Given a central supplier, the objective is to minimize the annual delivery costs while attempting to insure that no customer runs out of the commodity at any time. In this article we present a procedure for reducing the long-term version of this problem to a single-period problem, which can be attacked using standard routing algorithms. The reduction procedure involves the definition of single-period costs that reflect long-term costs, the definition of a safety stock level and a specification of the customer subset to be considered during a single period.

Original language | English (US) |
---|---|

Pages (from-to) | 891-905 |

Number of pages | 15 |

Journal | Naval Research Logistics |

Volume | 34 |

Issue number | 6 |

State | Published - Dec 1987 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Management Science and Operations Research

### Cite this

*Naval Research Logistics*,

*34*(6), 891-905.

**INVENTORY/ROUTING : REDUCTION FROM AN ANNUAL TO A SHORT-PERIOD PROBLEM.** / Dror, Moshe; Ball, Michael.

Research output: Contribution to journal › Article

*Naval Research Logistics*, vol. 34, no. 6, pp. 891-905.

}

TY - JOUR

T1 - INVENTORY/ROUTING

T2 - REDUCTION FROM AN ANNUAL TO A SHORT-PERIOD PROBLEM.

AU - Dror, Moshe

AU - Ball, Michael

PY - 1987/12

Y1 - 1987/12

N2 - The inventory-routing problem is a distribution problem in which each customer maintains a local inventory of a product such as heating oil and consumes a certain amount of that product each day. Given a central supplier, the objective is to minimize the annual delivery costs while attempting to insure that no customer runs out of the commodity at any time. In this article we present a procedure for reducing the long-term version of this problem to a single-period problem, which can be attacked using standard routing algorithms. The reduction procedure involves the definition of single-period costs that reflect long-term costs, the definition of a safety stock level and a specification of the customer subset to be considered during a single period.

AB - The inventory-routing problem is a distribution problem in which each customer maintains a local inventory of a product such as heating oil and consumes a certain amount of that product each day. Given a central supplier, the objective is to minimize the annual delivery costs while attempting to insure that no customer runs out of the commodity at any time. In this article we present a procedure for reducing the long-term version of this problem to a single-period problem, which can be attacked using standard routing algorithms. The reduction procedure involves the definition of single-period costs that reflect long-term costs, the definition of a safety stock level and a specification of the customer subset to be considered during a single period.

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

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

M3 - Article

AN - SCOPUS:0023563839

VL - 34

SP - 891

EP - 905

JO - Naval Research Logistics

JF - Naval Research Logistics

SN - 0894-069X

IS - 6

ER -