- -

A matheuristic for the Team Orienteering Arc Routing Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A matheuristic for the Team Orienteering Arc Routing Problem

Show full item record

Archetti, 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. doi:10.1016/j.ejor.2015.03.022

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/70783

Files in this item

Item Metadata

Title: A matheuristic for the Team Orienteering Arc Routing Problem
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat
Issued date:
Abstract:
In 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 ...[+]
Subjects: Team Orienteering Problem , Arc routing problem , Routing problems with profits , Matheuristic
Copyrigths: Reserva de todos los derechos
Source:
European Journal of Operational Research. (issn: 0377-2217 ) (eissn: 1872-6860 )
DOI: 10.1016/j.ejor.2015.03.022
Publisher:
Elsevier
Publisher version: http://dx.doi.org/10.1016/j.ejor.2015.03.022
Thanks:
Angel 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.[+]
Type: Artículo

This item appears in the following Collection(s)

Show full item record