SEJ103 ASSESSMENT TASK 4 (AT4) – DESIGN REPORT FOR BENDING ACTION T2 2024SQL

Java Python SEJ103                                T2 2024

ASSESSMENT TASK 4 (AT4) – DESIGN REPORT FOR BENDING ACTION

• Wind Turbine Bending and Shear Loading Design

• This is an Individual Assignment Report

• Weight: 35% of the Unit (hurdle applies for AT4)

Aim:

In Assessment Task 4, you are going to check your blade and tower design for bending, deflection and shear.

Figure 1: Wind Loading for Bending Design

KEY ASSUMPTIONS:

1. The design check will be based on the student design in AT3.

2. Wind will be assumed as whole gale force of 24.5 – 28.4 m/s matching the Beauford Scale [1].

3. Wind can be considered to be distributed evenly (as uniformly distributed load) for the whole height of the turbine for simplification.

Tasks to complete for the Report:

TASK 1 – BENDING AND DEFLECTION CHECK OF AT3 DESIGN:

Using the final optimised design from AT3 and any new parameters that need to be defined, perform. bending and deflection checks and identify if the design meets bending and deflection requirements.

TASK 2 – OPTIMISED WORKING DESIGN FOR BENDING AND SHEAR:

Develop an optimised solution for the blades and the column that still meets all the axial design requirements, meets shear requirements, while now being optimised for bending. This can be through material selection, material minimisation, selection of various SEJ103 ASSESSMENT TASK 4 (AT4) – DESIGN REPORT FOR BENDING ACTION T2 2024SQL open or close section (geometric details of the cross-section) or other methods.

You must also discuss what other failure criteria (covered on Week 10) need to be considered for blade and tower. Provide detail, but concise explanation of how you have considered these criteria in your design choices/methodology. Your optimisations need to be clearly shown and explained.

Task 3 – DISCUSS YOUR AXIAL ONLY DESIGN VS BENDING DESIGN

Discuss and reflect on any similarities and any differences for your Wind Turbine Blade and Tower components in your design for Axial only loading compared to your Bending load design.

General Guidelines:

You will need to produce an Individual proposal report (approximately 10 pages).

You report should include:

• a brief explanation of the project and scope or the report.

• simple free body diagrams of the blades and the column (based off Appendix A and B) to identify the loads and key dimensions you are using.

• cross sections of the blades and tower (from AT3) and calculations to show if they can meet bending stress and bending deflection requirements.

• a section discussing which failure mechanism you have researched and ways you could address this type of failure in your design method (implementation accounting for this failure method is not required in this assignment).

• final cross sections of the blades and Tower and calculations supporting they can meet axial stress and axial deflection requirements, bending stress and bending deflection requirements, shear stress requirements         

基于遗传算法的新的异构分布式系统任务调度算法研究(Matlab代码实现)内容概要:本文档围绕基于遗传算法的异构分布式系统任务调度算法展开研究,重点介绍了一种结合遗传算法的新颖优化方法,并通过Matlab代码实现验证其在复杂调度问题中的有效性。文中还涵盖了多种智能优化算法在生产调度、经济调度、车间调度、无人机路径规划、微电网优化等领域的应用案例,展示了从理论建模到仿真实现的完整流程。此外,文档系统梳理了智能优化、机器学习、路径规划、电力系统管理等多个科研方向的技术体系与实际应用场景,强调“借力”工具与创新思维在科研中的重要性。; 适合人群:具备一定Matlab编程基础,从事智能优化、自动化、电力系统、控制工程等相关领域研究的研究生及科研人员,尤其适合正在开展调度优化、路径规划或算法改进类课题的研究者; 使用场景及目标:①学习遗传算法及其他智能优化算法(如粒子群、蜣螂优化、NSGA等)在任务调度中的设计与实现;②掌握Matlab/Simulink在科研仿真中的综合应用;③获取多领域(如微电网、无人机、车间调度)的算法复现与创新思路; 阅读建议:建议按目录顺序系统浏览,重点关注算法原理与代码实现的对应关系,结合提供的网盘资源下载完整代码进行调试与复现,同时注重从已有案例中提炼可迁移的科研方法与创新路径。
【微电网】【创新点】基于非支配排序的蜣螂优化算法NSDBO求解微电网多目标优化调度研究(Matlab代码实现)内容概要:本文提出了一种基于非支配排序的蜣螂优化算法(NSDBO),用于求解微电网多目标优化调度问题。该方法结合非支配排序机制,提升了传统蜣螂优化算法在处理多目标问题时的收敛性和分布性,有效解决了微电网调度中经济成本、碳排放、能源利用率等多个相互冲突目标的优化难题。研究构建了包含风、光、储能等多种分布式能源的微电网模型,并通过Matlab代码实现算法仿真,验证了NSDBO在寻找帕累托最优解集方面的优越性能,相较于其他多目标优化算法表现出更强的搜索能力和稳定性。; 适合人群:具备一定电力系统或优化算法基础,从事新能源、微电网、智能优化等相关领域研究的研究生、科研人员及工程技术人员。; 使用场景及目标:①应用于微电网能量管理系统的多目标优化调度设计;②作为新型智能优化算法的研究与改进基础,用于解决复杂的多目标工程优化问题;③帮助理解非支配排序机制在进化算法中的集成方法及其在实际系统中的仿真实现。; 阅读建议:建议读者结合Matlab代码深入理解算法实现细节,重点关注非支配排序、拥挤度计算和蜣螂行为模拟的结合方式,并可通过替换目标函数或系统参数进行扩展实验,以掌握算法的适应性与调参技巧。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值