6533b861fe1ef96bd12c4efe
RESEARCH PRODUCT
A matheuristic for the Team Orienteering Arc Routing Problem
Isaac PlanaM. Grazia SperanzaJosé M. SanchisClaudia ArchettiÁNgel Corberánsubject
MatheuristicMathematical optimizationInformation Systems and ManagementGeneral Computer ScienceComputer scienceOrienteeringDirected graphManagement Science and Operations ResearchUpper and lower boundsIndustrial and Manufacturing EngineeringVertex (geometry)Constraint (information theory)Set (abstract data type)Routing problems with profitsArc routing problemModeling and SimulationBenchmark (computing)Team Orienteering ProblemDuration (project management)MATEMATICA APLICADAArc routingdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2015-09-01 |