A large neighbourhood search algorithm for solving container loading problems

DOI10.1016/J.COR.2023.106199MaRDI QIDQ6109572zbMATH OpenFDO

Authors Özge Şafak, Güneş Erdogăn

Publication date 4 July 2023

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/J.COR.2023.106199

zbMATH Keywords

container loading problemlarge neighbourhood search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Neighborhood structures for the container loading problem: a VNS implementation
• An Efficient Algorithm for Solving the Container Loading Problem
• A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
• A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
• A tabu search algorithm for weakly heterogeneous container loading problems

Cites work

• 3-D container packing heuristics
• A 3D-BPP approach for optimising stowage plans and terminal productivity
• A bottleneck assignment approach to the multiple container loading problem
• A comparative evaluation of heuristics for container loading
• A comparative review of 3D container loading algorithms
• A Genetic Algorithm for Solving the Container Loading Problem
• A global optimization approach for solving three-dimensional open dimension rectangular packing problems
• A heuristic for multiple container loading problems
• A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
• A hybrid genetic algorithm for the container loading problem
• A linear programming approach for the three-dimensional bin-packing problem
• A MIP approach for some practical packing problems: balancing constraints and tetris-like items
• A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
• 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 prototype column generation strategy for the multiple 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 analytical model for the container loading problem
• An efficient approach for the multi-pallet loading problem
• An improved typology of cutting and packing problems
• Applying spatial representation techniques to the container packing problem
• Constraints in container loading -- a state-of-the-art review
• Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
• Heuristics for container loading of furniture
• Heuristics for the container loading problem
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• MIP-based approaches for the container loading problem with multi-drop constraints
• Neighborhood structures for the container loading problem: a VNS implementation
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• Routing problems with loading constraints
• Solving a large multicontainer loading problem in the car manufacturing industry
• Solving container loading problems by block arrangement
• The exact solutions of several types of container loading problems
• The multiple container loading cost minimization problem
• Three-dimensional bin packing problem with variable bin height
• Three-dimensional container loading models with cargo stability and load bearing constraints
• Weight distribution considerations in container loading

Cited in

(6)

• A tabu search algorithm for weakly heterogeneous container loading problems
• Neighborhood structures for the container loading problem: a VNS implementation
• Combining an LNS-based approach and organizational mining for the resource replacement problem
• Unmanned surface vehicles (USVs) scheduling method by a bi-level mission planning and path control
• Mathematical modeling and heuristic solutions for container loading and routing problem: a case study in a cable manufacturing company
• Branch-and-repair for the stochastic three-dimensional bin selection problem: a multi-stage stochastic programming application

This page was built for publication: A large neighbourhood search algorithm for solving container loading problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6109572)