지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
이용수
초록· 키워드
오류제보하기
In most container terminals, containers are piled up and stored in a yard in order to utilize the space efficiently.
Hence, it requires unproductive container-handling operations to retrieve a container that is not placed on the top of a container stack. As a result, to streamline container-loading operations by which containers are transferred from a yard to a vessel, it is necessary to pre-marshal (i.e., shuffle in advance) containers in accordance with container-loading plan. We propose A* algorithm to find the optimal container-relocation sequence for the intra-bay container pre-marshalling problem. To work out the heuristic estimate for the proposed A* algorithm, we introduce the container rearrangement problem and obtain the lower bound of the length of the optimal relocation sequence. The performance of the algorithm is validated extensively by the numerical experiments on the problem instances that are given in the previous studies and generated randomly with various parameters.
Hence, it requires unproductive container-handling operations to retrieve a container that is not placed on the top of a container stack. As a result, to streamline container-loading operations by which containers are transferred from a yard to a vessel, it is necessary to pre-marshal (i.e., shuffle in advance) containers in accordance with container-loading plan. We propose A* algorithm to find the optimal container-relocation sequence for the intra-bay container pre-marshalling problem. To work out the heuristic estimate for the proposed A* algorithm, we introduce the container rearrangement problem and obtain the lower bound of the length of the optimal relocation sequence. The performance of the algorithm is validated extensively by the numerical experiments on the problem instances that are given in the previous studies and generated randomly with various parameters.
목차
1. 서론
2. 문제 정의
3. 최적 재정돈 계획
4. 최적 재배치 컨테이너 개수
5. 수치 실험
6. 결론
부록
참고문헌
참고문헌 (2)
참고문헌 신청
이 논문의 저자 정보
이 논문과 함께 이용한 논문
지형공간정보 및 최적탐색기법을 이용한 최적침투경로 분석
방수남
,
허준
,
손홍규
외 1명
대한토목학회논문집 D
2006
.01
청소로봇을 위한 지능형 온라인 경로계획 알고리즘 개발
신용우
,
최승윤
,
정태충
정보과학회논문지 : 소프트웨어 및 응용
2013
.10
3차원 격자지도 기반 생존성 극대화를 위한 다수 무인 항공기 임무경로 계획
김기태
,
전건욱
산업공학 (IE interfaces)
2012
.09
Hybrid Genetic Algorithm for the Multiple Container Packing Problem
신정호
,
풍설호
,
문일경
대한산업공학회 춘계공동학술대회 논문집
2011
.05
동적 환경을 위한 A* 알고리즘 기반의 경로 및 속도 프로파일 설계
권민혁
,
강연식
,
김창환
외 1명
제어로봇시스템학회 논문지
2011
.05
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-530-003629254