A Greedy Heuristic for a Three-level Multi-period Single-sourcing Problem

H. Edwin Romeijn, Dolores Romero Morales

Publikation: Kapitel i bog/rapport/konferenceprocesBidrag til bog/antologiForskningpeer review

Resumé

In this paper we consider a model for integrating transportation and inventory decisions in a three-level logistics network consisting of plants, warehouses, and retailers (or customers). Our model includes production and throughout capacity constraints, and minimizes production, holding, and tansportation costs in a dynamic environment. We show that the problem can be reformulated as a certain type of assignment problem with convex objective function. Based on this observation, we propose a greedy heuristic for the problem, and illustrate its behaviour on a class of randomly generated problem instances. These experiments suggest that the heuristic may be asymptotically feasible and optimal with probability one in the number of customers.
In this paper we consider a model for integrating transportation and inventory decisions in a three-level logistics network consisting of plants, warehouses, and retailers (or customers). Our model includes production and throughout capacity constraints, and minimizes production, holding, and tansportation costs in a dynamic environment. We show that the problem can be reformulated as a certain type of assignment problem with convex objective function. Based on this observation, we propose a greedy heuristic for the problem, and illustrate its behaviour on a class of randomly generated problem instances. These experiments suggest that the heuristic may be asymptotically feasible and optimal with probability one in the number of customers.
SprogEngelsk
TitelQuantitative Approaches to Distribution Logistics and Supply Chain Management
RedaktørerAndreas Klose, M. Gracia Speranza, Luke N. Van Wassenhove
Udgivelses stedBerlin
ForlagSpringer
Dato2002
Sider191-214
ISBN (Trykt)9783540436904
StatusUdgivet - 2002
Udgivet eksterntJa
NavnLecture Notes in Economics and Mathematical Systems
Vol/bind519
ISSN0075-8442

Emneord

  • Dynamic demand pattern
  • Dynamic models
  • Heuristic solution approaches
  • Inventory costs
  • Transportation costs

Citer dette

Romeijn, H. E., & Morales, D. R. (2002). A Greedy Heuristic for a Three-level Multi-period Single-sourcing Problem. I A. Klose, M. G. Speranza, & L. N. V. Wassenhove (red.), Quantitative Approaches to Distribution Logistics and Supply Chain Management (s. 191-214). Berlin: Springer. Lecture Notes in Economics and Mathematical Systems, Bind. 519
Romeijn, H. Edwin ; Morales, Dolores Romero. / A Greedy Heuristic for a Three-level Multi-period Single-sourcing Problem. Quantitative Approaches to Distribution Logistics and Supply Chain Management . red. / Andreas Klose ; M. Gracia Speranza ; Luke N. Van Wassenhove. Berlin : Springer, 2002. s. 191-214 (Lecture Notes in Economics and Mathematical Systems, ???volume??? 519).
@inbook{558edeec28e8414f8e0f45912a8a234f,
title = "A Greedy Heuristic for a Three-level Multi-period Single-sourcing Problem",
abstract = "In this paper we consider a model for integrating transportation and inventory decisions in a three-level logistics network consisting of plants, warehouses, and retailers (or customers). Our model includes production and throughout capacity constraints, and minimizes production, holding, and tansportation costs in a dynamic environment. We show that the problem can be reformulated as a certain type of assignment problem with convex objective function. Based on this observation, we propose a greedy heuristic for the problem, and illustrate its behaviour on a class of randomly generated problem instances. These experiments suggest that the heuristic may be asymptotically feasible and optimal with probability one in the number of customers.",
keywords = "Dynamic demand pattern, Dynamic models, Heuristic solution approaches, Inventory costs, Transportation costs",
author = "Romeijn, {H. Edwin} and Morales, {Dolores Romero}",
year = "2002",
language = "English",
isbn = "9783540436904",
pages = "191--214",
editor = "Andreas Klose and Speranza, {M. Gracia} and Wassenhove, {Luke N. Van}",
booktitle = "Quantitative Approaches to Distribution Logistics and Supply Chain Management",
publisher = "Springer",
address = "Germany",

}

Romeijn, HE & Morales, DR 2002, A Greedy Heuristic for a Three-level Multi-period Single-sourcing Problem. i A Klose, MG Speranza & LNV Wassenhove (red), Quantitative Approaches to Distribution Logistics and Supply Chain Management . Springer, Berlin, Lecture Notes in Economics and Mathematical Systems, bind 519, s. 191-214.

A Greedy Heuristic for a Three-level Multi-period Single-sourcing Problem. / Romeijn, H. Edwin; Morales, Dolores Romero.

Quantitative Approaches to Distribution Logistics and Supply Chain Management . red. / Andreas Klose; M. Gracia Speranza; Luke N. Van Wassenhove. Berlin : Springer, 2002. s. 191-214.

Publikation: Kapitel i bog/rapport/konferenceprocesBidrag til bog/antologiForskningpeer review

TY - CHAP

T1 - A Greedy Heuristic for a Three-level Multi-period Single-sourcing Problem

AU - Romeijn,H. Edwin

AU - Morales,Dolores Romero

PY - 2002

Y1 - 2002

N2 - In this paper we consider a model for integrating transportation and inventory decisions in a three-level logistics network consisting of plants, warehouses, and retailers (or customers). Our model includes production and throughout capacity constraints, and minimizes production, holding, and tansportation costs in a dynamic environment. We show that the problem can be reformulated as a certain type of assignment problem with convex objective function. Based on this observation, we propose a greedy heuristic for the problem, and illustrate its behaviour on a class of randomly generated problem instances. These experiments suggest that the heuristic may be asymptotically feasible and optimal with probability one in the number of customers.

AB - In this paper we consider a model for integrating transportation and inventory decisions in a three-level logistics network consisting of plants, warehouses, and retailers (or customers). Our model includes production and throughout capacity constraints, and minimizes production, holding, and tansportation costs in a dynamic environment. We show that the problem can be reformulated as a certain type of assignment problem with convex objective function. Based on this observation, we propose a greedy heuristic for the problem, and illustrate its behaviour on a class of randomly generated problem instances. These experiments suggest that the heuristic may be asymptotically feasible and optimal with probability one in the number of customers.

KW - Dynamic demand pattern

KW - Dynamic models

KW - Heuristic solution approaches

KW - Inventory costs

KW - Transportation costs

M3 - Book chapter

SN - 9783540436904

SP - 191

EP - 214

BT - Quantitative Approaches to Distribution Logistics and Supply Chain Management

PB - Springer

CY - Berlin

ER -

Romeijn HE, Morales DR. A Greedy Heuristic for a Three-level Multi-period Single-sourcing Problem. I Klose A, Speranza MG, Wassenhove LNV, red., Quantitative Approaches to Distribution Logistics and Supply Chain Management . Berlin: Springer. 2002. s. 191-214. (Lecture Notes in Economics and Mathematical Systems, Bind 519).