Corberan, Á.; Fernandez, E.; Franquesa, C.; Sanchís Llopis, JM. (2011). The Windy Clustered Prize-Collecting Arc-Routing Problem. Transportation Science. 45(3):317-334. doi:10.1287/trsc.1110.0370
Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/30119
Title:
|
The Windy Clustered Prize-Collecting Arc-Routing Problem
|
Author:
|
Corberan, Ángel
Fernandez, Elena
Franquesa, Carles
Sanchís Llopis, José María
|
UPV Unit:
|
Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
|
Issued date:
|
|
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 ...[+]
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. © 2011 INFORMS.
[-]
|
Subjects:
|
Arc routing
,
Cutting plane algorithms
,
Polyhedral modelling
,
Arc routing problems
,
Computational experiment
,
Numerical results
,
Prize-collecting
,
Separation problems
,
Valid inequality
,
Profitability
,
Mathematical programming
|
Copyrigths:
|
Cerrado |
Source:
|
Transportation Science. (issn:
0041-1655
) (eissn:
1526-5447
)
|
DOI:
|
10.1287/trsc.1110.0370
|
Publisher:
|
INFORMS (Institute for Operations Research and Management Sciences)
|
Publisher version:
|
http://dx.doi.org/10.1287/trsc.1110.0370
|
Project ID:
|
info:eu-repo/grantAgreement/MICINN//MTM2009-14039-C06-02/ES/Modelos Y Metodos De Programacion Matematica Y Sus Aplicaciones (Optimos2)/ /
info:eu-repo/grantAgreement/MICINN//MTM2009-14039-C06-05/ES/Modelos Y Metodos De Programacion Matematica Y Sus Aplicaciones (Optimos2)/ /
|
Thanks:
|
The authors thank the Ministerio de Educacion y Ciencia of Spain ( Projects MTM2009-14039-C06-02 and MTM2009-14039-C06-05) for its support. They also thank the associate editor and three anonymous referees for their careful ...[+]
The authors thank the Ministerio de Educacion y Ciencia of Spain ( Projects MTM2009-14039-C06-02 and MTM2009-14039-C06-05) for its support. They also thank the associate editor and three anonymous referees for their careful reading of the manuscript and for their many comments and suggestions that contributed significantly to improving it.
[-]
|
Type:
|
Artículo
|