Portal de Periódicos da CAPES

Artigo Acesso aberto Produção Nacional Revisado por pares

BIBTEX RIS

The minimum reload s – t path, trail and walk problems

2010; Elsevier BV; Volume: 158; Issue: 13 Linguagem: Inglês

10.1016/j.dam.2010.03.009

1872-6771

Laurent Gourvès, Adria Lyra, Carlos A. Martinhon, Jérôme Monnot,

Vehicle Routing Optimization Methods

This paper deals with problems on non-oriented edge-colored graphs. The aim is to find a route between two given vertices s and t. This route can be a walk, a trail or a path. Each time a vertex is crossed by a walk there is an associated non-negative reload cost ri,j, where i and j denote, respectively, the colors of successive edges in this walk. The goal is to find a route whose total reload cost is minimum. Polynomial algorithms and proofs of NP-hardness are given for particular cases: when the triangle inequality is satisfied or not, when reload costs are symmetric (i.e., ri,j=rj,i) or asymmetric. We also investigate bounded degree graphs and planar graphs. We conclude the paper with the traveling salesman problem with reload costs.