Paper Info
Title
Using a greedy random adaptative search procedure to solve the cover printing problem
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.
Year
DOI
Venue
2010
10.1016/j.cor.2009.06.006
Computers & OR
Keywords
DocType
Volume
greedy random adaptative search,Combinatorial optimization problem,total production cost,cover printing problem,Metaheuristics,reference instance,proposed procedure,considered problem,known solution,GRASP
Journal
37
Issue
ISSN
Citations 
4
Computers and Operations Research
3
PageRank 
References 
Authors
0.48
3
2
Name
Order
Citations
PageRank
D. Tuyttens122829.35
A. Vandaele2203.89