In this chapter, we conduct computational studies to evaluate the performance of the various Benders decompositions and acceleration techniques introduced in previous chapters. We begin by outlining the framework for generating problem instances and describing the structure of our computational studies, including performance measures and parameters used. Following this, we present results that analyze different configurations of our model decompositions and assess the effectiveness of our solution approach on larger instances. Finally, we summarize key findings from our computational studies, discuss their limitations, and suggest potential avenues for future research based on the insights gained from our experiments.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Computational Studies

  • Roman Delorme

摘要

In this chapter, we conduct computational studies to evaluate the performance of the various Benders decompositions and acceleration techniques introduced in previous chapters. We begin by outlining the framework for generating problem instances and describing the structure of our computational studies, including performance measures and parameters used. Following this, we present results that analyze different configurations of our model decompositions and assess the effectiveness of our solution approach on larger instances. Finally, we summarize key findings from our computational studies, discuss their limitations, and suggest potential avenues for future research based on the insights gained from our experiments.