지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술대회자료
- 저자정보
- 발행연도
- 2012.11
- 수록면
- 906 - 915 (10page)
이용수
초록· 키워드
오류제보하기
This paper introduces a large neighborhood search algorithm with a replacement procedure (LNSRP) for solving a special variant of vehicle routing problem, known as Team Orienteering Problem (TOP). In the TOP, a team of vehicles attempts to maximize the total rewards which are collected by visiting a subset of potential stops within a pre-specified time limit. The proposed large neighborhood search algorithm contains local search improvements and a replacement method. Computational experiments are conducted on the 387 benchmark problems of TOP. The results show that LNSRP can identify the best known solutions for 382 problems. And for the remaining 5 problems it can generate near best known solutions with gap of 21 which is compared to 31, the best known gap in the literature and we find a new best solution for an instance. We conclude that our LNSRP outperforms the state-of-the-art approaches for solving TOP.
목차
Abstract
1. Introduction
2. Literature review
3. Mathematical formulation
4. Proposed approach
5. Experimental results
6. Conclusions
References
Appendix Table
참고문헌 (0)
참고문헌 신청이 논문의 저자 정보
이 논문과 함께 이용한 논문
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2014-530-000999619