Exact and Evolutionary Algorithms for the Score-Constrained Packing Problem

分数约束包装问题的精确算法和进化算法

• 批准号: 1798923
• 金额: --
• 依托单位: CARDIFF UNIVERSITY
• 依托单位国家: 英国
• 项目类别: Studentship
• 财政年份: 2016
• 资助国家: 英国
• 起止时间: 2016 至 无数据
• 项目状态: 已结题
• 来源: https://gtr.ukri.org/projects?ref=studentship-1798923
• 关键词: Exact; Evolutionary; Algorithms; Score; Constrained

One-dimensional bin packing is one of the most fundamental and widely-studied problems in operational research. In this project we focus on various extensions to this problem where, unlike the original problem, the ordering of items within each bin is of critical importance.Two examples of practical situations can occur can be found in the publications [1] and [2] below. This project is specifically concerned with designing efficient (and perhaps exact) algorithms for special cases of these problems, extending on the research documented in [1] and [2].1.Goulimis, C., 2004. Viewpoint: Minimum score separation - an open combinatorial problem associated with the cutting stock problem. Journal of the Operational Research Society 55, 1367-1368.2.Lewis, R., X. Song, K. Dowsland, and J. Thompson (2011) 'An Investigation into two Bin Packing Problems with Ordering and Orientation Implications'.European Journal of Operational Research, vol. 213, pp. 52-65.

一维装箱问题是运筹学中最基本、研究最广泛的问题之一。在这个项目中，我们专注于这个问题的各种扩展，与原始问题不同，每个bin中的项目排序至关重要。在下面的出版物[1]和[2]中可以找到两个实际情况的例子。这个项目特别关注为这些问题的特殊情况设计有效的（也许是精确的）算法，扩展了文献[1]和[2]中的研究。2004.观点：最小分分离-一个与下料问题相关的开放组合问题。Journal of the Operational Research Society 55，1367- 1368.2. Lewis，R.，X.宋，K. Downard和J. Thompson（2011）“An Investigation into two Bin Packing Problems with Ordering and Orientation Implications”. European Journal of Operational Research，vol. 213，pp. 52-65.