지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국경영과학회 Management Science and Financial Engineering Management Science and Financial Engineering Vol.18 No.1
- 발행연도
- 2012.5
- 수록면
- 27 - 37 (11page)
이용수
초록· 키워드
오류제보하기
This paper is motivated by a military cargo-plane routing problem which is a pickup-and-delivery problem in which load splits and node revisits are allowed (PDPLS). Although this recent evolution of a VRP-model enhances the efficiency of routing, a solution method is more of a challenge since the node revisits entail closed walks in modeling vehicle routes. For such a case, even a compact IP-formulation is not available and an effective method had been lacking until Nowak et al. (2008b) proposed a heuristic based on a tabu search. Their method provides very reasonable solu-tions as demonstrated by the experiments not only in their paper (Nowak et al., 2008b) but also in ours. However, the computation time seems intensive especially for the class of problems with dynamic transportation requests, including the military cargo-plane routing problem. This paper proposes a more scalable algorithm hybridizing a tabu search for pricing subproblem paused as a single-vehicle routing problem, with a column generation approach based on Dantzig-Wolfe decomposition. As tested on a wide variety of instances, our algorithm produces, in average, a solution of an equiva-lent quality in 10~20% of the computation time of the previous method.
목차
ABSTRACT
1. INTRODUCTION
2. RELATED WORKS
3. THE ALGORITHM
4. EXPERIMENTAL RESULTS
5. CONCLUSION AND FURTHER RESEARCH
ACKNOWLEDGMENT
REFERENCES
참고문헌 (41)
참고문헌 신청
1. [학술지(정기간행물)] - Aldaihani, M. / 2003 / Hybrid scheduling methods for paratransit operations / Computers and Industrial Engineering 45 : 75 ~ 96
2. [학술지(정기간행물)] - Andersson, H. / 2011 / The maritime pickup and delivery problem with time windows and split loads / INFOR 49 : 79 ~ 91
3. [학술지(정기간행물)] - Archetti, C. / 2006 / A tabu search algorithm for the split delivery vehicle rout-ing problems / Transportation Science 40 (11) : 64 ~ 73
4. [학술지(정기간행물)] - Archetti, C / 2008 / An optimization-based heuristic for the split de-livery vehicle routing problem / Transportation Science 42 (1) : 22 ~ 31
5. [학술지(정기간행물)] - Archetti, C. / 2008 / To split or not to split: That is the question / Tran-sportation Research Part E 44 : 114 ~ 123
2. [학술지(정기간행물)] - Andersson, H. / 2011 / The maritime pickup and delivery problem with time windows and split loads / INFOR 49 : 79 ~ 91
3. [학술지(정기간행물)] - Archetti, C. / 2006 / A tabu search algorithm for the split delivery vehicle rout-ing problems / Transportation Science 40 (11) : 64 ~ 73
4. [학술지(정기간행물)] - Archetti, C / 2008 / An optimization-based heuristic for the split de-livery vehicle routing problem / Transportation Science 42 (1) : 22 ~ 31
5. [학술지(정기간행물)] - Archetti, C. / 2008 / To split or not to split: That is the question / Tran-sportation Research Part E 44 : 114 ~ 123
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-325-002862212