Exact and Evolutionary Algorithms for the Score-Constrained Packing Problem

一维装箱问题是运筹学中最基本、研究最广泛的问题之一。在这个项目中，我们关注这个问题的各种扩展，与原始问题不同的是，每个箱子中物品的排序是至关重要的。可以在下面的出版物[1]和[2]中找到可能发生的两个实际情况示例。本项目特别关注为这些问题的特殊情况设计有效的（也许是精确的）算法，扩展[1]和[1].1中记录的研究。古利米斯，C., 2004。观点：最小分值分离——一个与切削料问题相关的开放组合问题。运筹学学报55,1367-1368.2。Lewis， R.， X. Song， K. Dowsland和J. Thompson(2011)，“对两个具有排序和定向含义的装箱问题的调查”。《欧洲运筹学杂志》，第213卷，第52-65页。

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.