Abstract
Sensitivity analysis in general deals with the question of how changes in input data of a model affect its output data. In the context of optimization problems, such an analysis could, for instance, address how changes in capacity constraints affect the optimal solution value. Although well established in the domain of linear programming, sensitivity analysis approaches for combinatorial optimization problems are model-specific, limited in scope and not applicable to practical optimization problems. To overcome these limitations, Schulte et al. developed the concept of bilevel innovization. By using evolutionary bilevel optimization in combination with data mining and visualization techniques, bilevel innovization provides decision-makers with deeper insights into the behavior of the optimization model and supports decision-making related to model building and configuration. Originally introduced in the field of evolutionary computation, most recently bilevel innovization has been proposed as an approach to sensitivity analysis for combinatorial problems in general. Based on previous work on bilevel innovization, our paper illustrates this concept as a tool for sensitivity analysis by providing a comprehensive analysis of the generalized assignment problem. Furthermore, it is investigated how different algorithms for solving the combinatorial problem affect the insights gained by the sensitivity analysis, thus evaluating the robustness and reliability of the sensitivity analysis results.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Data Availability
The datasets generated during and/or analysed during the current study are available from the corresponding author on reasonable request.
References
Al-Maliky, F., Hifi, M., Mhalla, H.: Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights. Int. Trans. Oper. Res. 25(2), 637–666 (2018)
Beck, F., Burch, M., Munz, T., Di Silvestro, L., Weiskopf, D.: Generalized pythagoras trees for visualizing hierarchies. 2014 international conference on information visualization theory and applications (IVAPP) (2014)
Cattrysse, D.G., Van Wassenhove, L.N.: A survey of algorithms for the generalized assignment problem. Eur. J. Oper. Res. 60(3), 260–272 (1992). https://doi.org/10.1016/0377-2217(92)90077-M
Chu, P. C., Beasley, J. E.: A genetic algorithm for the generalised assignment problem. Comput. Oper. Res. 24(1), 17–23 (1997)
Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Ann. Oper. Res. 153(1), 235–256 (2007)
Davis, J., Goadrich, M.: The relationship between Precision-Recall and ROC curves. In: Proceedings of the 23rd international conference on Machine learning - ICML ’06, pp. 233–240. ACM Press, New York. https://doi.org/10.1145/1143844.1143874(2006)
Deb, K., Srinivasan, A.: Innovization. In: Cattolico, M. (ed.) Proceedings of the 8th annual conference on genetic and evolutionary computation, p. 1629. ACM, New York. https://doi.org/10.1145/1143997.1144266 (2006)
Demšar, J., Curk, T., Erjavec, A., Gorup, Č.: Orange: data mining toolbox in python. J. Mach. Learning Res. 1(14), 2349–2353 (2013)
Dudas, C., Ng, A. H., Pehrsson, L.: Integration of data mining and multi-objective optimisation for decision support in production systems development. Int. J. Comput. Integr. Manuf. 27(9), 824–839 (2014)
Fernández-Baca, D., Venkatachalam, B.: Sensitivity Analysis in Combinatorial Optimization. In: Gonzalez, T.F. (ed.) Handbook of approximation algorithms and metaheuristics, 2nd edn., pp. 455-472. Chapman and Hall/CRC (2018)
Gál, T.: Postoptimal analyses, parametric programming, and related topics: degeneracy, multicriteria decision making, redundancy, 2nd edn. W. de Gruyter, Berlin and New York (1995)
Ghoreishi, S.N., Clausen, A., Joergensen, B.N.: Termination criteria in evolutionary algorithms: a survey. In: Proceedings of the 9th international joint conference on computational intelligence, pp. 373–384. SCITEPRESS - Science and Technology Publications . https://doi.org/10.5220/0006577903730384 (2017)
Greenberg, H. J.: An annotated bibliography for post-solution analysis in mixed integer programming and combinatorial optimization. In: Sharda, R., Woodruff, D. L. (eds.) Advances in computational and stochastic optimization, logic programming, and heuristic search, operations research/computer science interfaces series, vol. 9, pp. 97-147. Springer, Boston (1998)
Hall, N.G., Posner, M.E.: Sensitivity analysis for scheduling problems. J. Sched. 7 (1), 49–83 (2004). https://doi.org/10.1023/B:JOSH.0000013055.31639.f6
Hillier, F.S., Lieberman, G.J.: Introduction to Operations Research, 10. Ed., Internat. Student Ed. Edn. McGraw-Hill Education, New York (2015)
Jain, B., Pohlheim, H., Wegener, J.: On termination criteria of evolutionary algorithms - Gecco poster, https://doi.org/10.5555.2955239.29553655 (2001)
Forrest, J.J., Vigerske, S., Santos, H.G., Ralphs, T.: coin-or/Cbc: version 2.10.5, https://doi.org/10.5281/zenodo.3700700, https://github.com/coin-or/Cbc (2020)
Keim, D.: Mastering the Information Age: Solving Problems with Visual Analytics. Eurographics Association, Goslar (2010)
Kimbrough, S.O., Kuo, A., Lau, H. C.: On decision support for deliberating with constraints in constrained optimization models. In: Pelikan, M., Branke, J. (eds.) Proceedings of the 12th annual conference comp on Genetic and evolutionary computation - GECCO ’10, pp. 1833. ACM Press, New York (2010)
Land, A. H., Doig, A. G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497–520 (1960)
Martello, S., Toth, P.: Knapsack problems: algorithms and computer implementations. Wiley-interscience series in discrete mathematics and optimization. UMI books on Demand, Ann Arbor Mich (1990)
Marti, L., Garcia, J., Berlanga, A., Molina, J. M.: An approach to stopping criteria for multi-objective optimization evolutionary algorithms: the Mgbm criterion. In: 2009 IEEE congress on evolutionary computation, pp. 1263–1270. IEEE (2009)
Migdalas, A., Pardalos, P. M., Värbrand, P. (eds.): Multilevel optimization: algorithms and applications, nonconvex optimization and its applications, vol. 20. Springer US, Boston (1998)
Nemhauser, G., Wolsey, L.: Integer and combinatorial optimization. Wiley, Inc., Hoboken (1988). https://doi.org/10.1002/9781118627372
Öncan, T.: A survey of the generalized assignment problem and its applications. INFOR: Inf. Syst. Oper. Res 45(3), 123–141 (2007)
Pardalos, P.M., Du, D.Z., Graham, R.L. (eds.): Handbook of Combinatorial Optimization. Springer, New York (2013). https://doi.org/10.1007/978-1-4419-7997-1
Pentico, D. W.: Assignment problems: a golden anniversary survey. Eur. J. Oper. Res. 176(2), 774–793 (2007)
Romeijn, H., Morales, D.R.: A class of greedy algorithms for the generalized assignment problem. Discrete Appl. Math. 103(1-3), 209–235 (2000). https://doi.org/10.1016/S0166-218X(99)00224-3
Schulte, J., Feldkamp, N., Bergmann, S., Nissen, V.: Knowledge Discovery in Scheduling Systems Using Evolutionary Bilevel Optimization and Visual Analytics. In: Deb, K., Goodman, E., Coello Coello, C. A., Klamroth, K., Miettinen, K. (eds.) Evolutionary Multi-Criterion Optimization, Lecture Notes in Computer Science, vol. 11411, pp. 439-450. Springer International Publishing, Cham (2019)
Schulte, J., Nissen, V.: Holistic workforce planning: integrating staffing, shift design and scheduling using evolutionary bilevel optimization. In: Bai, R., Chen, Z.L., Jiawei, L., Kendall, G., McCollum, B. (eds.) Proceedings of the 9th multidisciplinary international conference on scheduling: theory and applications, pp. 209–223 (2019)
Schulte, J., Nissen, V.: Sensitivity analysis in constrained evolutionary optimization. In: Proceedings of the 2020 genetic and evolutionary computation conference, pp. 894–902. ACM, New York. https://doi.org/10.1145/3377930.3390222(2020)
Schulte, J., Nissen, V.: Sensitivity analysis on constraints of combinatorial optimization problems. In: Simos, D. E., Pardalos, P. M., Kotsireas, I. S. (eds.) Learning and intelligent optimization, pp 394-408. Springer International Publishing, Cham (2021)
Sinha, A., Malo, P., Deb, K.: A review on bilevel optimization: from classical to evolutionary approaches and applications. IEEE Trans. Evol. Comput. 22(2), 276–295 (2018)
Talbi, E.G.: A Taxonomy of Metaheuristics for Bi-Level Optimization. In: Talbi, E.G., Brotcorne, L. (eds.) Metaheuristics for Bi-level optimization, studies in computational intelligence, vol. 482, pp. 1-39. Springer, Berlin (2013)
Funding
Open Access funding enabled and organized by Projekt DEAL. No funding was received for conducting this study.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Competing interests
The authors have no competing interests to declare that are relevant to the content of this article.
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Schulte, J., Nissen, V. Sensitivity analysis of combinatorial optimization problems using evolutionary bilevel optimization and data mining. Ann Math Artif Intell 91, 309–328 (2023). https://doi.org/10.1007/s10472-022-09827-w
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-022-09827-w
Keywords
- Sensitivity analysis
- Combinatorial optimization
- Evolutionary bilevel optimization
- Data mining
- Generalized assignment