On the lot-type design problem

We consider the problem of approximating the branch- and size-dependent demand of a fashion discounter with many branches by a distributing process being based on the branch delivery restricted to integral multiples of lots from a small set of available lot-types. We propose a formalized model that...

Full description

Saved in:
Bibliographic Details
Published in:Optimization methods & software 2010-04, Vol.25 (2), p.217-227
Main Authors: Gaul, Constantin, Kurz, Sascha, Rambau, Jörg
Format: Article
Language:English
Subjects:
facility location problem
Heuristic
integer linear program formulation
Linear programming
location-allocation
Operations research
p-median problem
primal heuristic
real-world data
Studies
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider the problem of approximating the branch- and size-dependent demand of a fashion discounter with many branches by a distributing process being based on the branch delivery restricted to integral multiples of lots from a small set of available lot-types. We propose a formalized model that arises from a practical cooperation with an industry partner. Besides an integer linear programming formulation, we provide an appropriate primal heuristic for this problem.
ISSN:1055-6788
1029-4937
DOI:10.1080/10556780902965163