We developed two heuristic methods to solve the problem considering a fleet of ships delivering chemical products from terminals We need to decide how much of each product to carry, on which ship, subject to the conditions that all terminals must have suf
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
This paper dealt with a kind of heterogeneous vehicle routing problem with known demand and time deadline of customers. The customers are supposed to have one of tight deadline and loose deadline. The demand of customers with tight deadline must be fulfil
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 study is concerned with developing a hybrid heuristic algorithm for solving the redundancy optimization problem which is very important in system safety, This study develops a HH(Hybrid Heuristic) method combined with two strategies to alleviate the risks of being trapped at a local optimum. One of them is to construct the populations of the initial solutions randomly. The other is the additional search with SA(Simulated Annealing) method in final step. Computational results indicate that HH performs consistently better than the KY method proposed in Kim[8]. Therefore, the proposed HH is believed to an attractive to other heuristic methods.
본 연구는 컨테이너 터미널에서 선박의 선적작업을 위한 선석배정 및 크레인 할당문제를 동시에 결정하는 문제를 다루고 있다. 실제 컨테이너 터미널에서 고려하고 있는 다양한 형태의 제약을 고려하여 선석계획 및 크레인할당 문제에 대한 혼합정수모델을 제시하였다. 제안된 문제에 대해 좋은 해를 짧은 시간 안에 구하기 위하여 발견적 해법을 제시하였다. 또한 수치예제를 이용하여 제시된 발견적 기법의 수행도를 비교분석하였다. 분석결과 제시된 기법은 짧은 시간 안에 좋은 해를 제공하는 것으로 나타났다.
컨테이너 터미널에서는 효율적인 선적 작업을 위해 선박이 입항하기 전 선박정보를 통해 선적 계획을 수립한다. 하지만 실제 선박이 터미널에 입항하여 안벽에 접안후의 실제 적재 상태가 계획 시점에서의 적재상태와 다르거나, 사전에 수립된 계획이 실행 불가능한 경우 등의 상황이 발생한다. 이에 따라 기존에 수립했던 계획을 즉각적으로 재수정 해야 하며, 이를 위한 해법의 연구가 필요하게 되었다. 이점에 착안하여 본 연구에서는 위에서 언급한 예기치 못한 상황에 대해 정리하고, 상황에 맞는 합리적이고 즉각적으로 활용이 가능한 실시간 선적계획 모델을 제시하였다.