KMITL
Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/kmitl/1
Browse
4 results
Search Results
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Four-Bar Linkage Path Generation Problems Using a New TLBO and Optimum Path Repairing Technique(2026-03-01) ;Winyangkul, Seksan ;Alfouneh, MahmoudSleesongsom, SuwinA self-adaptive variant of teaching–learning-based optimization, incorporating a diversity archive and referred to as ATLBO-DA, has been proposed. Combined with a new path repairing technique (PRT), it efficiently accomplishes the four-bar linkage path generation problem, but an upgraded version is needed. An update of ATLBO-DA to self-adaptive teaching–learning-based optimization with evenness factor archive (ATLBO-EFA) and a new path repairing technique are proposed at the present. The diversity archive idea of the original version is replaced with the evenness factor archive to increase the exploitation and exploration performance of the TLBO. An optimum path repairing technique (OPRT) is proposed. This novel approach is used to identify the optimum combination of four-bar mechanism types by employing the concept of Degree of Limiting (DL). Moreover, in this article, a comparative analysis of present update and the previous version use to solve four-bar linkage path generation problems is performed. Several path generation problems are solved using both techniques. The results demonstrate that the updated technique consistently outperforms the earlier version, giving superior values for both mean and minimum descriptive statistics. In addition, the results make it clear that ATLBO-EFA and OPRT are superior to the original version. The result of non-parametric statistic testing using Friedman test indicate that ATLBO-EFA ranks 1st at p-value (0.0455) < α (0.05). It can be concluded that ATLBO-EFA with OPRT offers the best solution for solving the four-bar path synthesis problems.1 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, The Conceptual Design of a Variable Camber Wing(2025-06-01) ;Cortez, Spencer Troy P. ;Winyangkul, SeksanSleesongsom, SuwinThe variable camber wing (VCW) is a morphing wing design anticipated to enhance unmanned aerial vehicles’ (UAVs’) performance in flight through continuously changing shape. The performance of VCWs has been proven, but techniques for their integration, including aerodynamic analysis, mechanism synthesis, and structural tests, still lag in development at the conceptual design stage. Therefore, this research focuses on designing a variable camber wing, a key area for the advancement of morphing aircraft. Inspired by the high-lift capabilities of traditional aircraft devices but aiming for smoother airflow through continuous shape alteration, this research proposes a novel three-step design for a structurally integrated VCW. This approach begins with a critical aerodynamic analysis to determine wing shape adaptations across various flight conditions, followed by a mechanism synthesis phase to design a four-bar linkage that accurately approximates the desired trailing edge deflections by utilizing a variant of teaching–learning-based optimization. The objective is to minimize error between the intended and actual coupler link while adhering to design constraints for proper integration in the wing structure. Finally, structural analysis evaluates the skin’s ability to withstand operational loads and ensure the integrity of the VCW system. The design result demonstrates the success of this three-step approach to synthesizing a VCW mechanism that meets the defined aerodynamic (actual deflection of 9.1764°) and structural targets (maximum Von Mises stress of 81.5 MPa and maximum deflection of 0.073 m), paving the way for enhanced aircraft performance. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Determination of storage area and hub via the enhanced elevator kinematics optimization method(2022-01-01) ;atthirawong, walailakLuangpaiboon, PongchanunLocations of storage area and hub are important factor of transport cost. To determine locations, increased transport cost against variable numbers of storage areas and hubs must be considered at the same time. This research shows how to manage locations, via the zero-one integer programming model, which considers total transport costs as incurred by every activity in the transport process. An Enhanced Elevator Kinematics Optimization method was developed from the Aungkulanon, Luangpaiboon, and Montemanni’s Elevator Kinematics Optimization algorithm to determine the optimal locations of storage areas and hubs. It was concluded that the company should have one storage area located in Samut Prakan Province and 12 hubs around the country, compared to the existing 11 hubs, which would result in 3.1% cost reduction. Also, from a further study on storage area fixed cost reduction, it would be possible to increase storage area size leading to a 4.1% cost reduction. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Developing tabu search with intensification and diversification for the seriation problem(2018-06-15)The seriation problem is an important problem in combinatorial optimization. The goal of seriation is to find a linear order for data objects to reveal structural information given a loss or a merit objective function as an objective function. For the seriation problem, finding an optimal solution using exact algorithms (e.g., branch-and-bound) to find the optimal solution is currently impractical for problems with more than 35 objects. In this paper, we develop a new heuristic procedure to maximize the gradient measure which is our selected merit objective function. The proposed heuristic incorporates search intensification and diversification into standard tabu search (TS) algorithm. From our experimental results, it shows that intensification and diversification tabu search (IDTS) outperforms the standard TS algorithms in terms of efficiency, effectiveness, and robustness.
