Simulation-optimization problems exhibit substantial inefficiencies when applied to high-dimensional problems. The problem is exacerbated in case where feasibility also needs to be evaluated using simulation. In this work, we propose an approximate iterative approach to identify feasible solutions and quickly find good solutions to the original problem. The approach is based on discrete event optimization (i.e., a mathematical programming representation of the simulation-optimization problems) and Benders decomposition, which is used for cut generation while a system alternative is simulated. The procedure is currently tailored for the server allocation problem in the multi-stage serial-parallel manufacturing line constrained to a target system time on a specific sample path. Results on randomly generated instances show its effectiveness in quickly eliminating infeasible solutions, thus decreasing the required computational effort and keeping the optimality gap low.

Feasibility Cut Generation by Simulation: Server Allocation in Serial-Parallel Manufacturing Systems / Zhang, M.; Matta, A.; Alfieri, A.; Pedrielli, G.. - ELETTRONICO. - 2019:(2019), pp. 3633-3644. ((Intervento presentato al convegno 2019 Winter Simulation Conference, WSC 2019 tenutosi a USA nel 2019 [10.1109/WSC40007.2019.9004762].

Feasibility Cut Generation by Simulation: Server Allocation in Serial-Parallel Manufacturing Systems

Alfieri A.;
2019

Abstract

Simulation-optimization problems exhibit substantial inefficiencies when applied to high-dimensional problems. The problem is exacerbated in case where feasibility also needs to be evaluated using simulation. In this work, we propose an approximate iterative approach to identify feasible solutions and quickly find good solutions to the original problem. The approach is based on discrete event optimization (i.e., a mathematical programming representation of the simulation-optimization problems) and Benders decomposition, which is used for cut generation while a system alternative is simulated. The procedure is currently tailored for the server allocation problem in the multi-stage serial-parallel manufacturing line constrained to a target system time on a specific sample path. Results on randomly generated instances show its effectiveness in quickly eliminating infeasible solutions, thus decreasing the required computational effort and keeping the optimality gap low.
File in questo prodotto:
File Dimensione Formato  
wsc2019.pdf

non disponibili

Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 671.37 kB
Formato Adobe PDF
671.37 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento 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/2810092