A hybrid evolutionary algorithm for the offline Bin Packing Problem
From MaRDI portal
Publication:2045610
DOI10.1007/s10100-020-00695-5OpenAlexW3043295958MaRDI QIDQ2045610
Publication date: 13 August 2021
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-020-00695-5
Related Items (2)
The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Operations research in Hungary: VOCAL 2018
Cites Work
- Unnamed Item
- Unnamed Item
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- A grouping genetic algorithm with controlled gene transmission for the bin packing problem
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
- Two heuristics for the one-dimensional bin-packing problem
- An EDA for the 2D knapsack problem with guillotine constraint
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- Evolutionary Computation in Combinatorial Optimization
- New heuristics for one-dimensional bin-packing
This page was built for publication: A hybrid evolutionary algorithm for the offline Bin Packing Problem
