.png){kind=icon}
.png){kind=icon}
Return
A sampling-based multi-objective iterative robust optimization method for Bandwidth Packing Problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2022.117337.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a new paradigm for solving robust optimization problems using sampling within a multi-objective framework to solve the Bandwidth Packing Problem, the Sampling-based Robust Optimization Method (SIROM). The key feature of this new approach is that it performs robust optimization without having to specify a priori an uncertainty budget. The new method thus provides the decision-maker a Pareto frontier composed by the best solutions (objective function value versus uncertainty protection) found by exploring the topology of the uncertain parameter set. A general framework based on unsupervised learning is built for the method, which can be used to find solutions for linear, non-linear, and integer programming problems under parametric uncertainty. The general idea is to sample possible realizations of a given uncertain parameter vector and solve each problem associated with all those parameters. After that, we cluster the realizations based on optimal constraint and objective function values. All similarcases are grouped together to form problem sets with few representativerealizations that we can solve and, in analyzing the quality of the optimal solution, use to compose a Pareto frontier. The framework is applied to solve the Bandwidth Packing Problem under uncertain demand and we compare results to a methodology based on Bertsimas and Sim robust optimization approach. The results demonstrate that the proposed method performs better than previously existing ones. The code and instances used to perform the computational experiment are available in https://github.com/butkeraites/sirom_bpp.
Keywords:
Optimization
Robustness and sensitivity analysis
Monte Carlo simulation
Bandwidth Packing Problem
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W