Pack Optimization Problem: Models and Solution Methods.

机译：包装优化问题：模型和解决方法。

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

Fashion retailers face the problem of optimizing the order, allocation, and replenishment to fulfill the size-specific demand. Merchandise is commonly pre-packed for easy handling in the supply chain. By packaging multiple quantities of Stock Keeping Units (SKUs) together, the flow efficiency in the supply chain can be improved. Meanwhile, extra opening costs are introduced. The decision maker needs to match the pack level supply to store level demand as well as to minimize the total costs involved.;This dissertation builds the foundation for the pack optimization problem, which originates from the practical need of the fashion apparel industry. It determines the optimal pack order quantities to satisfy each store's forecasted demand at size level. In the meantime, it minimizes the handling costs, and penalty costs due to mismatches between the supply and demand. In the literature, no formal research has been conducted for this topic. In this dissertation, the pack optimization problem is formulated as an integer programming problem. A dynamic programming model is also developed for a special case of the problem. Two heuristic methods are proposed for practical use. Computational experiments indicate that the hierarchical decomposition heuristic method outperforms other methods.

机译：时装零售商面临优化订单，分配和补货以满足特定尺寸需求的问题。商品通常预先包装好，以便在供应链中轻松处理。通过将多个数量的存货单位（SKU）打包在一起，可以提高供应链中的流程效率。同时，引入了额外的开放成本。决策者需要使包装水平的供应量与商店水平的需求相匹配，并最大程度地降低所涉及的总成本。本论文为包装优化问题奠定了基础，该问题源于时装行业的实际需求。它确定最佳包装订单数量，以满足每个商店在规模级别上的预测需求。同时，它使处理成本和因供需不匹配而导致的罚款成本最小化。在文献中，尚未对该主题进行正式的研究。本文将包装优化问题表述为整数规划问题。还针对问题的特殊情况开发了动态编程模型。提出了两种启发式方法以供实际使用。计算实验表明，层次分解启发式方法优于其他方法。

著录项

作者
Wang, Pu.;
展开▼
作者单位

North Carolina State University.;

展开▼
授予单位 North Carolina State University.;
学科 Engineering Industrial.;Operations Research.
学位 Ph.D.
年度 2010
页码 154 p.
总页数 154
原文格式 PDF
正文语种 eng
中图分类
关键词

相似文献

外文文献
中文文献
专利

1. Arithmetic of decay walls through continued fractions: a new exact dyon counting solution in N documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$ mathcal{N} $$end{document} = 4 CHL models [J] . Gabriel Lopes Cardoso, Suresh Nampuri, Martí Rosselló The journal of high energy physics . 2021,第3期

机译：通过持续分数的衰减墙算法：<内联公式ID =“IEQ1”> <替代方案> N < / mml：mi> DocumentClass [12pt] {minimal} usepackage {ammath} usepackage {keysym} usepackage {amsfonts} usepackage {amssymb} usepackage {amsbsy} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsidemargin} { - 69pt} begin {document} $$$ nath {document {n} $$ end {document} < 内联图XLink：href =“13130_2021_15112_Article_ieq1.gif”/> = 4 chl模型
2. Information and transparency necessary: ham production - selection of ham packaging and optimization methods. [J] . Savic Z. Fleischwirtschaft . 2010,第5期

机译：必需的信息和透明度：火腿生产-火腿包装的选择和优化方法。
3. On Stability of Exponential Cosmological Type Solutions with Two Factor Spaces in the Einstein–Gauss–Bonnet Model with adocumentclass[12pt]{minimal}usepackage{amsmath}usepackage{wasysym}usepackage{amsfonts}usepackage{amssymb}usepackage{amsbsy}usepackage{mathrsfs}usepackage{upgreek}setlength{oddsidemargin}{-69pt}egin{document}$$oldsymbol{Lambda}$$end{document}-Term [J] . Gravitation and Cosmology: G&C . 2020,第1期

机译：eInstein-gauss-bonnet模型中具有两个因子空间的指数宇宙型解决方案的稳定性 DocumentClass [12pt] {minimal} usepackage {ammath} usepackage {kyysym} usepackage {amsfonts} usepackage {amssymb} usepackage {amsbsy} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsidemargin} { - 69pt} begin {document} $$ boldsymbol { lambda} $$ end {document} -term
4. New solution of the N = 2 Supersymmetric KdV equation via Hirota methods. [C] . Laurent Delisle, Veronique Hussin International Conference on Quantum Theory and Symmetries . 2011

机译：通过Hirota方法的N = 2超对称KDV方程的新解。
5. Modeling of package and board power distribution networks using transmission matrix and macro-modeling methods. [D] . Kim, Joong-Ho. 2002

机译：使用传输矩阵和宏建模方法对封装和板配电网络进行建模。
6. Modeling and optimization of tannase production with Triphala in packed bed reactor by response surface methodology genetic algorithm and artificial neural network [O] . Subbalaxmi Selvaraj, Ramachandra Murty Vytla, G. S. Vijay, 2019

机译：响应面方法遗传算法和人工神经网络用三葫芦用三塔拉鞣蛋白生产的建模与优化
7. RELAP5/MOD3 code manual: Code structure, system models, and solution methods. Volume 1 [O] . 1995

机译：RELap5 / mOD3代码手册：代码结构，系统模型和解决方案方法。第1卷
8. Comparing risks from low-level radioactive waste disposal on land and in the ocean: A review of agreements/statutes, scenarios, processing/packaging/disposal technologies, models, and decision analysis methods. [R] . Moskowitz, P. D., Kalb, P. D., Morris, S. C., 1989

机译：比较陆地和海洋中低放射性废物处置的风险：对协议/法规，情景，加工/包装/处置技术，模型和决策分析方法的审查。

Pack Optimization Problem: Models and Solution Methods.

摘要

著录项

相似文献

相关主题

期刊订阅