EN|RU
|
![]() |
Volume 29, No 3, 2022, P. 85-101 UDC 519.8
Keywords: stability radius, matheuristic, VNS, uncertainty. DOI: 10.33048/daio.2022.29.737 Aleksey V. Ratushnyi 1 Received May 4, 2022 References[1] E. Carrizosa and S. Nickel, Robust facility location, Math. Methods Oper. Res. 58, 331–349 (2003).[2] E. Carrizosa, A. Ushakov, and I. Vasilyev, Threshold robustness in discrete facility location problems: A bi-objective approach, Optim. Lett. 9, 1297–1314 (2015). [3] P. Borisovsky and O. Battaïa, MIP-based heuristics for a robust transfer lines balancing problem, in Optimization and Applications (Proc. Int. Conf. OPTIMA 2021, Petrovac, Montenegro, Sep. 27–Oct. 1, 2021) (Springer, Heidelberg, 2021), pp. 123–135 (Lect. Notes Comput. Sci., Vol. 13078). [4] T. Andersen, J. H. Hove, K. Fagerholt, and F. Meisel, Scheduling ships with uncertain arrival times through the Kiel Canal, Maritime Transp. Res. 2, ID 100008 (2021). [5] A. Ben-Tal and A. Nemirovski, Robust optimization-methodology and applications, Math. Program. 92, 453–480 (2002). [6] J. García and A. Peña, Robust optimization: Concepts and applications, in Nature-Inspired Methods for Stochastic, Robust and Dynamic Optimization (IntechOpen, London, 2018), pp. 7–22. [7] Eh. N. Gordeev and V. K. Leont’ev, A general approach to the study of the stability of solutions in discrete optimization problems, Zh. Vychisl. Mat. Mat. Fiz. 36 (1), 66–72 (1996) [Russian] [Comput. Math. Math. Phys. 36 (1), 53–58 (1996)]. [8] E. Gurevsky, O. Battaïa, and A. Dolgui, Stability measure for a generalized assembly line balancing problem, Discrete Appl. Math. 161 (3), 377–394 (2013). 9. A. Rossi, E. Gurevsky, O. Battaïa, and A. Dolgui, Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations, Discrete Appl. Math. 208, 123–136 (2016). [10] Gurobi Optimizer Reference Manual (Gurobi Optimization, Beaverton, 2021). Available at www.gurobi.com/documentation/9.5/refman/index.html (accessed May 16, 2022). [11] M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979; Mir, Moscow, 1982 [Russian]). [12] I. N. Kulachenko and P. A. Kononova, A hybrid local search algorithm for consistent periodic vehicle routing problem, Diskretn. Anal. Issled. Oper. 27 (2), 43–64 (2020) [Russian] [J. Appl. Ind. Math. 14 (2), 339–351 (2020)]. [13] I. N. Kulachenko and P. A. Kononova, A hybrid algorithm for the drilling rig routing problem, Diskretn. Anal. Issled. Oper. 28 (2), 35–59 (2021) [Russian] [J. Appl. Ind. Math. 15 (2), 261–276 (2021)]. [14] N. Mladenovic and P. Hansen, Variable neighborhood search, Comput. Oper. Res. 24 (11), 1097–1100 (1997). [15] A. E. Smith and D. W. Coit, Penalty functions, in Handbook of Evolutionary Computation (Oxford Univ. Press, New York, 1997), pp. C5.2:1–C5.2:6. |
|
![]() |
|
© Sobolev Institute of Mathematics, 2015 | |
![]() |
|