The Windy Clustered Prize-Collecting Arc-Routing Problem

Authors:
Ángel Corberán;Elena Fernández;Carles Franquesa;José María Sanchis
Affiliations:
Statistics and Operations Research Department, University of Valencia, 46100 Burjassot, Spain;Statistics and Operations Research Department, Technical University of Catalonia, 08034 Barcelona, Spain;Statistics and Operations Research Department, Technical University of Catalonia, 08034 Barcelona, Spain;Applied Mathematics Department, Technical University of Valencia, 46022 Valencia, Spain
Venue:
Transportation Science
Year:
2011

Citing 11
Cited 2

A cutting plane algorithm for minimum perfect 2-matchings

Computing
Very simple methods for all pairs network flow analysis

SIAM Journal on Computing
The Capacitated Arc Routing Problem: Valid Inequalities and Facets

Computational Optimization and Applications
Improvement Procedures for the Undirected Rural Postman Problem

INFORMS Journal on Computing
Privatized rural postman problems

Computers and Operations Research
The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm

Transportation Science
A branch & cut algorithm for the windy general routing problem and special cases

Networks
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra

SIAM Journal on Discrete Mathematics
Odd Minimum Cut Sets and $b$-Matchings Revisited

SIAM Journal on Discrete Mathematics
The Clustered Prize-Collecting Arc Routing Problem

Transportation Science
The undirected capacitated arc routing problem with profits

Computers and Operations Research

The time-dependent prize-collecting arc routing problem

Computers and Operations Research
GRASP and Path Relinking for the Clustered Prize-collecting Arc Routing Problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

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.