.png){kind=icon}
返回
Formulations and solution algorithms for dynamic assembly routing problem
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2019.1588481.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study a dynamic version of the assembly routing problem. The assembly lot sizing section deals with decisions concerning the production phase, whereas the routing section organises the collection of raw materials necessary for the production. Traditionally, these two problems are treated separately, and more specifically, in a hierarchical way. We propose three linear programming models: a non-vehicle index model, a two-commodity flow formulation and a logic-based benders decomposition. We develop aggregated rounded capacity constraints for non-vehicle index model and separated them dynamically during the Branch & Cut procedure. Logic-based benders decomposition algorithm solves the Dynamic Assembly Routing Problem iteratively and obtains a feasible solution at each iteration. The numerical tests show that, the two first models are particularly effective at finding the optimal solutions in a reasonable amount of time on instances with up to 50 components and 3 periods.
Keyword:
lot sizing
vehicle routing
cutting plane
two-commodity
benders decomposition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
分享收藏Increased skin blood flow during low intensity vibration in human participants: Analysis of control mechanisms using short-time Fourier transform.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging一种混合多种群遗传算法，用于解决积压的多级产能批量问题OAAI
OAAI分享收藏
查看更多内容