메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술대회자료
저자정보
Byungju Goo (Seoul National University) Junyoung Kim (Seoul National University) Kyungsik Lee (Seoul National University)
저널정보
대한산업공학회 대한산업공학회 추계학술대회 논문집 2020년 대한산업공학회 추계학술대회
발행연도
2020.11
수록면
621 - 629 (9page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
In this thesis, we study the airport gate assignment problem under uncertainty in arrival and departure times of flights which may cause overlaps between flights assigned to the same gate. In this respect, we establish a gate assignment schedule where overlaps between flights are prevented with probabilistic guarantees, while maximizing the total gate assignment preferences. We propose a network-based integer programming model with chance constraints that limit the probability of an overlap occurrence in each gate less than a given threshold value, for which the probability that a pair of flights overlaps is predicted based on historical data. We also propose a strengthened integer programming model for the problem based on the concept of gate-assignment patterns, and devise a branch-and-price algorithm to solve the model. Computational experiments are conducted with real and artificial instances which are based on the real data of Incheon International Airport in 2019. The results show the efficiency of the proposed algorithm as well as the robustness of the derived schedules compared to the existing approaches.

목차

Abstract
1. Introduction
2. Models for OCAGAP
3. Prediction of Overlap Probabilities
4. Solution Approach for Pattern-based Model
5. Computational Results
6. Conclusion
References

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0