Profitable mixed capacitated arc routing and related problems

• Enrique Benavent ^[1] ; Ángel Corberán ^[1] ; Luís Gouveia ^[2] ; Maria Cândida Mourão ^[3] ; Leonor Santiago Pinto ^[4]
  1. [1] Universitat de València

     Universitat de València

     Valencia, España

     
  2. [2] Universidade de Lisboa

     Universidade de Lisboa

     Socorro, Portugal

     
  3. [3] Centro de Investigação Operacional, Portugal
  4. [4] CEMAPRE, Portugal

  Mostrar afiliaciones +
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 23, Nº. 1, 2015, págs. 244-274
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • Mixed capacitated arc routing problems aim to identify a set of vehicle tours that, starting and ending at a depot node, serve a given number of links at minimum cost, while satisfying the vehicles capacity. If both profits and costs on arcs are considered, we may define the profitable mixed capacitated arc routing problem (PMCARP). In this paper 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 to the CPU times, over large sets of test instances. New instances have been created for some 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.