(A) greedy heuristic for the team orienteering problem다경로 오리엔티어링 문제에 대한 그리디 휴리스틱 해법에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 521
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorHwang, Hark-
dc.contributor.advisor황학-
dc.contributor.authorJi, Sang-Hoon-
dc.contributor.author지상훈-
dc.date.accessioned2011-12-14T04:09:44Z-
dc.date.available2011-12-14T04:09:44Z-
dc.date.issued2009-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=308699&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/40848-
dc.description학위논문(석사) - 한국과학기술원 : 산업및시스템공학과, 2009.2, [ iii, 32 p. ]-
dc.description.abstractThe 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.languageeng-
dc.publisher한국과학기술원-
dc.subjectTeam Orienteering Problem (TOP)-
dc.subjectGreedy method-
dc.subjectHeuristic algorithm-
dc.subject다경로 오리엔티어링 문제-
dc.subject그리디 해법-
dc.subject휴리스틱-
dc.subjectTeam Orienteering Problem (TOP)-
dc.subjectGreedy method-
dc.subjectHeuristic algorithm-
dc.subject다경로 오리엔티어링 문제-
dc.subject그리디 해법-
dc.subject휴리스틱-
dc.title(A) greedy heuristic for the team orienteering problem-
dc.title.alternative다경로 오리엔티어링 문제에 대한 그리디 휴리스틱 해법에 관한 연구-
dc.typeThesis(Master)-
dc.identifier.CNRN308699/325007 -
dc.description.department한국과학기술원 : 산업및시스템공학과, -
dc.identifier.uid020073566-
dc.contributor.localauthorHwang, Hark-
dc.contributor.localauthor황학-
Appears in Collection
IE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0