A hybrid simulated annealing/linear programming approach for the cover printing problem

DOI10.1155/2018/6193649MaRDI QIDQ1721187zbMATH OpenOpenAlexFDO

Authors Federico Alonso-Pecina, David Romero

Publication date 8 February 2019

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2018/6193649

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Using a greedy random adaptative search procedure to solve the cover printing problem
• Ad hoc heuristic for the cover printing problem
• Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• A simulated annealing with variable neighborhood search approach to construct mixed covering arrays
• A simulated annealing algorithm for dynamic layout problem
• Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search
• Genetic algorithms to solve the cover printing problem
• A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems

Cites work

• A heuristic for the label printing problem
• Ad hoc heuristic for the cover printing problem
• An optimization model to determine master designs and runs for advertisement printing
• Computational Science and Its Applications – ICCSA 2004
• Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
• Genetic algorithms to solve the cover printing problem
• Linear programming. Foundations and extensions
• Optimal job splitting on a multi-slot machine with applications in the printing industry
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• Tabu Search—Part I
• Towards an efficient resolution of printing problems
• Using a greedy random adaptative search procedure to solve the cover printing problem

Cited in

(6)

• Ad hoc heuristic for the cover printing problem
• A two-phase heuristic algorithm for the label printing problem
• Genetic algorithms to solve the cover printing problem
• Two heuristics for the label printing problem
• Towards an efficient resolution of printing problems
• Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem

This page was built for publication: A hybrid simulated annealing/linear programming approach for the cover printing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1721187)