The undirected capacitated arc routing problem with profits

Abstract : A profit and a demand are associated with each edge of a set of profitable edges of a given graph. A travel time is associated with each edge of the graph. A fleet of capacitated vehicles is given to serve the profitable edges. A maximum duration of the route of each vehicle is also given. The profit of an edge can be collected by one vehicle only that also serves the demand of the edge. The objective of this problem, which is called the undirected capacitated arc routing problem with profits (UCARPP), is to find a set of routes that satisfy the constraints on the duration of the route and on the capacity of the vehicle and maximize the total collected profit. We propose a branch-and-price algorithm and several heuristics. We can solve exactly instances with up to 97 profitable edges. The best heuristics find the optimal solution on most of instances where it is available.
Type de document :
Article dans une revue
Computers and Operations Research, Elsevier, 2010, 37 (11), pp.1860-1869
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00506963
Contributeur : Dominique Feillet <>
Soumis le : jeudi 29 juillet 2010 - 12:09:04
Dernière modification le : mercredi 11 octobre 2017 - 01:08:04

Identifiants

  • HAL Id : emse-00506963, version 1

Collections

Citation

Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza. The undirected capacitated arc routing problem with profits. Computers and Operations Research, Elsevier, 2010, 37 (11), pp.1860-1869. 〈emse-00506963〉

Partager

Métriques

Consultations de la notice

126