지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국경영과학회 Management Science and Financial Engineering International Journal of Management Science Vol.17 No.1
- 발행연도
- 2011.5
- 수록면
- 79 - 94 (16page)
이용수
초록· 키워드
오류제보하기
Team orienteering, an extension of single?competitor orienteering, is the problem of determining multiple paths from a starting node to a finishing node for a given allowed time or distance limit fixed for each of the paths with the objective of maximizing the total collected score. Each path is through a subset of nodes, each of which has an associated score. The team orienteering problem has many applications such as home fuel delivery, college football players recruiting, service technicians scheduling, military operations, etc. Unlike existing optimal and heuristic algorithms often leading to heavy computation, this paper suggests two types of priority rule based heuristics?serial and parallel ones?that are especially suitable for practically large?sized problems. In the proposed heuristics, all nodes are listed in an order using a priority rule and then the paths are constructed according to this order. To show the performances of the heuristics, computational experiments were done on the small?to?medium sized benchmark instances and randomly generated large sized test instances, and the results show that some of the heuristics give reasonable quality solutions within very short computation time.
목차
ABSTRACT
1. Introduction
2. Problem Description
3. Solution Algorithms
4. Computational Experiments
5. Concluding Remarks
References
참고문헌 (18)
참고문헌 신청
Archetti, C. / 2007 / Metaheuristics for the team orienteering problem / Journal of Heuristics 13:49~76
Bouly, H. / 2008 / A memetic algorithm for the team orienteering problem / Lecture Notes in Computer Science 4974:649~658
Boussier, S. / 2007 / An exact algorithm for team orienteering problems / 4OR 5:211~230
Butt, S / 1994 / A heuristic for the multiple tour maximum collection problem / Computers and Operations Research 21:101~111
Chao, I. / 1996 / A fast and effective heuristic for the orienteering problem / European Journal of Operational Research 88:475~489
Bouly, H. / 2008 / A memetic algorithm for the team orienteering problem / Lecture Notes in Computer Science 4974:649~658
Boussier, S. / 2007 / An exact algorithm for team orienteering problems / 4OR 5:211~230
Butt, S / 1994 / A heuristic for the multiple tour maximum collection problem / Computers and Operations Research 21:101~111
Chao, I. / 1996 / A fast and effective heuristic for the orienteering problem / European Journal of Operational Research 88:475~489
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-325-000617026