Heuristic for the assort-packing and distribution problem in the fashion apparel industry

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 246
  • Download : 0
We model and derive an algorithm for the assort-packing and distribution problem (APDP) in the fashion apparel industry. Assort-packing is a common method used to reduce the distribution lead time between manufacturers and retailers, wherein different items are packed together in one box according to the retailers’ demands. Specifically, in the fashion industry, multiple box types are configured by varying the size distribution of the same apparel product. In this study, we propose an optimisation model to quantitatively solve the APDP with respect to how many box types should be configured, how to configure the size distribution in each box, and how many of each type of box should be sent to stores. In particular, the modelling and algorithm development focus on the size-assorted homogeneous-article configuration in the APDP, a widely used assort-packing method in the fashion industry. We show that the APDP is NP-hard, and propose a heuristic algorithm in which a pre-processing step significantly reduces the search space. Numerical studies of the industry scale are conducted and show that the algorithm outperforms the benchmarking algorithms.
Publisher
TAYLOR & FRANCIS LTD
Issue Date
2018-06
Language
English
Article Type
Article
Keywords

PACKAGING PROBLEM; SUPPLY CHAIN

Citation

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.56, no.9, pp.3116 - 3133

ISSN
0020-7543
DOI
10.1080/00207543.2017.1412525
URI
http://hdl.handle.net/10203/243712
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0