Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

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 metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, October 27, 2016 - 11:47:01 AM
Last modification on : Wednesday, November 17, 2021 - 3:11:57 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads