RESEARCH ARTICLE

Mathematical Analysis on troubleshooting problem during Covid-19 Pandemic

Xia Jiang.1 Bin Zhao.1,2* 

• .1 Hospital, Hubei University of Technology, Wuhan, Hubei, China 
• .2 School of Science, Hubei University of Technology, Wuhan, Hubei, China
•  

Corresponding Author: Bin Zhao, School of Science, Hubei University of Technology, Wuhan, Hubei, China. Tel./Fax: +86 130 2851 7572. E-mail: [email protected]

Received: November 05, 2022                                                Published: November 14, 2022 

Citation: Bin Z. Mathematical Analysis on troubleshooting problem during Covid-19 Pandemic. Int J Complement Intern Med. 2022;2(1):67–70. 

Copyright: ©2022 Zhao. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and build upon your work non-commercially.

Abstract 

Mathematics is closely related to people's daily lives, such as the various shapes that can be seen everywhere, and the various distance relationships. Similarly, industrial production is inseparable from mathematics. The problem of nesting is a representative planning problem in industry and is widely used in the fields of construction, clothing, machinery, and wood. With the development of computers, the nesting problem has been significantly improved by relying on the emergence of some intelligent algorithms. However, at the beginning of the problem, establishing a reasonable mathematical model is an essential step. This article summarizes the common mathematical models in the troubleshooting problem and analyzes the advantages and disadvantages during COVID-19 pandemic. 

Keywords: Nesting, Mathematical Models, Troubleshooting Problem

References 

1. LV Kantorovich. Mathematical Methods of Organizing and Planning Production. Management Science. 1960; 6(4):366–422. 

2. Gilmore PC, Gomory RE. A linear programming approach to the cutting stock problem. Operations Research. 1961;9(2):849–859. 

3. Babu AR, Babu NR. A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms. Computer-Aided Design. 2001;33(12):879– 891. 

4. Baker BS, Coffman EG, Rivest RL. Orthogonal packings in two dimensions. SIAM Journal on Computing. 1980;9(4):846–855. 

5. Baldacci R, Boschetti MA, Ganovelli M. Algorithms for nesting with defects. Discrete Applied Mathematics. 2014;163:17–33. 

6. Bengio Y, Lodi A, Prouvost A. Machine learning for combinatorial optimization: a methodological tour d’horizon. European Journal of Operational Research. 2021;290(2):405–421. 

7. Bennell JA, Oliveira JF. The geometry of nesting problems: A tutorial. European Journal of Operational Research. 2008;184(2):397–415. 

8. Cherri LH, Cherri AC, Soler EM. Mixed integer quadratically constrained programming model to solve the irregular strip packing problem with continuous rotations. Journal of Global Optimization. 2018;72(1):89–107. 

9. Cherri LH, Mundim LR, Andretta M. Robust mixedinteger linear programming models for the irregular strip packing problem. European Journal of Operational Research. 2016;253(3):570–583. 

10. Chryssolouris G, Papakostas N, Mourtzis D. A decisionmaking approach for nesting scheduling: a textile case. International Journal of Productions Research. 2000;38(17):4555–4564. 

11. Dowsland KA, Vaid S, Dowsland WB. An algorithm for polygon placement using a bottom-left strategy. European Journal of Operational Research. 2002;141(2):371–381. 

12. Elkeran A. A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering. European Journal of Operational Research. 2013;231(3):757–769. 

13. Gahm C, Uzunoglu A, Wahl S. Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning. European Journal of Operational Research. 2022;296(3):819–836. 

14. Leao AA, Toledo FM, Oliveira JF. Irregular packing problems: A review of mathematical models. European Journal of Operational Research. 2020;282(3):803–822. 

15. Pinheiro PR, Júnior BA, Saraiva RD. A random-key genetic algorithm for solving the nesting problem. International Journal of Computer Integrated Manufacturing. 2016;29(11):1159–1165. 

16. Plisnier H, Steckelmacher D, Roijers DM. Transfer reinforcement learning across environment dynamics with multiple advisors. In BNAIC/BENELEARN. Rakotonirainy, RG. A machine learning approach for automated strip packing algorithm selection. ORiON. 2019;36(2):73–88. 

17. Sato AK, Martins TC, Gomes AM. Raster penetration map applied to the irregular packing problem. European Journal of Operational Research. 2019;279(2):657–671. 

18. Sutton RS, Barto AG. Reinforcement learning: an introduction. MIT Press. Toledo FM, Carravilla MA, Ribeiro C, Oliveira JF. The dotted-board model: A new MIP model for nesting irregular shapes. International Journal of Production Economics. 2013;145(2): 478– 487. 

19. Akunuru R, Babu N. Semi-discrete geometric representation for nesting problems. International Journal of Production Research. 2013;51:4155–4174. 

20. Baldacci R, Boschetti M, Ganovelli M. Algorithms for nesting with defects. Discrete Applied Mathematics. 2014;163:17–33. 

21. Bennell J, Oliveira J. The geometry of nesting problem: A tutorial. European Journal of Operational Research. 2008;184:397–415. 

22. Burke E, Hellier R, Kendall G. Irregular packing using the line and arc no-fit polygon. Operations Research. 2010;58:948–970. 

23. Cherri L, Carravilla M, Toledo F. A model-based heuristic for the irregular strip packing problem. Pesquisa Operacional. 2016;36:447–468. 

24. Gomes AM. Irregular packing problems: Industrial applications and new directions using computational geometry. IFAC-Proceedings. 2013;46:378–383. 

25. Gomes AM, Oliveira J. A 2-exchange heuristic for nesting problems. European Journal of Operational Research. 2002;141:359–370. 

26. Kierkosz I, Luczak M. A one-pass nesting problems. Operations Research and Decisions. 2019;29:37–60. 

27. Leao A, Toledo F, Oliveira J. A semi-continuous MIP model for the irregular strip packing problem. International Journal of Production Research. 2015;54:712–721. 

28. Leao A, Toledo F, Oliveira J. Irregular packing problems: A review of mathematical models. European Journal of Operational Research. 2020;282:803–822. 

29. Pinheiro PR, Amaro Junior B, Saraiva RD. A randomkey genetic algorithm for solving the nesting problem. International Journal of Computer Integrated Manufacturing. 2016;29:1159–1165. 

30. Sato A, Martins T, Gomes A. Raster penetration map applied to the irregular packing problem. European Journal of Operational Research. 2019;279:657–671. 

31. Sato A, Martins T, Tsuzuki M. A pairwise exact placement algorithm for the irregular nesting problem. International Journal of Computer Integrated Manufacturing. 2016;29:1177–1189. 

32. Sato AK, Tsuzuki MSG, Martins TC. Study of the grid size impact on a raster based strip packing problem solution. IFAC-Papers On Line. 2016b;49:143–148. 

33. Toledo F, Carravilla M, Ribeiro C. The dotted-board model: A new MIP model for nesting irregular shapes. International Journal of Production Economics. 2013;145:478–487.