Iterated local search for the label printing problem

Federico Alonso-Pecina, David Romero and Marco Antonio Cruz-Chávez

Journal of the Operational Research Society, 2024, vol. 75, issue 1, 39-48

Abstract: In the label printing problem (LPP), a set of labels must be printed in specified quantities, using n templates to be defined. Each template can accommodate a fixed number of printing plates. The LPP consists of determining: (1) an n-partition of the labels, where each block defines the labels that share a template, (2) for each label the number of identical printing plates to place in one of the n templates, and (3) the number of imprints to make with each template. The objective is to satisfy the labels’ demand while minimising total waste. Since the LPP is NP-Hard, to solve it, we propose here an Iterated Local Search heuristic that, once tested on all the instances available to us, it improved many of the best known results or find the optimum, when it is known.

Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2023.2174053 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:75:y:2024:i:1:p:39-48

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2023.2174053

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().