Optimization of film-type optical fiber wiring design using mixed-integer programming problem
Springer Science and Business Media LLC - Trang 1-25 - 2023
Tóm tắt
Optical fibers are among the most widely used tools in information communication today, and they have had an active development trajectory. Film interconnection is among the methods applied to optical fibers. However, due to its characteristics, the interconnection design must be done well so that each fiber satisfies several design requirements. In this study, we developed a mathematical model for automatic wiring design using film optical fiber interconnections. To design optical fiber routing from the top to the bottom of the film, we propose an exact solution method using a mixed-integer programming problem and a heuristic method based on the exact solution method. In this paper, we compare the results of our methods with rule-based methods and confirm that our methods are superior. For the experiments, we created sample data based on a previous joint research project with Sumitomo Electric Industries, Ltd. and used it. Additionally, we investigated conditions for wiring design, and this paper discusses conditions for obtaining more efficient wiring methods.
Tài liệu tham khảo
Angilella, V., Chardy, M., Ben-Ameur, W.: Cables network design optimization for the fiber to the home. In: 2016 12th International conference on the design of reliable communication networks (DRCN), pp. 87–94. IEEE (2016)
Bartlett, A., Chartier, T.P., Langville, A.N., Rankin, T.D.: An integer programming model for the sudoku problem. J. Online Math. Appl. 8(1), 1798 (2008)
Bektaş, T., Elmastaş, S.: Solving school bus routing problems through integer programming. J. Oper. Res. Soc. 58(12), 1599–1604 (2007)
Benati, S., Rizzi, R.: A mixed integer linear programming formulation of the optimal mean/value-at-risk portfolio problem. Eur. J. Oper. Res. 176(1), 423–434 (2007)
De Vicente, J., Lanchares, J., Hermida, R.: Placement by thermodynamic simulated annealing. Phys. Lett. A 317(5–6), 415–423 (2003)
Diaz, R.J., Shum, K., Vaillancourt, D.G.: Systems, apparatuses, and methods for managing cables with minimum bend radius (2006). US Patent 7,027,706
Guirardello, R., Swaney, R.E.: Optimization of process plant layout with pipe routing. Comput. Chem. Eng. 30(1), 99–114 (2005)
Gunpinar, S., Centeno, G.: An integer programming approach to the bloodmobile routing problem. Transp. Res. 86, 94–115 (2016)
Janus, N.A., Pellegrino, A., Reagan, R.A.: Fiber optic interconnection combination closure (2002). US Patent 6,385,381
Kanasugi, A.: Algorithms for placement and routing problems. J. Jpn. Inst. Electron. Packag. 2(3), 184–187 (1999). (in japanese)
Kanasugi, A., Nakaya, N.: A single-layer routing method based on maze router and genetic algorithm. IPSJ SIG Tech. Reports 1999(12(1998–SLDM–091)), 97–103 (1999). (in japanese)
Keha, A.B., Khowala, K., Fowler, J.W.: Mixed integer programming formulations for single machine scheduling problems. Comput. Ind. Eng. 56(1), 357–367 (2009)
Magatão, L., Arruda, L.V., Neves, F., Jr.: A mixed integer programming approach for scheduling commodities in a pipeline. Comput. Chem. Eng. 28(1–2), 171–185 (2004)
Marques, I., Captivo, M.E., Vaz Pato, M.: An integer programming approach to elective surgery scheduling: analysis and comparison based on a real case. OR Spectr. 34(2), 407–427 (2012)
Mashayekh, S., Stadler, M., Cardoso, G., Heleno, M.: A mixed integer linear programming approach for optimal der portfolio, sizing, and placement in multi-energy microgrids. Appl. Energy 187, 154–168 (2017)
Sui, H., Niu, W.: Branch-pipe-routing approach for ships using improved genetic algorithm. Front. Mech. Eng. 11(3), 316–323 (2016)
Yoshida, A., Yatsushiro, Y., Hata, N., Higurashi, T., Tateiwa, N., Wakamatsu, T., Tanaka, A., Nagamatsu, K., Fujisawa, K.: Practical end-to-end repositioning algorithm for managing bike-sharing system. In: 2019 IEEE International Conference on Big Data (Big Data), pp. 1251–1258. IEEE (2019)