An Analogy between Bin Packing Problem and Permutation Problem: A New Encoding Scheme - Advances in Production Management Systems: Innovative and Knowledge-Based Production Management in a Global-Local World - Part I Access content directly
Conference Papers Year : 2014

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.
Fichier principal
Vignette du fichier
978-3-662-44739-0_70_Chapter.pdf (155.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01388599 , version 1 (27-10-2016)

Licence

Attribution

Identifiers

Cite

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⟩
52 View
647 Download

Altmetric

Share

Gmail Facebook X LinkedIn More