{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T01:23:56Z","timestamp":1774574636052,"version":"3.50.1"},"reference-count":31,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T00:00:00Z","timestamp":1713571200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Spanish Ministry of Science and Innovation","award":["PID2022-138860NB-I00"],"award-info":[{"award-number":["PID2022-138860NB-I00"]}]},{"name":"Spanish Ministry of Science and Innovation","award":["RED2022-134703-T"],"award-info":[{"award-number":["RED2022-134703-T"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>This paper addresses a multiobjective version of the Team Orienteering Problem (TOP). The TOP focuses on selecting a subset of customers for maximum rewards while considering time and fleet size constraints. This study extends the TOP by considering two objectives: maximizing total rewards from customer visits and maximizing visits to prioritized nodes. The MultiObjective TOP (MO-TOP) is formulated mathematically to concurrently tackle these objectives. A multistart biased-randomized algorithm is proposed to solve MO-TOP, integrating exploration and exploitation techniques. The algorithm employs a constructive heuristic defining biefficiency to select edges for routing plans. Through iterative exploration from various starting points, the algorithm converges to high-quality solutions. The Pareto frontier for the MO-TOP is generated using the weighted method, epsilon-constraint method, and Epsilon-Modified Method. Computational experiments validate the proposed approach\u2019s effectiveness, illustrating its ability to generate diverse and high-quality solutions on the Pareto frontier. The algorithms demonstrate the ability to optimize rewards and prioritize node visits, offering valuable insights for real-world decision making in team orienteering applications.<\/jats:p>","DOI":"10.3390\/computation12040084","type":"journal-article","created":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T09:53:52Z","timestamp":1713779632000},"page":"84","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Weighted and Epsilon-Constraint Biased-Randomized Algorithm for the Biobjective TOP with Prioritized Nodes"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1222-7988","authenticated-orcid":false,"given":"Lucia","family":"Agud-Albesa","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, Universitat Polit\u00e8cnica de Val\u00e8ncia, 03801 Alcoy, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7903-8591","authenticated-orcid":false,"given":"Neus","family":"Garrido","sequence":"additional","affiliation":[{"name":"Instituto de Matem\u00e1tica Multidisciplinar, Universitat Polit\u00e8cnica de Val\u00e8ncia, 46022 Valencia, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1392-1776","authenticated-orcid":false,"given":"Angel A.","family":"Juan","sequence":"additional","affiliation":[{"name":"Center for Research in Production Management and Engineering, Universitat Polit\u00e8cnica de Val\u00e8ncia, 03801 Alcoy, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-3006-2242","authenticated-orcid":false,"given":"Almudena","family":"Llorens","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, Universitat Polit\u00e8cnica de Val\u00e8ncia, 03801 Alcoy, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1995-2557","authenticated-orcid":false,"given":"Sandra","family":"Oltra-Crespo","sequence":"additional","affiliation":[{"name":"Technological Institute of Informatics, Universitat Polit\u00e8cnica de Val\u00e8ncia, 03801 Alcoy, Spain"}]}],"member":"1968","published-online":{"date-parts":[[2024,4,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","article-title":"The team orienteering problem","volume":"88","author":"Chao","year":"1996","journal-title":"Eur. J. Oper. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","article-title":"The orienteering problem","volume":"34","author":"Golden","year":"1987","journal-title":"Nav. Res. Logist."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","article-title":"Orienteering Problem: A survey of recent variants, solution approaches and applications","volume":"255","author":"Gunawan","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"ref_4","first-page":"1","article-title":"An iterated local search algorithm for the team orienteering problem with variable profits","volume":"0273","author":"Gunawan","year":"2018","journal-title":"Eng. Optim."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","article-title":"The orienteering problem: A survey","volume":"209","author":"Vansteenwegen","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1504\/EJIE.2020.108581","article-title":"Maximising reward from a team of surveillance drones: A simheuristic approach to the stochastic team orienteering problem","volume":"14","author":"Panadero","year":"2020","journal-title":"Eur. J. Ind. Eng."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Gosavi, A. (2015). Simulation-Based Optimization, Springer.","DOI":"10.1007\/978-1-4899-7491-4"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10732-006-9004-0","article-title":"Metaheuristics for the team orienteering problem","volume":"13","author":"Archetti","year":"2007","journal-title":"J. Heuristics"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.cie.2007.10.001","article-title":"Ants can solve the team orienteering problem","volume":"54","author":"Ke","year":"2008","journal-title":"Comput. Ind. Eng."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.ejor.2008.02.037","article-title":"A guided local search metaheuristic for the team orienteering problem","volume":"196","author":"Vansteenwegen","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","article-title":"Iterated local search for the team orienteering problem with time windows","volume":"36","author":"Vansteenwegen","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1016\/j.cor.2009.05.002","article-title":"A path relinking approach for the team orienteering problem","volume":"37","author":"Souffriau","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.cor.2009.05.012","article-title":"Heuristics for the multi-period orienteering problem with multiple time windows","volume":"37","author":"Tricoire","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/trsc.1110.0377","article-title":"The multiconstraint team orienteering problem with multiple time windows","volume":"47","author":"Souffriau","year":"2013","journal-title":"Transp. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.ejor.2013.11.038","article-title":"A fast solution method for the time-dependent orienteering problem","volume":"236","author":"Verbeeck","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1287\/trsc.2015.0584","article-title":"Large neighborhoods with implicit customer selection for vehicle routing problems with profits","volume":"50","author":"Vidal","year":"2016","journal-title":"Transp. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1080\/00207543.2017.1398425","article-title":"Field services design and management of natural gas distribution networks: A class of vehicle routing problem with time windows approach","volume":"56","author":"Paolucci","year":"2018","journal-title":"Int. J. Prod. Res."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Estrada-Moreno, A., Ferrer, A., Juan, A.A., Panadero, J., and Bagirov, A. (2020). The Non-Smooth and Bi-Objective Team Orienteering Problem with Soft Constraints. Mathematics, 8.","DOI":"10.3390\/math8091461"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"107776","DOI":"10.1016\/j.cie.2021.107776","article-title":"A GRASP to solve the multi-constraints multi-modal team orienteering problem with time windows for groups with heterogeneous preferences","volume":"162","author":"Brito","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"9412","DOI":"10.1109\/TNNLS.2022.3159671","article-title":"GAMMA: Graph attention model for multiple agents to Solve team orienteering problem With multiple depots","volume":"34","author":"Sankaran","year":"2022","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Panadero, J., Juan, A.A., Ghorbani, E., Faulin, J., and Pag\u00e8s-Bernaus, A. (2023). Solving the stochastic team orienteering problem: Comparing simheuristics with the sample average approximation method. Int. Trans. Oper. Res.","DOI":"10.1111\/itor.13302"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Wattanasaeng, N., and Ransikarbum, K. (2021). Model and Analysis of Economic- and Risk-Based Objective Optimization Problem for Plant Location within Industrial Estates Using Epsilon-Constraint Algorithms. Computation, 9.","DOI":"10.3390\/computation9040046"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Mohammadi, T., Sajadi, S.M., Najafi, S.E., and Taghizadeh-Yazdi, M. (2024). Multi Objective and Multi-Product Perishable Supply Chain with Vendor-Managed Inventory and IoT-Related Technologies. Mathematics, 12.","DOI":"10.3390\/math12050679"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"109862","DOI":"10.1016\/j.asoc.2022.109862","article-title":"A relax-and-fix Pareto-based algorithm for a bi-objective vaccine distribution network considering a mix-and-match strategy in pandemics","volume":"132","author":"Nikoubin","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"ref_25","first-page":"1018","article-title":"New multi-objective optimization model for tourism systems with fuzzy data and new algorithm for solving this model","volume":"59","author":"Shojatalab","year":"2022","journal-title":"Oper. Res. Soc. India"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"109472","DOI":"10.1016\/j.cie.2023.109472","article-title":"An epsilon-constraint-based exact multi-objective optimization approach for the ship schedule recovery problem in liner shipping","volume":"183","author":"Elmi","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"ref_27","unstructured":"Banerjee, A., Pradhan, S., Misra, B., and Chakraborty, S. (2024). Applied Multi-Objective Optimization, Springer Nature."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"111427","DOI":"10.1016\/j.asoc.2024.111427","article-title":"TSFIS-GWO: Metaheuristic-driven takagi-sugeno fuzzy system for adaptive real-time routing in WBANs","volume":"155","author":"Memarian","year":"2024","journal-title":"Appl. Soft Comput."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.cor.2013.09.011","article-title":"A two-stage approach to the orienteering problem with stochastic weights","volume":"43","author":"Evers","year":"2014","journal-title":"Comput. Oper. Res."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1111\/itor.12625","article-title":"Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility","volume":"26","author":"Savelsbergh","year":"2019","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Panadero, J., de Armas, J., Currie, C.S., and Juan, A.A. (2017, January 3\u20136). A simheuristic approach for the stochastic team orienteering problem. Proceedings of the 2017 Winter Simulation Conference (WSC), Las Vegas, NV, USA.","DOI":"10.1109\/WSC.2017.8248039"}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/12\/4\/84\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:31:30Z","timestamp":1760106690000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/12\/4\/84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,20]]},"references-count":31,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,4]]}},"alternative-id":["computation12040084"],"URL":"https:\/\/doi.org\/10.3390\/computation12040084","relation":{},"ISSN":["2079-3197"],"issn-type":[{"value":"2079-3197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,20]]}}}