The Windy Clustered Prize-Collecting Arc-Routing Problem

Ángel Corberán (), Elena Fernández (), Carles Franquesa () and José María Sanchis ()
Additional contact information
Ángel Corberán: Statistics and Operations Research Department, University of Valencia, 46100 Burjassot, Spain
Elena Fernández: Statistics and Operations Research Department, Technical University of Catalonia, 08034 Barcelona, Spain
Carles Franquesa: Statistics and Operations Research Department, Technical University of Catalonia, 08034 Barcelona, Spain
José María Sanchis: Applied Mathematics Department, Technical University of Valencia, 46022 Valencia, Spain

Transportation Science, 2011, vol. 45, issue 3, 317-334

Abstract: This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed.

Keywords: arc routing; polyhedral modelling; cutting plane algorithms (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1110.0370 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:45:y:2011:i:3:p:317-334

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().