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 metaheuristic (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 [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01388599
Contributor : Hal Ifip <>
Submitted on : Thursday, October 27, 2016 - 11:47:01 AM
Last modification on : Thursday, March 7, 2019 - 5:40:08 PM

File

978-3-662-44739-0_70_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Michel Gourgand, Nathalie Grangeon, Nathalie Klement. An Analogy between Bin Packing Problem and Permutation Problem: A New Encoding Scheme. IFIP International Conference on Advances in Production Management Systems (APMS), Sep 2014, Ajaccio, France. pp.572-579, ⟨10.1007/978-3-662-44739-0_70⟩. ⟨hal-01388599⟩

Share

Metrics

Record views

100

Files downloads

341