### Resumé

Sprog | Engelsk |
---|---|

Titel | Quantitative Approaches to Distribution Logistics and Supply Chain Management |

Redaktører | Andreas Klose, M. Gracia Speranza, Luke N. Van Wassenhove |

Udgivelses sted | Berlin |

Forlag | Springer |

Dato | 2002 |

Sider | 191-214 |

ISBN (Trykt) | 9783540436904 |

Status | Udgivet - 2002 |

Udgivet eksternt | Ja |

Navn | Lecture Notes in Economics and Mathematical Systems |
---|---|

Vol/bind | 519 |

ISSN | 0075-8442 |

### Emneord

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

### Citer dette

*Quantitative Approaches to Distribution Logistics and Supply Chain Management*(s. 191-214). Berlin: Springer. Lecture Notes in Economics and Mathematical Systems, Bind. 519

}

*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.

Publikation: Kapitel i bog/rapport/konferenceproces › Bidrag til bog/antologi › Forskning › peer 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 -