Algorithm 864
From MaRDI portal
Software:17185
No author found.
Related Items
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem ⋮ A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints ⋮ Extreme Point-Based Heuristics for Three-Dimensional Bin Packing ⋮ Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems ⋮ A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem ⋮ Space defragmentation for packing problems ⋮ Space and time allocation in a shipyard assembly hall ⋮ A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing ⋮ Routing problems with loading constraints ⋮ A MIP-based slicing heuristic for three-dimensional bin packing ⋮ Heuristic approaches for the two- and three-dimensional knapsack packing problem ⋮ Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems ⋮ A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP ⋮ A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints ⋮ A global search framework for practical three-dimensional packing with variable carton orientations ⋮ Multi-dimensional bin packing problems with guillotine constraints ⋮ The pallet loading problem: three-dimensional bin packing with practical constraints ⋮ Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking ⋮ Metaheuristics for vehicle routing problems with three-dimensional loading constraints ⋮ Three-dimensional bin packing problem with variable bin height ⋮ Constraints in container loading -- a state-of-the-art review
This page was built for software: Algorithm 864
