A prototype column generation strategy for the multiple container loading problem
From MaRDI portal
Publication:1926980
DOI10.1016/j.ejor.2012.05.039zbMath1253.90014MaRDI QIDQ1926980
Weili Huang, Wenbin Zhu, Andrew E. B. Lim
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.05.039
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
90B10: Deterministic network models in operations research
90C27: Combinatorial optimization
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
A block-based layer building approach for the 2D guillotine strip packing problem, A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem, The multiple container loading problem with preference, A heuristic algorithm for container loading of pallets with infill boxes, A bidirectional building approach for the 2D constrained guillotine knapsack packing problem, A MIP-based slicing heuristic for three-dimensional bin packing, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, Three-stage heuristic algorithm for three-dimensional irregular packing problem, The exact solutions of several types of container loading problems, A matheuristic framework for the three-dimensional single large object placement problem with practical constraints, A comparative review of 3D container loading algorithms, A global optimization approach for solving three-dimensional open dimension rectangular packing problems
Uses Software
Cites Work
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- The multiple container loading cost minimization problem
- An efficient approach for the multi-pallet loading problem
- Solving container loading problems by block arrangement
- Heuristic algorithms for the three-dimensional bin packing problem
- A bottleneck assignment approach to the multiple container loading problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- 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
- The two-dimensional bin packing problem with variable bin sizes and costs
- An improved typology of cutting and packing problems
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- A Tree Search Algorithm for Solving the Container Loading Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- A Maximal-Space Algorithm for the Container Loading Problem
- A Parallel Genetic Algorithm for Solving the Container Loading Problem
- A parallel hybrid local search algorithm for the container loading problem
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- Routing with time windows by column generation
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- The Three-Dimensional Bin Packing Problem
- Loading Multiple Pallets
- Selected Topics in Column Generation
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Column Generation Approaches to a Robust Airline Crew Pairing Model For Managing Extra Flights
