Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10609/114166
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Reyes-Rubiano, Lorena Silvana | - |
dc.contributor.author | Juan, Angel A. | - |
dc.contributor.author | bayliss, christopher | - |
dc.contributor.author | Panadero Martínez, Javier | - |
dc.contributor.author | Faulin, Javier | - |
dc.contributor.author | Copado Mendez, Pedro Jesus | - |
dc.contributor.other | Universidad Pública de Navarra | - |
dc.contributor.other | Universitat Oberta de Catalunya. Internet Interdisciplinary Institute (IN3) | - |
dc.date.accessioned | 2020-05-18T15:08:41Z | - |
dc.date.available | 2020-05-18T15:08:41Z | - |
dc.date.issued | 2020-04-25 | - |
dc.identifier.citation | Reyes-Rubiano, L., Juan, A.A., Bayliss, C., Panadero, J., Faulin, J. & Copado, P. (2020). A biased-randomized learnheuristic for solving the team orienteering problem with dynamic rewards. Transportation Research Procedia, 47(), 680-687. doi: 10.1016/j.trpro.2020.03.147 | - |
dc.identifier.issn | 2352-1465MIAR | - |
dc.identifier.uri | http://hdl.handle.net/10609/114166 | - |
dc.description.abstract | In this paper we discuss the team orienteering problem (TOP) with dynamic inputs. In the static version of the TOP, a fixed reward is obtained after visiting each node. Hence, given a limited fleet of vehicles and a threshold time, the goal is to design the set of routes that maximize the total reward collected. While this static version can be efficiently tackled using a biased-randomized heuristic (BR-H), dealing with the dynamic version requires extending the BR-H into a learnheuristic (BR-LH). With that purpose, a 'learning' (white-box) mechanism is incorporated to the heuristic in order to consider the variations in the observed rewards, which follow an unknown (black-box) pattern. In particular, we assume that: (i) each node in the network has a 'base' or standard reward value; and (ii) depending on the node's position inside its route, the actual reward value might differ from the base one according to the aforementioned unknown pattern. As new observations of this black-box pattern are obtained, the white-box mechanism generates better estimates for the actual rewards after each new decision. Accordingly, better solutions can be generated by using this predictive mechanism. Some numerical experiments contribute to illustrate these concepts. | en |
dc.format.mimetype | application/pdf | - |
dc.language.iso | eng | - |
dc.publisher | Transportation Research Procedia | - |
dc.relation.ispartof | Transportation Research Procedia, 2020, 47() | - |
dc.relation.ispartofseries | Euro Working Group on Transportation Meeting (EWGT), Barcelona, 18-20 de setembre de 2019 | - |
dc.relation.uri | https://doi.org/10.1016/j.trpro.2020.03.147 | - |
dc.rights | CC BY-NC-ND | - |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | - |
dc.subject | transportation | en |
dc.subject | team orienteering problem | en |
dc.subject | learnheuristics | en |
dc.subject | dynamic inputs | en |
dc.subject | biased randomization | en |
dc.subject | transporte | es |
dc.subject | problema de orientación de equipos | es |
dc.subject | learnheurísticas | es |
dc.subject | entradas dinámicas | es |
dc.subject | aleatorización sesgada | es |
dc.subject | transport | ca |
dc.subject | problema d'orientació d'equips | ca |
dc.subject | entrades dinàmiques | ca |
dc.subject | aleatorització esbiaixada | ca |
dc.subject | learnheurístiques | ca |
dc.subject.lcsh | Heuristics | en |
dc.title | A biased-randomized learnheuristic for solving the team orienteering problem with dynamic rewards | - |
dc.type | info:eu-repo/semantics/conferenceObject | - |
dc.subject.lemac | Heurística | ca |
dc.subject.lcshes | Heurística | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | - |
dc.identifier.doi | 10.1016/j.trpro.2020.03.147 | - |
Aparece en las colecciones: | Conferències |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
A.Juan-TRP-2020-A-Biased-Randomized-Learnheuristic.pdf Restricted Access | 516,9 kB | Adobe PDF | Visualizar/Abrir Pedir una copia |
Comparte:
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons