A matheuristic for the Team Orienteering Arc Routing Problem

Vista sencilla de ítem
dc.contributor.authorArchetti, Claudiaes_ES
dc.contributor.authorCorberan, Angeles_ES
dc.contributor.authorPlana, Isaaces_ES
dc.contributor.authorSanchís Llopis, José Maríaes_ES
dc.contributor.authorSperanza, M. G.es_ES
dc.contributor.funderMinisterio de Economía y Competitividades_ES
dc.contributor.funderGeneralitat Valencianaes_ES
dc.date.accessioned2016-09-30T09:15:21Z
dc.date.available2016-09-30T09:15:21Z
dc.date.issued2015-09-01
dc.description.abstractIn the Team OrienteeringArc Routing Problem (TOARP) the potential customers are located on the arcs of a directed graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for the TOARP and test it on a set of benchmark instances for which the optimal solution or an upper bound is known. The matheuristic finds the optimal solutions on all, except one, instances of one of the four classes of tested instances (with up to 27 vertices and 296 arcs). The average error on all instances fo rwhich the optimal solution is available is 0.67 percent.es_ES
dc.description.accrualMethodSes_ES
dc.description.bibliographicCitationArchetti, C.; Corberan, A.; Plana, I.; Sanchís Llopis, JM.; Speranza, MG. (2015). A matheuristic for the Team Orienteering Arc Routing Problem. European Journal of Operational Research. 245(2):392-401. https://doi.org/10.1016/j.ejor.2015.03.022es_ES
dc.description.issue2es_ES
dc.description.sponsorshipAngel Corberan, Isaac Plana and Jose M. Sanchis wish to thank the Ministerio de Economia y Competitividad (project MTM2012-36163-C06-02) of Spain and the Generalitat Valenciana (project GVPROMETEO2013-049) for their support.en_EN
dc.description.upvformatpfin401es_ES
dc.description.upvformatpinicio392es_ES
dc.description.volume245es_ES
dc.identifier.doi10.1016/j.ejor.2015.03.022
dc.identifier.eissn1872-6860
dc.identifier.issn0377-2217
dc.identifier.urihttps://riunet.upv.es/handle/10251/70783
dc.languageIngléses_ES
dc.publisherElsevieres_ES
dc.relation.ispartofEuropean Journal of Operational Researches_ES
dc.relation.projectIDinfo:eu-repo/grantAgreement/MINECO//MTM2012-36163-C06-02/ES/MODELOS Y METODOS DE PROGRAMACION MATEMATICA Y SUS APLICACIONES (OPTIMOS3)/es_ES
dc.relation.projectIDinfo:eu-repo/grantAgreement/GVA//PROMETEO%2F2013%2F049/ES/Modelos y algoritmos para problemas de optimización combinatoria/es_ES
dc.relation.publisherversionhttp://dx.doi.org/10.1016/j.ejor.2015.03.022es_ES
dc.relation.senia292927es_ES
dc.rightsReserva de todos los derechoses_ES
dc.rights.accessRightsAbiertoes_ES
dc.subjectTeam Orienteering Problemes_ES
dc.subjectArc routing problemes_ES
dc.subjectRouting problems with profitses_ES
dc.subjectMatheuristices_ES
dc.subject.classificationMATEMATICA APLICADAes_ES
dc.titleA matheuristic for the Team Orienteering Arc Routing Problemes_ES
dc.typeArtículoes_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
dspace.entity.typePublication
upv.uuid8b2a7373-d800-484c-a272-93ed9bfea011es_ES

Archivos

Bloque original

Mostrando 1 - 2 de 2
Miniatura
Nombre:
heuristic_toarp_r7.pdf
Tamaño:
461.93 KB
Formato:
Adobe Portable Document Format
Descripción:
Versión del Autor.
[object Object] Descargar
Miniatura
Nombre:
C. Archetti;A. Corberán;ISAAC PLANA - A matheuristic for the Team Orienteering Arc Routing Problem.pdf
Tamaño:
586.21 KB
Formato:
Adobe Portable Document Format
Descripción:
Versión editorial
Descargar

Colecciones

Artículos, conferencias, monografías