A Sequential Value Correction heuristic for a bi-objective two-dimensional bin-packing

A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem

“…Their unequal values allow PACK to randomly pack items; thus, diversify the search and overcome the highly symmetric nature of bin packing solutions; an intrinsic feature of VS2BP [17]. This diversification has been found effective in strip packing [5], in oneand two-dimensional bin packing [4,10], and in bi-objective bin packing with due-dates where the objective is to minimize both the number of bins and the maximum lateness of items [19].…”

Pricing-based primal and dual bounds for selected packing problems

“…In this chapter we consider a bi-criteria 2BP with due dates: we will refer to this problem as 2BP-DD in general, and as 2OBP-DD, 2RBP-DD when orientation is significant. The chapter develops earlier ideas formulated in [87]: problems are described in §4.2 with a discussion of some meaningful properties; a Sequential Value Correction heuristic (SVC-DD) for the problems addressed is proposed in §4.4; an improved dual bound for the scheduling objective function is provided in §4.5; finally, in §4.6, non-dominated solutions computed by the SVC-DD heuristic are analyzed and compared to those obtained by the algorithms proposed in [22] and [110].…”