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

H. Edwin Romeijn, Dolores Romero Morales

Publikation: Bidrag til bog/antologi/rapportBidrag til bog/antologiForskningpeer review

Abstrakt

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.
OriginalsprogEngelsk
TitelQuantitative Approaches to Distribution Logistics and Supply Chain Management
RedaktørerAndreas Klose, M. Gracia Speranza, Luke N. Van Wassenhove
Udgivelses stedBerlin
ForlagSpringer
Publikationsdato2002
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

Citationsformater

Romeijn, H. E., & Romero Morales, D. (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