지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
이용수
초록· 키워드
오류제보하기
Most of the models for the vehicle routing problems studied in the literature assumed constant travel times.
However, those approaches may give infeasible solutions when traffic congestion causes delays in travel time.
To overcome such difficulty, there have been some researches considering the change of the travel time which is called the time dependent vehicle routing problem (TDVRP). TDVRP assumes that the travel time between two locations is not only affected by the distance traveled, but by many other factors including the time of the day. In this paper, we propose a branch-and-price algorithm to solve the TDVRP. The time dependent property of the travel time is dealt with an enumeration scheme with bounding procedures in the column generation procedure identifying a profitable route. The proposed algorithm guarantees the “Non-passing” property to be held in the solutions. The algorithm was tested on problems composed of the Solomon’s benchmark instances for 25 and 50 nodes. Computational results are reported.
However, those approaches may give infeasible solutions when traffic congestion causes delays in travel time.
To overcome such difficulty, there have been some researches considering the change of the travel time which is called the time dependent vehicle routing problem (TDVRP). TDVRP assumes that the travel time between two locations is not only affected by the distance traveled, but by many other factors including the time of the day. In this paper, we propose a branch-and-price algorithm to solve the TDVRP. The time dependent property of the travel time is dealt with an enumeration scheme with bounding procedures in the column generation procedure identifying a profitable route. The proposed algorithm guarantees the “Non-passing” property to be held in the solutions. The algorithm was tested on problems composed of the Solomon’s benchmark instances for 25 and 50 nodes. Computational results are reported.
목차
1. 서론
2. 관련 연구
3. 문제정의와 수리모형 구축
4. 알고리즘
5. 실험 결과 및 분석
6. 결론
참고 문헌
참고문헌 (19)
참고문헌 신청
Barnhart, C. / 1998 / Branch-and-price: Column generation for solving huge integer programs / Operations Research 46(3):316~329
Chabrier, A / 2006 / Vehicle Routing Problem with elementary shortest path based column generation / Computers and operations research 33:2972~2990
Danzig, G. B / 1959 / The truck dispatching Problem / Mgmt. Science 6:80~91
Desrochers, M. / 1992 / A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / Operations Research 40(2):342~354
Desrosiers, J. / 1995 / Time constrained routing and scheduling, In Handbooks in Operations Research and Management Science :35~139
Chabrier, A / 2006 / Vehicle Routing Problem with elementary shortest path based column generation / Computers and operations research 33:2972~2990
Danzig, G. B / 1959 / The truck dispatching Problem / Mgmt. Science 6:80~91
Desrochers, M. / 1992 / A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / Operations Research 40(2):342~354
Desrosiers, J. / 1995 / Time constrained routing and scheduling, In Handbooks in Operations Research and Management Science :35~139
이 논문의 저자 정보
이 논문과 함께 이용한 논문
시간의존 차량속도 환경에서 서비스 시간대가 존재하는 차량일정문제를 위한 페널티 알고리즘
손영덕
,
박양병
대한산업공학회 추계학술대회 논문집
2013
.11
도시철도 열차 승하차 시간 단축방안에 관한 연구
김정태
,
김무선
,
홍재성
외 2명
한국철도학회 학술발표대회논문집
2013
.05
운행비용을 최소로 하는 다용량 차량경로문제
임무균
,
전건욱
대한산업공학회 추계학술대회 논문집
2006
.11
서비스 시간대별 교통상황을 고려한 차량경로문제
김기태
,
전건욱
산업공학 (IE interfaces)
2009
.12
스쿨버스 라우팅 문제, 해법, 이슈
박준혁
,
김병인
,
위주영
대한산업공학회 추계학술대회 논문집
2008
.11
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-530-003636857