A beam search algorithm for the biobjective container loading problem
From MaRDI portal
Recommendations
- A beam search approach to the container loading problem
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A maximal-space algorithm for the container loading problem
- Solving the single-container loading problem by a fast heuristic method
Cites work
- A Genetic Algorithm for Solving the Container Loading Problem
- A beam search approach to the container loading problem
- A hybrid genetic algorithm for the container loading problem
- A maximal-space algorithm for the container loading problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A new load balance methodology for container loading problem in road transportation
- A novel hybrid tabu search approach to container loading
- A parallel hybrid local search algorithm for the container loading problem
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- A tree search algorithm for solving the container loading problem
- A tree search method for the container loading problem with shipment priority
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- An Efficient Algorithm for Solving the Container Loading Problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An efficient approach for the multi-pallet loading problem
- An efficient placement heuristic for three-dimensional rectangular packing
- An improved typology of cutting and packing problems
- Constraints in container loading -- a state-of-the-art review
- Heuristics for container loading of furniture
- Heuristics for the container loading problem
- Loading plates with non-identical items
- MIP-based approaches for the container loading problem with multi-drop constraints
- Multi-objective optimization using evolutionary algorithms
- Neighborhood structures for the container loading problem: a VNS implementation
- Packing small boxes into a big box.
- Solving container loading problems by block arrangement
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- The multiple container loading problem with preference
- Three-dimensional container loading models with cargo stability and load bearing constraints
- VCS: A new heuristic function for selecting boxes in the single container loading problem
- Weight distribution considerations in container loading
Cited in
(10)- An efficient method for the three-dimensional container loading problem by forming box sizes
- Pruning Pareto optimal solutions for multi-objective portfolio asset management
- A two-phase constructive algorithm for the single container mix-loading problem
- 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
- Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer
- BO-BSG
- A beam search approach to the container loading problem
- A beam search algorithm for the load sequencing of outbound containers in port container terminals
- A beam search algorithm for minimizing crane times in premarshalling problems
- A tree search heuristic for the resource constrained project scheduling problem with transfer times
This page was built for publication: A beam search algorithm for the biobjective container loading problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2184131)
