An efficient approach for the multi-pallet loading problem

From MaRDI portal
Publication:1569940

DOI10.1016/S0377-2217(99)00263-5zbMath0967.90040MaRDI QIDQ1569940

Johannes Terno, Guntram Scheithauer, Uta Sommerweiß, Jan Riehme

Publication date: 9 July 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)




Related Items

Algorithmic analysis of priority-based bin packing, MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS, A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem, A heuristic for solving large bin packing problems in two and three dimensions, The multiple container loading problem with preference, A heuristic algorithm for container loading of pallets with infill boxes, An improved typology of cutting and packing problems, A 3D-BPP approach for optimising stowage plans and terminal productivity, Solving a large multicontainer loading problem in the car manufacturing industry, On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints, A reference length approach for the 3D strip packing problem, A new iterative-doubling greedy-lookahead algorithm for the single container loading problem, A prototype column generation strategy for the multiple container loading problem, A beam search algorithm for the biobjective container loading problem, A large neighbourhood search algorithm for solving container loading problems, The multiple container loading problem with loading docks, Modeling soft unloading constraints in the multi-drop container loading problem, Priority-based bin packing with subset constraints, A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, The multiple container loading cost minimization problem, Solving packing problems by a distributed global optimization algorithm, Layer-layout-based heuristics for loading homogeneous items into a single container, A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach, AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS, A new load balance methodology for container loading problem in road transportation, A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints, Analysing trade‐offs in container loading: combining load plan construction heuristics with agent‐based simulation, 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, A fast heuristic for a three-dimensional non-convex domain loading problem, Packing of convex polytopes into a parallelepiped, A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application, Three-dimensional packing of items with limited load bearing strength, Solving container loading problems by block arrangement, Constraints in container loading -- a state-of-the-art review



Cites Work