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

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 296
  • Download : 0
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.
Advisors
Hwang, Harkresearcher황학researcher
Description
한국과학기술원 : 산업및시스템공학과,
Publisher
한국과학기술원
Issue Date
2009
Identifier
308699/325007  / 020073566
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 산업및시스템공학과, 2009.2, [ iii, 32 p. ]

Keywords

Team Orienteering Problem (TOP); Greedy method; Heuristic algorithm; 다경로 오리엔티어링 문제; 그리디 해법; 휴리스틱; Team Orienteering Problem (TOP); Greedy method; Heuristic algorithm; 다경로 오리엔티어링 문제; 그리디 해법; 휴리스틱

URI
http://hdl.handle.net/10203/40848
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=308699&flag=dissertation
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