Priority Rule Based Heuristics for the Team Orienteering Problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ha, Kyoung-Woon | - |
dc.contributor.author | Yu, Jae-Min | - |
dc.contributor.author | Park, Jong-In | - |
dc.contributor.author | Lee, Dong-Ho | - |
dc.date.accessioned | 2022-07-16T20:43:32Z | - |
dc.date.available | 2022-07-16T20:43:32Z | - |
dc.date.created | 2021-05-13 | - |
dc.date.issued | 2011-05 | - |
dc.identifier.issn | 2287-2043 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/168492 | - |
dc.description.abstract | Team orienteering, an extension of single-competitor orienteering, is the problem of determining multiple paths from a starting node to a finishing node for a given allowed time or distance limit fixed for each of the paths with the objective of maximizing the total collected score. Each path is through a subset of nodes, each of which has an associated score. The team orienteering problem has many applications such as home fuel delivery, college football players recruiting, service technicians scheduling, military operations, etc. Unlike existing optimal and heuristic algorithms often leading to heavy computation, this paper suggests two types of priority rule based heuristics-serial and parallel ones-that are especially suitable for practically large-sized problems. In the proposed heuristics, all nodes are listed in an order using a priority rule and then the paths are constructed according to this order. To show the performances of the heuristics, computational experiments were done on the small-to-medium sized benchmark instances and randomly generated large sized test instances, and the results show that some of the heuristics give reasonable quality solutions within very short com-putation time. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | 한국경영과학회 | - |
dc.title | Priority Rule Based Heuristics for the Team Orienteering Problem | - |
dc.title.alternative | Priority Rule Based Heuristics for the Team Orienteering Problem | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Dong-Ho | - |
dc.identifier.bibliographicCitation | MSFE (Management Science and Financial Engineering), v.17, no.1, pp.79 - 94 | - |
dc.relation.isPartOf | MSFE (Management Science and Financial Engineering) | - |
dc.citation.title | MSFE (Management Science and Financial Engineering) | - |
dc.citation.volume | 17 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 79 | - |
dc.citation.endPage | 94 | - |
dc.type.rims | ART | - |
dc.identifier.kciid | ART001555051 | - |
dc.description.journalClass | 2 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | kci | - |
dc.subject.keywordAuthor | Logistics | - |
dc.subject.keywordAuthor | Team Orienteering | - |
dc.subject.keywordAuthor | Heuristics | - |
dc.subject.keywordAuthor | Priority Rules | - |
dc.identifier.url | https://scienceon.kisti.re.kr/srch/selectPORSrchArticle.do?cn=JAKO201119342676032&dbt=NART | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.