A grouping genetic algorithm with controlled gene transmission for the bin packing problem

DOI10.1016/j.cor.2014.10.010zbMath1348.90552OpenAlexW2080156253MaRDI QIDQ337402

Héctor J. Fraire Huacuja, Adriana C. F. Alvim, Marcela Quiroz-Castellanos, Laura Cruz-Reyes, Jose Torres-Jimenez, Claudia G. Gómez S.

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.10.010

zbMATH Keywords

heuristicsgenetic algorithmsgene transmissiongrouping problemsone-dimensional bin packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing ⋮ A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games ⋮ Exact and approximate methods for the score-constrained packing problem ⋮ Security-aware database migration planning ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ A hybrid evolutionary algorithm for the offline Bin Packing Problem

Uses Software

• EVE-OPT
• OR-Library
• Bison

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
• Nature inspired genetic algorithms for hard packing problems
• Team formation based on group technology: a hybrid grouping genetic algorithm approach
• Lower bounds and reduction procedures for the bin packing problem
• EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
• A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
• Two heuristics for the one-dimensional bin-packing problem
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Impact of the replacement heuristic in a grouping genetic algorithm.
• Fast algorithms for bin packing
• Solving the one-dimensional bin packing problem with a weight annealing heuristic
• An improved typology of cutting and packing problems
• Ant colony optimization and local search for bin packing and cutting stock problems
• New heuristics for one-dimensional bin-packing

This page was built for publication: A grouping genetic algorithm with controlled gene transmission for the bin packing problem