DI-UMONS : Dépôt institutionnel de l’université de Mons

Recherche transversale
Rechercher
(titres de publication, de périodique et noms de colloque inclus)
2010-04-01 - Article/Dans un journal avec peer-review - Anglais - 9 page(s)

Tuyttens Daniel , Vandaele Arnaud , "Using a greedy random adaptative search procedure to solve the cover printing problem" in Computers and Operations Research, 37, 4, 640-648

  • Edition : Elsevier, Oxford (United Kingdom)
  • Codes CREF : Mathématiques (DI1100), Recherche opérationnelle (DI1150), Informatique de gestion (DI4364)
  • Unités de recherche UMONS : Mathématique et Recherche opérationnelle (F151)
  • Instituts UMONS : Institut des Sciences et du Management des Risques (Risques)
Texte intégral :

Abstract(s) :

(Anglais) 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.

Identifiants :
  • DOI : 10.1016/j.cor.2009.06.006