Given a directed graph with non-negative arc lengths, the Constrained Shortest Path Tour Problem ((Formula presented.)) is aimed at finding a shortest path from a single-origin to a single-destination, such that a sequence of disjoint and possibly different-sized node subsets are crossed in a given fixed order. Moreover, the optimal path must not include repeated arcs. In this paper, for the (Formula presented.)  we propose a new mathematical model and a new efficient Branch & Bound method. Extensive computational experiments have been carried out on a significant set of test problems in order to evaluate empirically the performance of the proposed approach.

An efficient exact approach for the constrained shortest path tour problem

Ferone, Daniele;FESTA, Paola;Guerriero, Francesca
2019

Abstract

Given a directed graph with non-negative arc lengths, the Constrained Shortest Path Tour Problem ((Formula presented.)) is aimed at finding a shortest path from a single-origin to a single-destination, such that a sequence of disjoint and possibly different-sized node subsets are crossed in a given fixed order. Moreover, the optimal path must not include repeated arcs. In this paper, for the (Formula presented.)  we propose a new mathematical model and a new efficient Branch & Bound method. Extensive computational experiments have been carried out on a significant set of test problems in order to evaluate empirically the performance of the proposed approach.
branch & bound; capacity constraints; Shortest path problems; shortest path tour problem
branch & bound; capacity constraints; Shortest path problems; shortest path tour problem; Software; Control and Optimization; Applied Mathematics
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/20.500.11770/289977
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 12
  • ???jsp.display-item.citation.isi??? 6
social impact