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

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [1 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02023758
Contributor : Nathalie Grangeon <>
Submitted on : Monday, February 18, 2019 - 4:26:24 PM
Last modification on : Tuesday, April 2, 2019 - 2:03:28 AM
Long-term archiving on : Sunday, May 19, 2019 - 7:02:05 PM

File

Klement - APMS.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02023758, version 1

Citation

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⟩

Share

Metrics

Record views

40

Files downloads

28