A matheuristic for the Team Orienteering Arc Routing Problem

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 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.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.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.022S392401245