Lotsize optimization leading to a p-median problem with cardinalities

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 which arises from a practical cooperation with an industry partner. Besides an integer linear programming formulation and a primal heuristic for this problem we also consider a more abstract version which wWe 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 which arises from a practical cooperation with an industry partner. Besides an integer linear programming formulation and a primal heuristic for this problem we also consider a more abstract version which we relate to several other classical optimization problems like the p-median problem, the facility location problem or the matching problem.show moreshow less
Wir betrachten das Problem den größen- und filialabhängigen Bedarf eines Modediscounters mit vielen Filialen durch Lotbelieferung zu approximieren. Ausgehend von einer Kooperation mit einem Industriepartner entwickeln wir ein formales Modell für dieses Problem mit Hilfe ganzzahliger linearer Programmierung. Weiterhin beschreiben wir eine Lösungsheuristik und evaluieren ihre Güte anhand von Beispieldaten aus der Praxis.

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS
  • frontdoor_exportcitavi

Additional Services

    Share in Twitter Search Google Scholar
Metadaten
Institutes:Mathematik
Author: Constantin Gaul, Sascha Kurz, Jörg Rambau
Year of Completion:2007
SWD-Keyword:Diskrete Optimierung; Heuristik; Operations Research
Tag:Lotgrößenoptimierung; p-Median-Problem; primale Heuristik
facility location problem; lotsize optimization; p-median problem; primal heuristic; real world data
Dewey Decimal Classification:510 Mathematik
MSC-Classification:90B80 Discrete location and assignment [See also 90C10]
90C10 Integer programming
URN:urn:nbn:de:bvb:703-opus-4196
Source:Rev. Fassung erscheint in: "Optimization methods and software"
Document Type:Preprint
Language:English
Date of Publication (online):15.04.2008