An efficient exact approach for the constrained shortest path tour problem

Given a directed graph with non-negative arc lengths, the Constrained Shortest Path Tour Problem (CSPTP) 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 (CSPTP)  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.



Titolo: An efficient exact approach for the constrained shortest path tour problem
Autori: 
FERONE, DANIELE [Membro del Collaboration Group]
FESTA, Paola
GUERRIERO, Francesca
Data di pubblicazione: 2020
Rivista: 
OPTIMIZATION METHODS & SOFTWARE  
Handle: http://hdl.handle.net/20.500.11770/302453
Appare nelle tipologie:1.1 Articolo in rivista

File in questo prodotto:
Non ci sono file associati a questo prodotto.
Utilizza questo identificativo per citare o creare un link a questo documento:
http://hdl.handle.net/20.500.11770/302453
  • Citazioni
  • PubMed Central ND
  • Scopus
  • WOS ND

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
 
 
 
Powered by IRIS-about IRIS-Utilizzo dei cookie
Logo CINECA  Copyright © 2021