This paper deals with the search of optimal paths in a multi-stage stochastic decision network as a first application of the deterministic approximation approach proposed by Tadei et al. (2019). In the network, the involved utilities are stage-dependent and contain random oscillations with an unknown probability distribution. The problem is modeled as a sequential choice of nodes in a graph layered into stages, in order to find the optimal path value in a recursive fashion. It is also shown that an optimal path solution can be derived by using a Nested Multinomial Logit model, which represents the choice probability at the different stages. The accuracy and efficiency of the proposed method are experimentally proved on a large set of randomly generated instances. Moreover, insights on the calibration of a critical parameter of the deterministic approximation are also provided.

Optimal paths in multi-stage stochastic decision networks / Roohnavazfar, Mina; Manerba, Daniele; DE MARTIN, JUAN CARLOS; Tadei, Roberto. - In: OPERATIONS RESEARCH PERSPECTIVES. - ISSN 2214-7160. - ELETTRONICO. - 6:100124(2019), pp. 1-10. [10.1016/j.orp.2019.100124]

Optimal paths in multi-stage stochastic decision networks

ROOHNAVAZFAR, MINA;Daniele Manerba;Juan Carlos De Martin;Roberto Tadei
2019

Abstract

This paper deals with the search of optimal paths in a multi-stage stochastic decision network as a first application of the deterministic approximation approach proposed by Tadei et al. (2019). In the network, the involved utilities are stage-dependent and contain random oscillations with an unknown probability distribution. The problem is modeled as a sequential choice of nodes in a graph layered into stages, in order to find the optimal path value in a recursive fashion. It is also shown that an optimal path solution can be derived by using a Nested Multinomial Logit model, which represents the choice probability at the different stages. The accuracy and efficiency of the proposed method are experimentally proved on a large set of randomly generated instances. Moreover, insights on the calibration of a critical parameter of the deterministic approximation are also provided.
File in questo prodotto:
File Dimensione Formato  
1-s2.0-S221471601930096X-main.pdf

accesso aperto

Descrizione: Articolo principale
Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Creative commons
Dimensione 1.47 MB
Formato Adobe PDF
1.47 MB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

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: https://hdl.handle.net/11583/2752646
 Attenzione

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