Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Hyunjoon | - |
dc.contributor.author | Kim, Byung-In Send mail to Kim B.-I. | - |
dc.date.accessioned | 2023-09-11T01:38:00Z | - |
dc.date.available | 2023-09-11T01:38:00Z | - |
dc.date.issued | 2022-12 | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.issn | 1872-6860 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115266 | - |
dc.description.abstract | The multi-profit orienteering problem (MPOP), a variant of the orienteering problem, was introduced in 2020. In MPOP, each vertex has multiple profits, and a profit is determined by the time of visit. Therefore, the vertices to visit as well as the visit sequence and visit times must be optimally selected. The purpose of MPOP is to maximize the total profits collected from the vertices while satisfying the travel time limit constraint. To date, no exact algorithm has been developed for MPOP. This paper proposes a dynamic programming (DP)-based exact algorithm for MPOP for the first time. The proposed algorithm combines DP, ng-route relaxed DP, incumbent solution generation algorithms, and bounding rules. The proposed algorithm can obtain the optimal solutions for 33 previously unsolved benchmark instances and update the best solutions in 23 benchmark instances for MPOP. © 2022 Elsevier B.V. | - |
dc.format.extent | 17 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Elsevier BV | - |
dc.title | Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem | - |
dc.type | Article | - |
dc.publisher.location | 네델란드 | - |
dc.identifier.doi | 10.1016/j.ejor.2022.02.045 | - |
dc.identifier.scopusid | 2-s2.0-85127364077 | - |
dc.identifier.wosid | 000822928800004 | - |
dc.identifier.bibliographicCitation | European Journal of Operational Research, v.303, no.2, pp 550 - 566 | - |
dc.citation.title | European Journal of Operational Research | - |
dc.citation.volume | 303 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 550 | - |
dc.citation.endPage | 566 | - |
dc.type.docType | 정기학술지(Article(Perspective Article포함)) | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Business & Economics | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Management | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | TIME WINDOWS | - |
dc.subject.keywordPlus | RELAXATION | - |
dc.subject.keywordPlus | STRATEGIES | - |
dc.subject.keywordPlus | HEURISTICS | - |
dc.subject.keywordAuthor | Bounding | - |
dc.subject.keywordAuthor | Dynamic programming | - |
dc.subject.keywordAuthor | Exact approach | - |
dc.subject.keywordAuthor | Multi-profit orienteering problem | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0377221722001667?pes=vor | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
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.