In this work we address the orthogonal non-oriented two-dimensional bin packing problem where items are equipped with due-dates and the bi-objective function takes into account both the number of used bins and the maximum lateness of items. We propose a sequential value correction heuristic that outperforms the benchmark algorithm specifically designed for the same problem, and we finally give some insight on the structure of the Pareto-optimal sets of the considered classes of instances.
A Sequential Value Correction heuristic for a bi-objective two-dimensional bin-packing / Marinelli, Fabrizio; Pizzuti, Andrea. - In: ELECTRONIC NOTES IN DISCRETE MATHEMATICS. - ISSN 1571-0653. - ELETTRONICO. - 64:(2018), pp. 25-34. [10.1016/j.endm.2018.01.004]
A Sequential Value Correction heuristic for a bi-objective two-dimensional bin-packing
Marinelli, Fabrizio;Pizzuti, Andrea
2018-01-01
Abstract
In this work we address the orthogonal non-oriented two-dimensional bin packing problem where items are equipped with due-dates and the bi-objective function takes into account both the number of used bins and the maximum lateness of items. We propose a sequential value correction heuristic that outperforms the benchmark algorithm specifically designed for the same problem, and we finally give some insight on the structure of the Pareto-optimal sets of the considered classes of instances.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
