An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing

Résumé

We consider the 3-stage two-dimensional bin packing problem , which occurs in real-world problems such as glass cutting. For it, we present a new integer linear programming formulation and a branch and price algorithm. Column generation is performed by applying either a greedy heuristic or an Evolutionary Algorithm (EA). Computational experiments show the benefits of the EA-based approach. The higher computational effort of the EA pays off in terms of better final solutions; furthermore more instances can be solved to provable optimality.
Fichier principal
Vignette du fichier
puchinger-04a.pdf (169.64 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01299556 , version 1 (07-04-2016)

Identifiants

Citer

Jakob Puchinger, Günther R. Raidl. An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing. Parallel Problem Solving from Nature - PPSN VIII, Sep 2004, Birmingham, United Kingdom. pp.Pages 642-651, ⟨10.1007/978-3-540-30217-9_65⟩. ⟨hal-01299556⟩
79 Consultations
376 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More