JOURNAL ARTICLE
ASYMMETRIC ORIENTEERING PROBLEM WITH PROFITABLE PENALTY.
Published In: Neural Network World, 2024, n. 3. P. 169 1 of 3
Database: The Belt and Road Initiative Reference Source 2 of 3
Authored By: Mocková, D.; Teichmann, D.; Sekničková, J.; Kuncová, M. 3 of 3
Abstract
This paper solves a modified version of the asymmetric traveling salesman problem with the possibility of omitting certain nodes and with a defined time limit for the total travel time, also referred to as the asymmetric orienteering problem (AOP). This problem belongs to the class of NP-hard problems. A proposed mathematical model maximizes the total score gained from visiting nodes within a predefined time limit. The possibility of exceeding the time limit, which results in a penalty to the total score, is also considered. The profitable penalty is examined, i.e., whether accepting the penalty can be advantageous for increasing the total score. The problem is demonstrated in a case study from the ski adventure race, organized in the Jizera Mountains in the Czech Republic. [ABSTRACT FROM AUTHOR]
Additional Information
- Source:Neural Network World. 2024/05, Issue 3, p169
- Document Type:Article
- Subject Area:Sports and Leisure
- Publication Date:2024
- ISSN:1210-0552
- DOI:10.14311/NNW.2024.34.009
- Accession Number:181718737
- Copyright Statement:Copyright of Neural Network World is the property of Czech Technical University in Prague, Faculty of Transportation Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Looking to go deeper into this topic? Look for more articles on EBSCOhost.