Please use this identifier to cite or link to this item:
Author(s): Constantino, M.
Gouveia, L.
Mourão, M. C.
Nunes, A. C.
Date: 2015
Title: The mixed capacitated arc routing problem with non-overlapping routes
Volume: 244
Number: 2
Pages: 445 - 456
ISSN: 0377-2217
DOI (Digital Object Identifier): 10.1016/j.ejor.2015.01.042
Keywords: Routing
Integer linear programming
District design
Capacitated arc routing
Abstract: Real world applications for vehicle collection or delivery along streets usually lead to arc routing problems, with additional and complicating constraints. In this paper we focus on arc routing with an additional constraint to identify vehicle service routes with a limited number of shared nodes, i.e. vehicle service routes with a limited number of intersections. This constraint leads to solutions that are better shaped for real application purposes. We propose a new problem, the bounded overlapping MCARP (BCARP), which is defined as the mixed capacitated arc routing problem (MCARP) with an additional constraint imposing an upper bound on the number of nodes that are common to different routes. The best feasible upper bound is obtained from a modified MCARP in which the minimization criteria is given by the overlapping of the routes. We show how to compute this bound by solving a simpler problem. To obtain feasible solutions for the bigger instances of the KARP heuristics are also proposed. Computational results taken from two well known instance sets show that, with only a small increase in total time traveled, the model BCARP produces solutions that are more attractive to implement in practice than those produced by the MCARP model
Peerreviewed: yes
Access type: Open Access
Appears in Collections:DMQGE-RI - Artigos em revistas internacionais com arbitragem científica

Files in This Item:
File Description SizeFormat 
Eur_Journal_of_Oper_Res.pdfPré-print1,83 MBAdobe PDFView/Open

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis Logotipo do Orcid 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.