Solving a Real-World Glass Cutting Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Solving a Real-World Glass Cutting Problem

Résumé

We consider the problem of finding two-dimensional cutting patterns for glass sheets in order to produce rectangular elements requested by customers. The number of needed sheets, and therefore the waste, is to be minimized. The cutting facility requires three-staged guil-lotineable cutting patterns, and in addition, a plan for loading produced elements on transportation wagons. The availability of only three loading docks for wagons imposes additional constraints on the feasibility of cutting patterns. We describe a greedy first fit heuristic, two branch-and-bound based heuristics, and different variants of an evolutionary algorithm for the problem, and compare them on a set of real-world instances. The evolutionary algorithm is based on an order representation, specific recombination and mutation operators, and a decoding heuris-tic. In one variant, branch-and-bound is occasionally applied to locally optimize parts of a solution during decoding.
Fichier principal
Vignette du fichier
puchinger-04.pdf (203.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01298048 , version 1 (05-04-2016)

Identifiants

Citer

Jakob Puchinger, Gabriele Koller, Günther R. Raidl. Solving a Real-World Glass Cutting Problem. Evolutionary Computation in Combinatorial Optimization, Apr 2004, Coimbra, Portugal. pp.Pages 165-176, ⟨10.1007/978-3-540-24652-7_17⟩. ⟨hal-01298048⟩
103 Consultations
302 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More