DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Hwang, Hark | - |
dc.contributor.advisor | 황학 | - |
dc.contributor.author | Ji, Sang-Hoon | - |
dc.contributor.author | 지상훈 | - |
dc.date.accessioned | 2011-12-14T04:09:44Z | - |
dc.date.available | 2011-12-14T04:09:44Z | - |
dc.date.issued | 2009 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=308699&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/40848 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 산업및시스템공학과, 2009.2, [ iii, 32 p. ] | - |
dc.description.abstract | The Team Orienteering problem (TOP) is a variant of the Vehicle Routing Problem. In the TOP, a set of nodes (customers) is given, each with a reward. The objective is to determine a fixed number of tours, limited in travel time, that visit some nodes and maximize the collected rewards. In this study, we propose the greedy method to construct of the tours, and then improvement steps are applied. The algorithm is compared with the other heuristics of the literature and applied on a large problem set. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Team Orienteering Problem (TOP) | - |
dc.subject | Greedy method | - |
dc.subject | Heuristic algorithm | - |
dc.subject | 다경로 오리엔티어링 문제 | - |
dc.subject | 그리디 해법 | - |
dc.subject | 휴리스틱 | - |
dc.subject | Team Orienteering Problem (TOP) | - |
dc.subject | Greedy method | - |
dc.subject | Heuristic algorithm | - |
dc.subject | 다경로 오리엔티어링 문제 | - |
dc.subject | 그리디 해법 | - |
dc.subject | 휴리스틱 | - |
dc.title | (A) greedy heuristic for the team orienteering problem | - |
dc.title.alternative | 다경로 오리엔티어링 문제에 대한 그리디 휴리스틱 해법에 관한 연구 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 308699/325007 | - |
dc.description.department | 한국과학기술원 : 산업및시스템공학과, | - |
dc.identifier.uid | 020073566 | - |
dc.contributor.localauthor | Hwang, Hark | - |
dc.contributor.localauthor | 황학 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.