Profitable mixed capacitated arc routing and related problems

• Main Author: Benavent, Enrique
• Publication Date: 2013
• Other Authors: Corberán, Ángel, Gouveia, Luís, Mourão, M. Cândida, Pinto, Leonor Santiago
• Format: Article
• Language: por
• Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
• Download full: http://hdl.handle.net/10400.5/27816
• topic: Routing; Arc Routing Problems; Profits; Flow-based Models

Mixed Capacitated Arc Routing Problems (MCARP) aim to identify a set of vehicle trips that, starting and ending at a depot node, serve a given number of links, regarding the vehicles capacity, and minimizing a cost function. If both profits and costs on arcs are considered, the Profitable Mixed Capacitated Arc Routing Problem (PMCARP) may be defined. We present compact flow based models for the PMCARP, where two types of services are tackled, mandatory and optional. Adaptations of the models to fit into some other related problems are also proposed. The models are evaluated, according to their bounds quality as well as the CPU times, over large sets of test instances. New instances have been created from benchmark ones in order to solve variants that have been introduced here for the first time. Results show the new models performance within CPLEX and compare, whenever available, the proposed models against other resolution methods