 |
Advances in Production Management Systems: Innovative and Knowledge-Based Production Management in a Global-Local World (Part I). IFIP WG 5.7 International Conference, APMS 2014 Ajaccio, France, September 20-24, 2014 |
 |
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.
Cited literature [18 references]
https://hal.inria.fr/hal-01388599
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
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
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