Please use this identifier to cite or link to this item:
Title: Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
Authors: Pascoal, Marta 
Resende, Marisa 
Issue Date: 2016
Publisher: Elsevier
Serial title, monograph or event: Discrete Optimization
Volume: 22
Abstract: The minmax regret robust shortest path problem aims at finding a path that minimizes the maximum deviation from the shortest paths over all scenarios. It is assumed that different arc costs are associated with different scenarios. This paper introduces a technique to reduce the network, before a minmax regret robust shortest path algorithm is applied. The preprocessing method enhances others explored in previous research. The introduced method acts dynamically and allows to update the conditions to be checked as new network nodes that can be discarded are identified. Computational results on random and Karasan networks are reported, which compare the dynamic preprocessing algorithm and its former static version. Two robust shortest path algorithms as well as the resolution of a mixed integer linear formulation by a solver are tested with and without these preprocessing rules.
DOI: 10.1016/j.disopt.2015.11.001
Rights: embargoedAccess
Appears in Collections:FCTUC Matemática - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
2016PascoalResende.pdf545.19 kBAdobe PDFView/Open
Show full item record

Page view(s) 50

checked on Jul 22, 2021

Download(s) 50

checked on Jul 22, 2021

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.