Loading problem in multiple containers and pallets using strategic search method

MaRDI QIDQ5473514zbMATH OpenFDO

Authors Shigeyuki Takahara

Publication date 22 June 2006

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Inventory, storage, reservoirs (90B05) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A heuristic for multiple container loading problems
• Multiple Container Packing: A Case Study of Pipe Packing
• Loading Multiple Pallets
• An efficient approach for the multi-pallet loading problem
• Heuristics with a new block strategy for the single and multiple containers loading problems

Cited in

(9)

• How to use structural constraints to compute an upper bound for the pallet loading problem
• Solving a large multicontainer loading problem in the car manufacturing industry
• A parallel multi-population biased random-key genetic algorithm for a container loading problem
• The exact solutions of several types of container loading problems
• Multiple Container Packing: A Case Study of Pipe Packing
• The multiple container loading cost minimization problem
• Integrated packing and routing: a model and its solutions
• 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

This page was built for publication: Loading problem in multiple containers and pallets using strategic search method

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