Heuristic algorithms for a variant of orienteering problem = 용량제약이 있는 다경로 오리엔티어링 문제의 해법에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 386
  • Download : 0
This study deals with a variant of the orienteering problem faced by managers of some department stores during peak-sale periods. We want to find a set of paths to be traveled by each vehicle that leaves a department store and arrives at a specified destination after visiting customers. The problem is formulated into the mathematical model with the objective of maximizing the sum of the rewards collected by the vehicles within a given time limit and a given capacity constraint. Since the problem is known to be NP-hard, a heuristic algorithm and a priority-based Genetic Algorithm (pGA) are developed to find the solution. For small sized problems, the performances of the algorithms are compared with the optimum solutions obtained from CPLEX.
Advisors
Hwang, Harkresearcher황학researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
2007
Identifier
264235/325007  / 020053204
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 산업공학과, 2007.2, [ iii, 46 p. ]

Keywords

heuristic; orienteering; genetic algorithm; 유전알고리즘; 휴리스틱; 오리엔티어링

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