Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. In this paper, we consider the well-known one-dimensional bin packing problem (BPP-1), which is to pack a given set of items having different sizes into a minimum number of equal-sized bins. For solving BPP-1, an exact hybrid solution procedure, called BISON, is proposed. It favourably combines the well-known meta-strategy tabu search and a branch and bound procedure based on known and new bound arguments and a new branching scheme. Computational results indicate that BISON is very effective and outperforms existing approaches.

References in zbMATH (referenced in 39 articles , 1 standard article )

Showing results 1 to 20 of 39.
Sorted by year (citations)

1 2 next

  1. Wei, Lijun; Luo, Zhixing; Baldacci, Roberto; Lim, Andrew: A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems (2020)
  2. Braune, Roland: Lower bounds for a bin packing problem with linear usage cost (2019)
  3. Delorme, Maxence; Iori, Manuel; Martello, Silvano: BPPLIB: a library for bin packing and cutting stock problems (2018)
  4. Fischetti, Matteo; Liberti, Leo; Salvagnin, Domenico; Walsh, Toby: Orbital shrinking: theory and applications (2017)
  5. Porumbel, Daniel; Clautiaux, François: Constraint aggregation in column generation models for resource-constrained covering problems (2017)
  6. Delorme, Maxence; Iori, Manuel; Martello, Silvano: Bin packing and cutting stock problems: mathematical models and exact algorithms (2016)
  7. Gabay, Michaël; Zaourar, Sofia: Vector bin packing with heterogeneous bins: application to the machine reassignment problem (2016)
  8. Gschwind, Timo; Irnich, Stefan: Dual inequalities for stabilized column generation revisited (2016)
  9. Elhedhli, Samir; Gzara, Fatma: Characterizing the optimality gap and the optimal packings for the bin packing problem (2015)
  10. Kashan, Ali Husseinzadeh; Akbari, Ali Akbar; Ostadi, Bakhtiar: Grouping evolution strategies: an effective approach for grouping problems (2015)
  11. Quiroz-Castellanos, Marcela; Cruz-Reyes, Laura; Torres-Jimenez, Jose; Gómez S., Claudia; Huacuja, Héctor J. Fraire; Alvim, Adriana C. F.: A grouping genetic algorithm with controlled gene transmission for the bin packing problem (2015)
  12. Rager, Markus; Gahm, Christian; Denz, Florian: Energy-oriented scheduling based on evolutionary algorithms (2015)
  13. Tlili, Takwa; Krichen, Saoussen: On solving the double loading problem using a modified particle swarm optimization (2015)
  14. Clautiaux, François; Dell’Amico, Mauro; Iori, Manuel; Khanafer, Ali: Lower and upper bounds for the bin packing problem with fragile objects (2014)
  15. Otto, Christian; Otto, Alena: Multiple-source learning precedence graph concept for the automotive industry (2014)
  16. Husseinzadeh Kashan, Ali; Husseinzadeh Kashan, Mina; Karimiyan, Somayyeh: A particle swarm optimizer for grouping problems (2013)
  17. Liao, Chung-Shou; Hsu, Chia-Hong: New lower bounds for the three-dimensional orthogonal bin packing problem (2013)
  18. Maiza, Mohamed; Labed, Abdenour; Radjef, Mohammed Said: Efficient algorithms for the offline variable sized bin-packing problem (2013)
  19. Bai, Ruibin; Blazewicz, Jacek; Burke, Edmund K.; Kendall, Graham; McCollum, Barry: A simulated annealing hyper-heuristic methodology for flexible decision support (2012)
  20. Fleszar, Krzysztof; Charalambous, Christoforos: Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (2011)

1 2 next