인문학
사회과학
자연과학
공학
의약학
농수해양학
예술체육학
복합학
DBpia AI
AI 에이전트
AI 아이디어
AI 리더
AI 뷰어
Citeasy
크롬 서지관리 다운로드
지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
피인용 0
초록·키워드
Container ships approach at container terminal equipped with facilities for loading and unloading containers. Most container ships operate on pre-planned routes and regularly dock at terminals in specific ports. In addition, the shipping company that oversees the ship’s operation plan enters into a terminal-only contract with a specific terminal operator within the port, and calls only at the terminal on a set date and time. Therefore, multiple ships docking at a single berth in a specific terminal do not overlap in terms of their work dates and times, resulting in an idle interval between ships. During the idle interval, no ships are available, so no unloading work is done at the terminal. If ships continuously dock at the terminal and unload cargo without an idle interval, the terminal’s productivity increases as the amount of containers unloaded per hour increases, and the port authority that manages and operates the port increases its revenue in the form of port facility usage fees. In addition, shipping companies benefit from the timely transport of cargo through the continuous port calls of ships, thereby activating import and export logistics. Therefore, the efficient use of idle interval is an important issue in maritime logistics. In this paper, we study how to maximize the value generated by deploying feeder ships of various sizes in the idle waiting section between ships whose work is planned in advance. In order to consider the research methodology, we review previous studies on Berth Planning. In addition, we establish a Bin packing model that maximizes the sum of the values of feeder ships, and then use the actual terminal berth schedule data to deploy feeder ships and present an efficient utilization method of the idle waiting section.
본문·목차
인공지능 문자 인식 모델을 통해 추출된 텍스트로, 일부 오타나 오류가 포함될 수 있으나 지속적으로 개선 중입니다.
오류를 발견하셨다면 해당 부분을 드래그한 후 ' 를 통해 신고해주세요.
오류를 발견하셨다면 해당 부분을 드래그한 후 ' 를 통해 신고해주세요.
최근 본 자료 전체보기
UCI(KEPA) : I410-151-25-02-092168985
