An exact depth-first algorithm for the pallet loading problem

Article Abstract:

A fast exact algorithm proposed to solve the pallet loading problem using depth-first approach is rapid in outputting substantial solutions. The principle of maximal breadth filling sequence, which has a vital role in revealing the search tree, is developed to reduce the size of the search tree. The algorithm performed very well on problems of size 50 and less. Efforts to solve bigger problems substantially within equitable time is continuous.

Showcase, Partition, Shelving, and Locker Manufacturing, Partitions and fixtures, except wood, Packing and crating, Pallet & Stacking Racks, Packing & Crating Svcs, Operations research, Management science, Models, Management, Materials handling, Pallets (Shipping, storage, etc.), Pallets (Platforms), Packaging services

---

Move based heuristics for the unidirectional loop network layout problem

Article Abstract:

Two-move based heuristics called move and move/interchange were developed to address a manufacturing system's loop network layout problem. The heuristics developed utilize the idea of positional moves and local improvement algorithms. Results obtained from computational experimentation showed that the heuristics were able to outperform a popular pairwise interchange heuristic.

Research and Development in the Physical, Engineering, and Life Sciences, Mathematics, Research, Analysis, Evaluation, Algorithms, Heuristic, Ring networks, Heuristics (Psychology), Token ring networks

---

Similar abstracts:

• Abstracts: A new aggregation-disaggregation algorithm. The capacitated plant location problem
• Abstracts: Coupling the auxiliary problem principle with descent methods of pseudoconvex programming. Modeling muddles: validation beyond the numbers

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.