A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints

Ravindra K. Ahuja, Wei Huang, H. Edwin Romeijn, Dolores Romero Morales

Research output: Contribution to journalJournal articleResearchpeer-review

Abstract

The multi-period single-sourcing problem that we address in this paper can be used as a tool for evaluating logistics network designs in a dynamic environment. We consider the assignment of retailers to facilities, taking into account the timing, location, and size of production and inventories, in the presence of various types of constraints. We formulate the problem as a nonlinear assignment problem, and develop efficient algorithms for solving the capacitated lot-sizing subproblems that form the objective function of this formulation. We propose a greedy heuristic, and prove that this heuristic is asymptotically optimal in a probabilistic sense when retailer demands share a common seasonality pattern. In addition, we develop an efficient implementation of the very-large-scale-neighborhood-search method that can be used to improve the greedy solution. We perform extensive tests on a set of randomly generated problem instances, and conclude that our approach produces very high quality solutions in limited time.
Original languageEnglish
JournalI N F O R M S Journal on Computing
Volume19
Issue number1
Pages (from-to)14-26
ISSN1091-9856
DOIs
Publication statusPublished - 2007
Externally publishedYes

Cite this

@article{afb164a2391a41898f7a399c2bdf7ba9,
title = "A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints",
abstract = "The multi-period single-sourcing problem that we address in this paper can be used as a tool for evaluating logistics network designs in a dynamic environment. We consider the assignment of retailers to facilities, taking into account the timing, location, and size of production and inventories, in the presence of various types of constraints. We formulate the problem as a nonlinear assignment problem, and develop efficient algorithms for solving the capacitated lot-sizing subproblems that form the objective function of this formulation. We propose a greedy heuristic, and prove that this heuristic is asymptotically optimal in a probabilistic sense when retailer demands share a common seasonality pattern. In addition, we develop an efficient implementation of the very-large-scale-neighborhood-search method that can be used to improve the greedy solution. We perform extensive tests on a set of randomly generated problem instances, and conclude that our approach produces very high quality solutions in limited time.",
keywords = "Production and inventory planning, Capacity constraints, Heuristics",
author = "Ahuja, {Ravindra K.} and Wei Huang and Romeijn, {H. Edwin} and {Romero Morales}, Dolores",
year = "2007",
doi = "10.1287/ijoc.1050.0151",
language = "English",
volume = "19",
pages = "14--26",
journal = "I N F O R M S Journal on Computing",
issn = "1091-9856",
publisher = "Institute for Operations Research and the Management Sciences",
number = "1",

}

A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints. / Ahuja, Ravindra K.; Huang, Wei; Romeijn, H. Edwin; Romero Morales, Dolores .

In: I N F O R M S Journal on Computing, Vol. 19, No. 1, 2007, p. 14-26.

Research output: Contribution to journalJournal articleResearchpeer-review

TY - JOUR

T1 - A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints

AU - Ahuja, Ravindra K.

AU - Huang, Wei

AU - Romeijn, H. Edwin

AU - Romero Morales, Dolores

PY - 2007

Y1 - 2007

N2 - The multi-period single-sourcing problem that we address in this paper can be used as a tool for evaluating logistics network designs in a dynamic environment. We consider the assignment of retailers to facilities, taking into account the timing, location, and size of production and inventories, in the presence of various types of constraints. We formulate the problem as a nonlinear assignment problem, and develop efficient algorithms for solving the capacitated lot-sizing subproblems that form the objective function of this formulation. We propose a greedy heuristic, and prove that this heuristic is asymptotically optimal in a probabilistic sense when retailer demands share a common seasonality pattern. In addition, we develop an efficient implementation of the very-large-scale-neighborhood-search method that can be used to improve the greedy solution. We perform extensive tests on a set of randomly generated problem instances, and conclude that our approach produces very high quality solutions in limited time.

AB - The multi-period single-sourcing problem that we address in this paper can be used as a tool for evaluating logistics network designs in a dynamic environment. We consider the assignment of retailers to facilities, taking into account the timing, location, and size of production and inventories, in the presence of various types of constraints. We formulate the problem as a nonlinear assignment problem, and develop efficient algorithms for solving the capacitated lot-sizing subproblems that form the objective function of this formulation. We propose a greedy heuristic, and prove that this heuristic is asymptotically optimal in a probabilistic sense when retailer demands share a common seasonality pattern. In addition, we develop an efficient implementation of the very-large-scale-neighborhood-search method that can be used to improve the greedy solution. We perform extensive tests on a set of randomly generated problem instances, and conclude that our approach produces very high quality solutions in limited time.

KW - Production and inventory planning

KW - Capacity constraints

KW - Heuristics

U2 - 10.1287/ijoc.1050.0151

DO - 10.1287/ijoc.1050.0151

M3 - Journal article

VL - 19

SP - 14

EP - 26

JO - I N F O R M S Journal on Computing

JF - I N F O R M S Journal on Computing

SN - 1091-9856

IS - 1

ER -