DMCA
A Greedy Heuristic for a Three-Level Multi-Period . . . (2000)
| Citations: | 1 - 0 self |
BibTeX
@MISC{Romeijn00agreedy,
author = {H. Edwin Romeijn and Dolores Romero Morales},
title = {A Greedy Heuristic for a Three-Level Multi-Period . . .},
year = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
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 throughput capacity constraints, and minimizes production, holding, and transportation 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. 5001-6182 Business 5001-6182 Business Science Library of Congress Classification (LCC) 5761-5780 Shipping of Merchandise; Delivery of Goods M Business Administration and Business Economics M 11 R 4 Production Management Transportation Systems Journal...
Keyphrases
greedy heuristic three-level multi-period throughput capacity constraint certain type problem instance good business administration three-level logistics network production management transportation system journal convex objective function congress classification inventory decision dynamic environment business economics assignment problem transportation cost
