In this paper, a best-first branch and bound algorithm based upon the bottom-up approach for the unweighted unconstrained two-dimensional cutting problem is proposed to find the optimal solution to the problem. The algorithm uses simple and effective meth

A new heuristic algorithm for the heterogeneous MCLP(Multiple Container Loading Problem) is proposed in this paper. In order to solve MCLP, this algorithm generates an initial solution by applying the new SCLP(Single Container Loading Problem) algorithm t

A new heuristic algorithm for the heterogeneous single container loading problem is proposed in this paper. This algorithm fills empty spaces with the homogeneous load-blocks of identically oriented boxes and splits residual space into three sub spaces st

A new heuristic algorithm for the heterogeneous single container loading problem is proposed in this paper. This algorithm fills empty spaces with the homogeneous load-blocks of identically oriented boxes and splits residual space into three sub spaces starting with an empty container. An initial loading pattern is built by applying this approach recursively until all boxes are exhausted or no empty spaces are left. In order to generate alternative loading patterns, the load-blocks of pattern determining spaces are replaced with the alternatives that were generated on determining the load-blocks. An improvement algorithm compares these alternatives with the initial pattern to find improved one. Numerical experiments with 715 test cases show the good performance of this new algorithm, above all for problems with strongly heterogeneous boxes.

This paper proposes the heuristic approach for the generalized GT(Group Technology) problem to consider the restrictions which are given the number of cell, maximum number of machines and minimum number of machines. This approach is classified into two st

This paper proposes the heuristic algorithm for the generalized GT problem to consider the restrictions which are given the number of cell, maximum number of machines and minimum number of machines. This algorithm is classified into two stages. First stage is the course to form machine cells. we use the similarity coefficient which proposed and calculate the similarity values about each pair of all machines and align these values descending order. If any machine which is composed of selected similarity coefficient is possible to link the other machine on the edge of machine cell and have regard to restrictions and different kind relation among machines in the machine cell, then we assign the machine to the machine cell. Next stage is the course to form part families using proposed grouping efficacy. This stage is also completed when every part is assigned to the machine cell. The results of using the proposed algorithm are compared to the Modified p-median model. The computational results show that the proposed algorithm provides a powerful means of solving the machine-part grouping problem.