Container packing problem with balance constraints

DOI10.1007/s00291-013-0356-1zbMath1305.90355OpenAlexW1968093212MaRDI QIDQ480768

Thi Viet Ly Nguyen, Il-Kyeong Moon

Publication date: 11 December 2014

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-013-0356-1

zbMATH Keywords

hybrid genetic algorithmbalance constraintscontainer packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

A matheuristic framework for the three-dimensional single large object placement problem with practical constraints ⋮ A new load balance methodology for container loading problem in road transportation ⋮ An integer program and a hybrid genetic algorithm for the university timetabling problem

Cites Work

• The three-dimensional knapsack problem with balancing constraints
• A novel hybrid tabu search approach to container loading
• Weight distribution considerations in container loading
• Loading plates with non-identical items
• A tabu search algorithm for weakly heterogeneous container loading problems
• Heuristics for the container loading problem
• Solving container loading problems by block arrangement
• Neighborhood structures for the container loading problem: a VNS implementation
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
• 3-D container packing heuristics
• Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
• A Maximal-Space Algorithm for the Container Loading Problem
• A Genetic Algorithm for Solving the Container Loading Problem
• The Three-Dimensional Bin Packing Problem
• A hybrid genetic algorithm for the container loading problem
• Unnamed Item

This page was built for publication: Container packing problem with balance constraints