A hybrid simulated annealing/linear programming approach for the cover printing problem
type: Item
instance of: scholarly article
title: A hybrid simulated annealing/linear programming approach for the cover printing problem
zbMATH Open document ID: 1427.90130
DOI: 10.1155/2018/6193649
author: Federico Alonso-Pecina
author: David Romero
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: The \textit{NP}-hard cover printing problem addressed here consists in determining the number and composition of equal size impression grids, as well as the number of times each grid is printed, in order to fulfill the demand of different book covers at minimum total printing cost. The considered costs come from printing sheets and for composing grids. Thus, to deal with this combinatorial optimization problem we investigated two heuristics: one combines simulated annealing and linear programming techniques and the other is a hybrid of Tabu Search and an ad hoc procedure. Through intensive testing on available instances, these algorithms proved to be superior to previous approaches.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7019254
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/6193649
OpenAlex ID: W2888877241
cites work: Optimal job splitting on a multi-slot machine with applications in the printing industry
cites work: A heuristic for the label printing problem
cites work: An optimization model to determine master designs and runs for advertisement printing
cites work: Ad hoc heuristic for the cover printing problem
cites work: Genetic algorithms to solve the cover printing problem
cites work: Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
cites work: Using a greedy random adaptative search procedure to solve the cover printing problem
cites work: Towards an efficient resolution of printing problems
cites work: Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
cites work: Linear programming. Foundations and extensions
cites work: Computational Science and Its Applications – ICCSA 2004
cites work: Tabu Search—Part I
Recommended article: Using a greedy random adaptative search procedure to solve the cover printing problem
Recommended article: Ad hoc heuristic for the cover printing problem
Recommended article: Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
Recommended article: Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
Recommended article: A simulated annealing with variable neighborhood search approach to construct mixed covering arrays
Recommended article: A simulated annealing algorithm for dynamic layout problem
Recommended article: Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search
Recommended article: Genetic algorithms to solve the cover printing problem
Recommended article: A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
description: scientific article; zbMATH DE number 7019254