| 研究実績の概要 |
In accordance with our research proposal, we have successfully generated an array of problems related to seru formation and loading by varying different input elements. These problem sets were used to analyze computational complexities, identifying whether each problem was NP-hard or polynomial and determining its convexity. As anticipated, the majority of the seru problems were NP-hard and non-convex. For the NP-hard problems, we found achievable approximation ratios and subsequently developed polynomial algorithms to obtain solutions with optimal approximation ratios. For non-convex problems, we designed algorithms that can converge to local optimal results.
The process of constructing mathematical models necessitated the identification of key elements relevant to smart manufacturing. These elements were derived from various sources, such as industrial conferences like the Annual Conference of Japan Institute of Industrial Engineering, studying industrial cases in Japanese and English journals and magazines, and engaging in discussions with our MBA students who have direct factory experience.
In conclusion, the work undertaken over the past year represents significant strides in analyzing and modeling seru formation and loading problems. We've adopted a systematic approach that leverages a broad array of input variables to generate detailed mathematical models. We remain committed to the ongoing exploration of this subject, and we look forward to the breakthroughs that the coming year will bring.
|
