DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Hwang, Hark | - |
dc.contributor.advisor | 황학 | - |
dc.contributor.author | Park, Keum-Ae | - |
dc.contributor.author | 박금애 | - |
dc.date.accessioned | 2011-12-14T04:08:28Z | - |
dc.date.available | 2011-12-14T04:08:28Z | - |
dc.date.issued | 2007 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=264235&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/40767 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 산업공학과, 2007.2, [ iii, 46 p. ] | - |
dc.description.abstract | 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. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | heuristic | - |
dc.subject | orienteering | - |
dc.subject | genetic algorithm | - |
dc.subject | 유전알고리즘 | - |
dc.subject | 휴리스틱 | - |
dc.subject | 오리엔티어링 | - |
dc.title | Heuristic algorithms for a variant of orienteering problem | - |
dc.title.alternative | 용량제약이 있는 다경로 오리엔티어링 문제의 해법에 관한 연구 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 264235/325007 | - |
dc.description.department | 한국과학기술원 : 산업공학과, | - |
dc.identifier.uid | 020053204 | - |
dc.contributor.localauthor | Hwang, Hark | - |
dc.contributor.localauthor | 황학 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.