2021-04-122018-09-032018-05-081865092918650937SCOPUS;2-s2.0-85053994459http://hdl.handle.net/10784/27668In this paper we propose a new variant of the capacitated arc routing problem (CARP). In this new problem the objective function becomes a cumulative objective computed as the traveled distance multiplied by the vehicle load. A metaheuristic approach is proposed which is based on the hybridization of three known procedures: GRASP, VND and Set covering model. The metaheuristic is tested with some benchmark instances from CARP. The results allow to evaluate the performance with the different metaheuristic components and to compare the solutions with the classical objective function. © 2018, Springer Nature Switzerland AG.enghttps://v2.sherpa.ac.uk/id/publication/issn/1865-0929info:eu-repo/semantics/conferencePaperBenchmarkingCapacitated arc routing problemCumulative objectiveGRASPHybrid Meta-heuristicPost optimizationNetwork routing2018-06-172021-04-12Rivera, Juan CarlosLenis, Sergio Andres10.1007/978-3-030-00353-1_9