Genetic algorithms to solve the cover printing problem

DOI10.1016/J.COR.2006.02.001MaRDI QIDQ883299zbMATH OpenOpenAlexFDO

Authors Semya Elaoud, Bassem Bouaziz, Jacques 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

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

Recommendations

• Using a greedy random adaptative search procedure to solve the cover printing problem
• Ad hoc heuristic for the cover printing problem
• A hybrid simulated annealing/linear programming approach for the cover printing problem
• Genetic algorithms applied to computationally difficult set covering problems
• scientific article; zbMATH DE number 1487885

Cites work

• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 2160607 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
• Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
• Handbook of metaheuristics
• The Pareto fitness genetic algorithm: test function study
• Using genetic algorithms for single-machine bicriteria scheduling problems

Cited in

(11)

• Ad hoc heuristic for the cover printing problem
• A two-phase heuristic algorithm for the label printing problem
• Order acceptance using genetic algorithms
• Using a greedy random adaptative search procedure to solve the cover printing problem
• Multiple crossover genetic algorithm for the multiobjective traveling salesman problem
• Two heuristics for the label printing problem
• Two dimensional guillotine cutting stock and scheduling problem in printing industry
• A hybrid simulated annealing/linear programming approach for the cover printing problem
• Towards an efficient resolution of printing problems
• Generalized particular covering problem with genetic algorithms
• Multiagent visual area coverage using a new genetic algorithm selection scheme

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

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