Asymptotic Analysis of a Greedy Heuristic for the Multi-Period Single-Sourcing Problem

The Acyclic Case

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 tactical tool for evaluating logistics network designs in a dynamic environment. In particular, our objective is to find an assignment of customers to facilities, as well as the location, timing and size of production and inventory levels, that minimizes total assignment, production, and inventory costs. We propose a greedy heuristic, and prove that this greedy heuristic is asymptotically optimal in a probabilistic sense for the subclass of problems where the assignment of customers to facilities is allowed to vary over time. In addition, we prove a similar result for the subclass of problems where each customer needs to be assigned to the same facility over the planning horizon, and where the demand for each customer exhibits the same seasonality pattern. We illustrate the behavior of the greedy heuristic, as well as some improvements where the greedy heuristic is used as the starting point of a local interchange procedure, on a set of randomly generated test problems. These results suggest that the greedy heuristic may be asymptotically optimal even for the cases that we were unable to analyze theoretically.
Original languageEnglish
JournalJournal of Heuristics
Volume10
Issue number1
Pages (from-to)5-35
ISSN1381-1231
DOIs
Publication statusPublished - 2004
Externally publishedYes

Cite this

@article{135d8e6316854ce2bc2100c4f33ab157,
title = "Asymptotic Analysis of a Greedy Heuristic for the Multi-Period Single-Sourcing Problem: The Acyclic Case",
abstract = "The multi-period single-sourcing problem that we address in this paper can be used as a tactical tool for evaluating logistics network designs in a dynamic environment. In particular, our objective is to find an assignment of customers to facilities, as well as the location, timing and size of production and inventory levels, that minimizes total assignment, production, and inventory costs. We propose a greedy heuristic, and prove that this greedy heuristic is asymptotically optimal in a probabilistic sense for the subclass of problems where the assignment of customers to facilities is allowed to vary over time. In addition, we prove a similar result for the subclass of problems where each customer needs to be assigned to the same facility over the planning horizon, and where the demand for each customer exhibits the same seasonality pattern. We illustrate the behavior of the greedy heuristic, as well as some improvements where the greedy heuristic is used as the starting point of a local interchange procedure, on a set of randomly generated test problems. These results suggest that the greedy heuristic may be asymptotically optimal even for the cases that we were unable to analyze theoretically.",
keywords = "Greedy heuristic, Asymptotic optimality, Dynamic assignment problems, Integrated production, Inventory and transportation planning",
author = "Romeijn, {H. Edwin} and {Romero Morales}, Dolores",
year = "2004",
doi = "10.1023/B:HEUR.0000019984.80186.48",
language = "English",
volume = "10",
pages = "5--35",
journal = "Journal of Heuristics",
issn = "1381-1231",
publisher = "Springer",
number = "1",

}

Asymptotic Analysis of a Greedy Heuristic for the Multi-Period Single-Sourcing Problem : The Acyclic Case. / Romeijn, H. Edwin; Romero Morales, Dolores .

In: Journal of Heuristics, Vol. 10, No. 1, 2004, p. 5-35.

Research output: Contribution to journalJournal articleResearchpeer-review

TY - JOUR

T1 - Asymptotic Analysis of a Greedy Heuristic for the Multi-Period Single-Sourcing Problem

T2 - The Acyclic Case

AU - Romeijn, H. Edwin

AU - Romero Morales, Dolores

PY - 2004

Y1 - 2004

N2 - The multi-period single-sourcing problem that we address in this paper can be used as a tactical tool for evaluating logistics network designs in a dynamic environment. In particular, our objective is to find an assignment of customers to facilities, as well as the location, timing and size of production and inventory levels, that minimizes total assignment, production, and inventory costs. We propose a greedy heuristic, and prove that this greedy heuristic is asymptotically optimal in a probabilistic sense for the subclass of problems where the assignment of customers to facilities is allowed to vary over time. In addition, we prove a similar result for the subclass of problems where each customer needs to be assigned to the same facility over the planning horizon, and where the demand for each customer exhibits the same seasonality pattern. We illustrate the behavior of the greedy heuristic, as well as some improvements where the greedy heuristic is used as the starting point of a local interchange procedure, on a set of randomly generated test problems. These results suggest that the greedy heuristic may be asymptotically optimal even for the cases that we were unable to analyze theoretically.

AB - The multi-period single-sourcing problem that we address in this paper can be used as a tactical tool for evaluating logistics network designs in a dynamic environment. In particular, our objective is to find an assignment of customers to facilities, as well as the location, timing and size of production and inventory levels, that minimizes total assignment, production, and inventory costs. We propose a greedy heuristic, and prove that this greedy heuristic is asymptotically optimal in a probabilistic sense for the subclass of problems where the assignment of customers to facilities is allowed to vary over time. In addition, we prove a similar result for the subclass of problems where each customer needs to be assigned to the same facility over the planning horizon, and where the demand for each customer exhibits the same seasonality pattern. We illustrate the behavior of the greedy heuristic, as well as some improvements where the greedy heuristic is used as the starting point of a local interchange procedure, on a set of randomly generated test problems. These results suggest that the greedy heuristic may be asymptotically optimal even for the cases that we were unable to analyze theoretically.

KW - Greedy heuristic

KW - Asymptotic optimality

KW - Dynamic assignment problems

KW - Integrated production

KW - Inventory and transportation planning

U2 - 10.1023/B:HEUR.0000019984.80186.48

DO - 10.1023/B:HEUR.0000019984.80186.48

M3 - Journal article

VL - 10

SP - 5

EP - 35

JO - Journal of Heuristics

JF - Journal of Heuristics

SN - 1381-1231

IS - 1

ER -