Using a greedy random adaptative search procedure to solve the cover printing problem

Authors:
D. Tuyttens;A. Vandaele
Affiliations:
Polytechnic Faculty of Mons, Laboratory of Mathematics and Operational Research, Belgium;Polytechnic Faculty of Mons, Laboratory of Mathematics and Operational Research, Belgium
Venue:
Computers and Operations Research
Year:
2010

Citing 7
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem

Journal of Computational and Applied Mathematics - Special issue in honor of Professor Dr. F. Broeckx
Combinatorial optimization

Combinatorial optimization
A GRASP algorithm to solve the unicost set covering problem

Computers and Operations Research
Genetic algorithms to solve the cover printing problem

Computers and Operations Research
Reactive GRASP for the strip-packing problem

Computers and Operations Research
A probabilistic heuristic for a computationally difficult set covering problem

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, the cover printing problem, which consists in the grouping of book covers on offset plates in order to minimize the total production cost, is discussed. As the considered problem is hard, we discuss and propose a greedy random adaptative search procedure (GRASP) to solve the problem. The quality of the proposed procedure is tested on a set of reference instances, comparing the obtained results with those found in the literature. Our procedure improves the best known solutions for some of these instances. Results are also presented for larger, randomly generated problems.