지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 대한산업공학회 Industrial Engineering & Management Systems Industrial Engineering & Management Systems 제12권 제3호
- 발행연도
- 2013.9
- 수록면
- 198 - 206 (9page)
이용수
초록· 키워드
오류제보하기
The team orienteering problem (TOP) or the multiple tour maximum collection problem can be considered as a generic model that can be applied to a number of challenging applications in logistics, tourism, and other fields. This problem is generally defined as the problem of determining P paths, in which the traveling time of each path is limited by T<SUB>max</SUB> that maximizes the total collected score. In the TOP, a set of N vertices i is given, each with a score Si. The starting point (vertex 1) and the end point (vertex N) of all paths are fixed. The time tij needed to travel from vertex i to j is known for all vertices. Some exact and heuristics approaches had been proposed in the past for solving the TOP. This paper proposes a new solution methodology for solving the TOP using the particle swarm optimization, especially by proposing a solution representation and its decoding method. The performance of the proposed algorithm is then evaluated using several benchmark datasets for the TOP. The computational results show that the proposed algorithm using specific settings is capable of finding good solution for the corresponding TOP instance.
목차
ABSTRACT
1. INTRODUCTION
2. LITERATURE REVIEW
3. PSO FOR SOLVING TOP
4. COMPUTATIONAL RESULT
5. CONCLUSION AND FURTHER STUDY
REFERENCES
참고문헌 (18)
참고문헌 신청
1. [학술지(정기간행물)] - Ai, T. J. / 2009 / A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery / Computers & Operations Research 36 (5) : 1693 ~ 1702
2. [학술지(정기간행물)] - Archetti, C. / 2007 / Metaheuristic for the team orienteering problem / Journal of Heuristics 13 (1) : 49 ~ 76
3. [학술지(정기간행물)] - Butt, S. E. / 1994 / A heuristic for the multiple tour maximum collection problem / Computers & Operations Research 21 (1) : 101 ~ 111
4. [학술지(정기간행물)] - Chang, B. C. H. / 2004 / Particle swarm optimisation for protein motif discovery / Genetic Programming and Evolvable Machines 5 (2) : 203 ~ 214
5. [학술지(정기간행물)] - Chao, I. / 1996 / The team orienteering problem / European Journal of Operational Research 88 (3) : 464 ~ 474
2. [학술지(정기간행물)] - Archetti, C. / 2007 / Metaheuristic for the team orienteering problem / Journal of Heuristics 13 (1) : 49 ~ 76
3. [학술지(정기간행물)] - Butt, S. E. / 1994 / A heuristic for the multiple tour maximum collection problem / Computers & Operations Research 21 (1) : 101 ~ 111
4. [학술지(정기간행물)] - Chang, B. C. H. / 2004 / Particle swarm optimisation for protein motif discovery / Genetic Programming and Evolvable Machines 5 (2) : 203 ~ 214
5. [학술지(정기간행물)] - Chao, I. / 1996 / The team orienteering problem / European Journal of Operational Research 88 (3) : 464 ~ 474
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2014-500-002847983