A beam search algorithm for the biobjective container loading problem
From MaRDI portal
Publication:2184131
DOI10.1016/j.ejor.2020.03.040zbMath1443.90287OpenAlexW3011018631MaRDI QIDQ2184131
Cristobal Sanchez, Ignacio J. Araya, Mauricio Moyano
Publication date: 27 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.03.040
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (6)
An efficient heuristic for minimizing the number of moves for the retrieval of a single item in a puzzle-based storage system with multiple escorts ⋮ An efficient method for the three-dimensional container loading problem by forming box sizes ⋮ Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer ⋮ Pruning Pareto optimal solutions for multi-objective portfolio asset management ⋮ BO-BSG ⋮ A tree search heuristic for the resource constrained project scheduling problem with transfer times
Uses Software
Cites Work
- Unnamed Item
- The multiple container loading problem with preference
- A beam search approach to the container loading problem
- A novel hybrid tabu search approach to container loading
- A tree search method for the container loading problem with shipment priority
- An efficient placement heuristic for three-dimensional rectangular packing
- Heuristics for container loading of furniture
- Weight distribution considerations in container loading
- Loading plates with non-identical items
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- Packing small boxes into a big box.
- An efficient approach for the multi-pallet loading problem
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- A new load balance methodology for container loading problem in road transportation
- MIP-based approaches for the container loading problem with multi-drop constraints
- Three-dimensional container loading models with cargo stability and load bearing constraints
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- Heuristics for the container loading problem
- Solving container loading problems by block arrangement
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- Neighborhood structures for the container loading problem: a VNS implementation
- Constraints in container loading -- a state-of-the-art review
- An improved typology of cutting and packing problems
- A Tree Search Algorithm for Solving the Container Loading Problem
- A Maximal-Space Algorithm for the Container Loading Problem
- A parallel hybrid local search algorithm for the container loading problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An Efficient Algorithm for Solving the Container Loading Problem
- A Genetic Algorithm for Solving the Container Loading Problem
- A hybrid genetic algorithm for the container loading problem
This page was built for publication: A beam search algorithm for the biobjective container loading problem
