A simulation based cut generation approach to improve deo efficiency: The buffer allocation case

Mengyi Zhang, Andrea Matta, Arianna Alfieri, Giulia Pedrielli

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The stochastic Buffer Allocation Problem (BAP) is well known in several fields and it has been characterized as NP-Hard. It deals with the optimal allocation of buffer spaces among stages of a system. Simulation Optimization is a possible way to approximately solve the problem. In particular, we refer to the Discrete Event Optimization (DEO). According to this approach, BAP simulation optimization can be modeled as a Mixed Integer Programming model. Despite the advantages deriving from having a single model for both simulation and optimization, its solution can be extremely demanding. In this work, we propose a Benders decomposition approach to efficiently solve large DEO of BAP, in which cuts are generated by simulation. Numerical experiment shows that the computation time can be significantly reduced by using this approach. Pedrielli, Matta, and Alfieri (2015) proposed a general DEO framework to model and optimize queueing systems. The approach relies on the Event Relationship Graph Lite (ERG Lite) formalism to formulate integrated simulation optimization mathematical programming models. ERG Lite is an extension of the Event Relationship Graphs. The authors showed that the BAP can be solved by DEO (Matta 2008) models that contain both simulation and optimization aspects. The simulation components control the event times, by means of constraints dealing with the system dynamics. The optimization components, instead, correspond to the binary variables and related constraints used for the capacity selection and minimization of total buffer space.

Original languageEnglish (US)
Title of host publication2016 Winter Simulation Conference: Simulating Complex Service Systems, WSC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3710-3711
Number of pages2
ISBN (Electronic)9781509044863
DOIs
StatePublished - Jan 17 2017
Event2016 Winter Simulation Conference, WSC 2016 - Arlington, United States
Duration: Dec 11 2016Dec 14 2016

Other

Other2016 Winter Simulation Conference, WSC 2016
CountryUnited States
CityArlington
Period12/11/1612/14/16

Fingerprint

Buffer Allocation
Discrete Event
Optimization
Simulation Optimization
Simulation
Programming Model
Buffer
Graph in graph theory
Benders Decomposition
Binary Variables
Mixed Integer Programming
Optimal Allocation
Queueing System
Mathematical Programming
System Dynamics
NP-complete problem
Optimise
Numerical Experiment
Model
Mathematical programming

ASJC Scopus subject areas

  • Software
  • Modeling and Simulation
  • Computer Science Applications

Cite this

Zhang, M., Matta, A., Alfieri, A., & Pedrielli, G. (2017). A simulation based cut generation approach to improve deo efficiency: The buffer allocation case. In 2016 Winter Simulation Conference: Simulating Complex Service Systems, WSC 2016 (pp. 3710-3711). [7822412] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/WSC.2016.7822412

A simulation based cut generation approach to improve deo efficiency : The buffer allocation case. / Zhang, Mengyi; Matta, Andrea; Alfieri, Arianna; Pedrielli, Giulia.

2016 Winter Simulation Conference: Simulating Complex Service Systems, WSC 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 3710-3711 7822412.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, M, Matta, A, Alfieri, A & Pedrielli, G 2017, A simulation based cut generation approach to improve deo efficiency: The buffer allocation case. in 2016 Winter Simulation Conference: Simulating Complex Service Systems, WSC 2016., 7822412, Institute of Electrical and Electronics Engineers Inc., pp. 3710-3711, 2016 Winter Simulation Conference, WSC 2016, Arlington, United States, 12/11/16. https://doi.org/10.1109/WSC.2016.7822412
Zhang M, Matta A, Alfieri A, Pedrielli G. A simulation based cut generation approach to improve deo efficiency: The buffer allocation case. In 2016 Winter Simulation Conference: Simulating Complex Service Systems, WSC 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 3710-3711. 7822412 https://doi.org/10.1109/WSC.2016.7822412
Zhang, Mengyi ; Matta, Andrea ; Alfieri, Arianna ; Pedrielli, Giulia. / A simulation based cut generation approach to improve deo efficiency : The buffer allocation case. 2016 Winter Simulation Conference: Simulating Complex Service Systems, WSC 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 3710-3711
@inproceedings{11baa8686b8448a79a58b443007bcaf1,
title = "A simulation based cut generation approach to improve deo efficiency: The buffer allocation case",
abstract = "The stochastic Buffer Allocation Problem (BAP) is well known in several fields and it has been characterized as NP-Hard. It deals with the optimal allocation of buffer spaces among stages of a system. Simulation Optimization is a possible way to approximately solve the problem. In particular, we refer to the Discrete Event Optimization (DEO). According to this approach, BAP simulation optimization can be modeled as a Mixed Integer Programming model. Despite the advantages deriving from having a single model for both simulation and optimization, its solution can be extremely demanding. In this work, we propose a Benders decomposition approach to efficiently solve large DEO of BAP, in which cuts are generated by simulation. Numerical experiment shows that the computation time can be significantly reduced by using this approach. Pedrielli, Matta, and Alfieri (2015) proposed a general DEO framework to model and optimize queueing systems. The approach relies on the Event Relationship Graph Lite (ERG Lite) formalism to formulate integrated simulation optimization mathematical programming models. ERG Lite is an extension of the Event Relationship Graphs. The authors showed that the BAP can be solved by DEO (Matta 2008) models that contain both simulation and optimization aspects. The simulation components control the event times, by means of constraints dealing with the system dynamics. The optimization components, instead, correspond to the binary variables and related constraints used for the capacity selection and minimization of total buffer space.",
author = "Mengyi Zhang and Andrea Matta and Arianna Alfieri and Giulia Pedrielli",
year = "2017",
month = "1",
day = "17",
doi = "10.1109/WSC.2016.7822412",
language = "English (US)",
pages = "3710--3711",
booktitle = "2016 Winter Simulation Conference: Simulating Complex Service Systems, WSC 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - A simulation based cut generation approach to improve deo efficiency

T2 - The buffer allocation case

AU - Zhang, Mengyi

AU - Matta, Andrea

AU - Alfieri, Arianna

AU - Pedrielli, Giulia

PY - 2017/1/17

Y1 - 2017/1/17

N2 - The stochastic Buffer Allocation Problem (BAP) is well known in several fields and it has been characterized as NP-Hard. It deals with the optimal allocation of buffer spaces among stages of a system. Simulation Optimization is a possible way to approximately solve the problem. In particular, we refer to the Discrete Event Optimization (DEO). According to this approach, BAP simulation optimization can be modeled as a Mixed Integer Programming model. Despite the advantages deriving from having a single model for both simulation and optimization, its solution can be extremely demanding. In this work, we propose a Benders decomposition approach to efficiently solve large DEO of BAP, in which cuts are generated by simulation. Numerical experiment shows that the computation time can be significantly reduced by using this approach. Pedrielli, Matta, and Alfieri (2015) proposed a general DEO framework to model and optimize queueing systems. The approach relies on the Event Relationship Graph Lite (ERG Lite) formalism to formulate integrated simulation optimization mathematical programming models. ERG Lite is an extension of the Event Relationship Graphs. The authors showed that the BAP can be solved by DEO (Matta 2008) models that contain both simulation and optimization aspects. The simulation components control the event times, by means of constraints dealing with the system dynamics. The optimization components, instead, correspond to the binary variables and related constraints used for the capacity selection and minimization of total buffer space.

AB - The stochastic Buffer Allocation Problem (BAP) is well known in several fields and it has been characterized as NP-Hard. It deals with the optimal allocation of buffer spaces among stages of a system. Simulation Optimization is a possible way to approximately solve the problem. In particular, we refer to the Discrete Event Optimization (DEO). According to this approach, BAP simulation optimization can be modeled as a Mixed Integer Programming model. Despite the advantages deriving from having a single model for both simulation and optimization, its solution can be extremely demanding. In this work, we propose a Benders decomposition approach to efficiently solve large DEO of BAP, in which cuts are generated by simulation. Numerical experiment shows that the computation time can be significantly reduced by using this approach. Pedrielli, Matta, and Alfieri (2015) proposed a general DEO framework to model and optimize queueing systems. The approach relies on the Event Relationship Graph Lite (ERG Lite) formalism to formulate integrated simulation optimization mathematical programming models. ERG Lite is an extension of the Event Relationship Graphs. The authors showed that the BAP can be solved by DEO (Matta 2008) models that contain both simulation and optimization aspects. The simulation components control the event times, by means of constraints dealing with the system dynamics. The optimization components, instead, correspond to the binary variables and related constraints used for the capacity selection and minimization of total buffer space.

UR - http://www.scopus.com/inward/record.url?scp=85014240656&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85014240656&partnerID=8YFLogxK

U2 - 10.1109/WSC.2016.7822412

DO - 10.1109/WSC.2016.7822412

M3 - Conference contribution

AN - SCOPUS:85014240656

SP - 3710

EP - 3711

BT - 2016 Winter Simulation Conference: Simulating Complex Service Systems, WSC 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -