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.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

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.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

On the single-assignment p-hub center problem

Article Abstract:

A new study investigates the single-assignment p-hub center location problem, focusing on different linearizations of the basic model and a new model.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code: