An analogy between bin packing problem and permutation problem: a new encoding scheme - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

An analogy between bin packing problem and permutation problem: a new encoding scheme

Résumé

The bin packing problem aims to pack a set of items in a minimum number of bins, with respect to the size of the items and capacity of the bins. This is an NP-hard problem. Several approach methods have been developed to solve this problem. In this paper, we propose a new encoding scheme which is used in a hybrid resolution: a metaheuristic is matched with a list algorithm (Next Fit, First Fit, Best Fit) to solve the bin packing problem. Any metaheuristic can be used but in this paper, our proposition is implemented on a single solution based metaheuris-tic (stochastic descent, simulated annealing, kangaroo algorithm). This hybrid method is tested on literature instances to ensure its good results.
Fichier principal
Vignette du fichier
Klement - APMS.pdf (176.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02023758 , version 1 (18-02-2019)

Identifiants

  • HAL Id : hal-02023758 , version 1

Citer

Michel Gourgand, Nathalie Grangeon, Nathalie Klement. An analogy between bin packing problem and permutation problem: a new encoding scheme. APMS Conference on Advances in Production Management Systems, 2014, Ajaccio, France. ⟨hal-02023758⟩
88 Consultations
57 Téléchargements

Partager

Gmail Facebook X LinkedIn More