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!
cited_by cdi_FETCH-LOGICAL-c373t-345f23cecac64847961e5085f78c467d0420f89c88d91f0c6722a909506769d73
cites
container_end_page 227
container_issue 2
container_start_page 217
container_title Optimization methods & software
container_volume 25
creator Gaul, Constantin
Kurz, Sascha
Rambau, Jörg
description 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.
doi_str_mv 10.1080/10556780902965163
format article
fullrecord <record><control><sourceid>proquest_infor</sourceid><recordid>TN_cdi_proquest_journals_858087518</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2299025931</sourcerecordid><originalsourceid>FETCH-LOGICAL-c373t-345f23cecac64847961e5085f78c467d0420f89c88d91f0c6722a909506769d73</originalsourceid><addsrcrecordid>eNqFkEtLAzEUhYMoWB8_wI0M7kdvJq8bcCPFFxS60XWImUSnTCc1SdH-e6fUXUFX9yy-7x44hFxQuKaAcENBCKkQNDRaCirZAZnQMddcM3W4zULUI4DH5CTnBQBwyuWEXM6Hqnz4qo-lLpuVr1qfu_ehWqX41vvlGTkKts_-_PeekteH-5fpUz2bPz5P72a1Y4qVmnERGua8s05y5EpL6gWgCAodl6oF3kBA7RBbTQM4qZrGatACpJK6VeyUXO3-jr2fa5-LWcR1GsZKgwIBlaA4QnQHuRRzTj6YVeqWNm0MBbNdweytMDq3O6cbQkxL-xVT35piN31MIdnBddmwv3T1r75nmfJd2A8im3EX</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>858087518</pqid></control><display><type>article</type><title>On the lot-type design problem</title><source>Taylor and Francis Science and Technology Collection</source><creator>Gaul, Constantin ; Kurz, Sascha ; Rambau, Jörg</creator><creatorcontrib>Gaul, Constantin ; Kurz, Sascha ; Rambau, Jörg</creatorcontrib><description>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.</description><identifier>ISSN: 1055-6788</identifier><identifier>EISSN: 1029-4937</identifier><identifier>DOI: 10.1080/10556780902965163</identifier><language>eng</language><publisher>Abingdon: Taylor &amp; Francis</publisher><subject>facility location problem ; Heuristic ; integer linear program formulation ; Linear programming ; location-allocation ; Operations research ; p-median problem ; primal heuristic ; real-world data ; Studies</subject><ispartof>Optimization methods &amp; software, 2010-04, Vol.25 (2), p.217-227</ispartof><rights>Copyright Taylor &amp; Francis Group, LLC 2010</rights><rights>Copyright Taylor &amp; Francis Ltd. Apr 2010</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c373t-345f23cecac64847961e5085f78c467d0420f89c88d91f0c6722a909506769d73</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,777,781,27905,27906</link.rule.ids></links><search><creatorcontrib>Gaul, Constantin</creatorcontrib><creatorcontrib>Kurz, Sascha</creatorcontrib><creatorcontrib>Rambau, Jörg</creatorcontrib><title>On the lot-type design problem</title><title>Optimization methods &amp; software</title><description>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.</description><subject>facility location problem</subject><subject>Heuristic</subject><subject>integer linear program formulation</subject><subject>Linear programming</subject><subject>location-allocation</subject><subject>Operations research</subject><subject>p-median problem</subject><subject>primal heuristic</subject><subject>real-world data</subject><subject>Studies</subject><issn>1055-6788</issn><issn>1029-4937</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNqFkEtLAzEUhYMoWB8_wI0M7kdvJq8bcCPFFxS60XWImUSnTCc1SdH-e6fUXUFX9yy-7x44hFxQuKaAcENBCKkQNDRaCirZAZnQMddcM3W4zULUI4DH5CTnBQBwyuWEXM6Hqnz4qo-lLpuVr1qfu_ehWqX41vvlGTkKts_-_PeekteH-5fpUz2bPz5P72a1Y4qVmnERGua8s05y5EpL6gWgCAodl6oF3kBA7RBbTQM4qZrGatACpJK6VeyUXO3-jr2fa5-LWcR1GsZKgwIBlaA4QnQHuRRzTj6YVeqWNm0MBbNdweytMDq3O6cbQkxL-xVT35piN31MIdnBddmwv3T1r75nmfJd2A8im3EX</recordid><startdate>201004</startdate><enddate>201004</enddate><creator>Gaul, Constantin</creator><creator>Kurz, Sascha</creator><creator>Rambau, Jörg</creator><general>Taylor &amp; Francis</general><general>Taylor &amp; Francis Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201004</creationdate><title>On the lot-type design problem</title><author>Gaul, Constantin ; Kurz, Sascha ; Rambau, Jörg</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c373t-345f23cecac64847961e5085f78c467d0420f89c88d91f0c6722a909506769d73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>facility location problem</topic><topic>Heuristic</topic><topic>integer linear program formulation</topic><topic>Linear programming</topic><topic>location-allocation</topic><topic>Operations research</topic><topic>p-median problem</topic><topic>primal heuristic</topic><topic>real-world data</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gaul, Constantin</creatorcontrib><creatorcontrib>Kurz, Sascha</creatorcontrib><creatorcontrib>Rambau, Jörg</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Optimization methods &amp; software</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gaul, Constantin</au><au>Kurz, Sascha</au><au>Rambau, Jörg</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the lot-type design problem</atitle><jtitle>Optimization methods &amp; software</jtitle><date>2010-04</date><risdate>2010</risdate><volume>25</volume><issue>2</issue><spage>217</spage><epage>227</epage><pages>217-227</pages><issn>1055-6788</issn><eissn>1029-4937</eissn><abstract>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.</abstract><cop>Abingdon</cop><pub>Taylor &amp; Francis</pub><doi>10.1080/10556780902965163</doi><tpages>11</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1055-6788
ispartof Optimization methods & software, 2010-04, Vol.25 (2), p.217-227
issn 1055-6788
1029-4937
language eng
recordid cdi_proquest_journals_858087518
source Taylor and Francis Science and Technology Collection
subjects facility location problem
Heuristic
integer linear program formulation
Linear programming
location-allocation
Operations research
p-median problem
primal heuristic
real-world data
Studies
title On the lot-type design problem
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T08%3A53%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_infor&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20lot-type%20design%20problem&rft.jtitle=Optimization%20methods%20&%20software&rft.au=Gaul,%20Constantin&rft.date=2010-04&rft.volume=25&rft.issue=2&rft.spage=217&rft.epage=227&rft.pages=217-227&rft.issn=1055-6788&rft.eissn=1029-4937&rft_id=info:doi/10.1080/10556780902965163&rft_dat=%3Cproquest_infor%3E2299025931%3C/proquest_infor%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c373t-345f23cecac64847961e5085f78c467d0420f89c88d91f0c6722a909506769d73%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=858087518&rft_id=info:pmid/&rfr_iscdi=true