Genetic algorithms to solve the cover printing problem

DOI10.1016/j.cor.2006.02.001zbMath1163.90728OpenAlexW2005354587MaRDI QIDQ883299

Bassem Bouaziz, Semya Elaoud, Jacques jun. Teghem

Publication date: 4 June 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.02.001

zbMATH Keywords

genetic algorithmsmultiobjective optimizationmixed integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Search theory (90B40)

Related Items (9)

Two dimensional guillotine cutting stock and scheduling problem in printing industry ⋮ Two heuristics for the label printing problem ⋮ Ad hoc heuristic for the cover printing problem ⋮ A two-phase heuristic algorithm for the label printing problem ⋮ A hybrid simulated annealing/linear programming approach for the cover printing problem ⋮ Unnamed Item ⋮ Order acceptance using genetic algorithms ⋮ Using a greedy random adaptative search procedure to solve the cover printing problem ⋮ Towards an efficient resolution of printing problems

Cites Work

• The Pareto fitness genetic algorithm: test function study
• Using genetic algorithms for single-machine bicriteria scheduling problems
• Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
• Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
• Handbook of metaheuristics
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Genetic algorithms to solve the cover printing problem