Monash University Faculty of Information Technology 2nd Semester 2024
FIT3158 Business Decision Modelling
Assignment 2: Linear Programming, Integer Linear Programming, Network Analysis,
Transportation, Transshipment and Economic Order Quantity (EOQ) - using Microsoft Excel
Solver
This assignment is worth 24% of your final mark (subject to the hurdles described in the
FIT3158 Unit Guide and links therein). Among other things (see below), note the need to hit
the `Submit’ button (and the possible requirement of a video and/or an interview).
Due Date: Monday 30th September 2024, 11:55 pm
Method of submission: Your submission should consist of 2 files:
1. A Microsoft Excel spreadsheet named as:
FamilyName-StudentId-2ndSem2024FIT3158Asst2.xlsx
2. A text-based .pdf file named as: FamilyName-StudentId-2ndSem2024FIT3158Asst2.pdf
Both the files must be uploaded on the FIT3158 Moodle site by the due date and time.
The text-based .pdf file will undergo a similarity check by Turnitin at the time you submit
to Moodle. Please read submission instructions here and elsewhere carefully regarding
the use of Moodle.
Total available marks = 50 + 34 + 16 = 100 marks.
Note 1: Please recall the Academic Integrity rules (and, as per Moodle week 0, you might
also wish to confer with https://www.monash.edu/student-academic-success). This is an
individual assignment. Recall various resources from FIT3158 Moodle week 0.
In submitting this assignment, you acknowledge both that you are familiar with the relevant
policies, rules and regulations regarding Academic Integrity (including, e.g., doing your own
work, not sharing your work, not using ChatGPT in particular, not using generative AI at all)
and also that you are familiar with the consequences of being deemed to be in contravention
of these policies.
Note 2: And a reminder not to post even part of a proposed partial solution to a forum or
other public location. This includes when you are seeking clarification of a question.
If you seek clarification on an Assignment question then – bearing in mind the above – word
your question very carefully and see the `Welcome to FIT3158’ Ed Discussion forum post
(bearing in mind instructions in week 1 Introductory Lecture). If you are seeking to
understand a concept better, then (please see the Welcome post in Ed Discussion, and) try to
word your question so that it is a long way removed from the Assignment (which, in turn,
makes it easier to answer – and probably also able to be answered by more people). You are
reminded that Monash University takes academic integrity very seriously.
Note 3: As previously advised, it is your responsibility to be familiar with the special
consideration policies and special consideration process – as well as academic integrity.
Please see the relevant links within FIT3158 Moodle (week 0 and perhaps also elsewhere).
Students should be familiar with the special consideration policies and the process for
applying.
Note 4: As a general rule, don’t just give a number or an answer like `Yes’ or `No’ without
at least some clear and sufficient explanation - or, otherwise, you risk being awarded 0
marks for the relevant exercise. Make it easy for the person/people marking your work to
follow your reasoning. Your .pdf should typically cross-reference the corresponding
answer in your spreadsheet. For each and every question, sub-question and exercise,
provide a clearly labelled separate spreadsheet tab with clear content, accompanied with
clearly cross-referenced clear .pdf explanation. Without clear cross-reference between .pdf
and spreadsheet tab – and without a separate spreadsheet tab for each sub-question -
there is the possibility that any such exercise will be awarded 0 marks.
Your .pdf file should not be generated from LaTeX (and/or Overleaf), nor OpenOffice, nor
LibreOffice.
Note 4b (and this is part of Note 4) : Re-iterating a point above, for each and every question,
sub-question and exercise, clearly explain your answer and clearly show any working.
Note 5: As a general rule, if there is an elegant way of answering a question without
unnecessarily re-running the Solver, try to do it that way. (Recall, e.g., sensitivity report and
some notions from Week 3 and thereabouts.) More generally, more elegant solutions are
preferable - and will at least sometimes be given more marks (possibly many more marks,
and the inelegant way might possibly get very few marks). Among other things, if a problem
is a linear programming (LP) problem, then it would be more elegant to solve it using the
linear simplex model. In a similar vein, a linking constraint (where appropriate) will be far
preferable to a seemingly equivalent use of the IF() function.
Note 6: You should include a screenshot of the relevant spreadsheet tab in your .pdf file.
Apart from this, all of your submitted work should be in machine readable form, and none of
your submitted work should be hand-written.
Note 7: If you wish for your work to be marked and not to accrue (possibly considerable)
late penalties, then make sure to upload the correct files and (not to leave your files
as Draft). You then need to determine whether you have all files uploaded and that you are
ready to hit `Submit’. Once you hit `Submit’, you give consent for us to begin marking your
work. If you hit `Submit’ without all files uploaded then you will probably be deemed not to
have followed the instructions from the Notes above. If you leave your work as Draft and
have not hit `Submit’ then we have not received it, and it can accrue late penalties once the
deadline passes. In short, make sure to hit ‘Submit’ at the appropriate time to make sure that
your work is submitted. Late penalties will be as per Monash University Faculty of IT and
Monash University policies. Within the requirements of these policies just mentioned, late
penalties will accrue (in line with policy) at a rate of at least 5% per calendar day – where 5%
refers to a proportion of the total marks available. It is possible that any work submitted at
least 10 calendar days after the deadline might be automatically given a mark of 0.
Note 8: The notation 1E-12 corresponds to 1 x 10
-12
, or 0.000000000001. A similar comment
applies to 1E-14. If you see a figure of approximately this magnitude or comparable
magnitude, then consider whether or not it might be round-off error for something else.
Unless otherwise stated, numbers should be stated to at least 3 significant figures, and
numbers less than 10 in magnitude should be stated to at least 3 decimal places.
Note 9: Save your file(s) regularly. Most of the time, we expect that the Solver will run
quickly. But for problems with many variables and many constraints – especially involving
integers – please be mindful that if you are not careful to do some of the things mentioned in
class to help your program finish more quickly, then there is a risk that your program might
possibly go through at least tens or hundreds of thousands of subproblems and become very
slow (as you wait and wait and …). If you save your file before starting a run that could be
long and slow, then you can safely stop the program – if it becomes very slow – with reduced
risk of losing your edit changes.
Note 10: As a general rule for solving a problem using MicroSoft Excel Solver, please
consider carefully whether the various solver (settings or) Options (which you might
be able to access after clicking on `Options’, which might be on the right about twothirds
of the way down after you click on `Solver’) might affect the results provided
by the solver. (As an example, if dealing with integers then give some thought to `Integer
Optimality’.) Put another way, rather than just use the default settings, make sure to check
the solver settings and be willing to appropriately modify them if and as required.
The optimisations to follow throughout Assignment 2 (Questions 1, 2 and 3) could
(variously) include such considerations as (including but not limited to) (e.g.) limiting
pollution, saving time, reducing waste, making the most of limited resources, improving
organ donor and recipient compatibility, etc. It could involve work with the United Nations
(UN) and/or the International Space Station (ISS). Any transportation, transshipment and/or
shortest path problems could possibly pertain to emergency vehicles (e.g., ambulance, fire,
police) and to Search and Rescue (e.g., drones) – or simply cars and trucks.
Question 1 (5 + 4 + 4 + 4 + 6 + 5 + 6 + 5 + 5 + 6 = 50 marks)
Throughout Question 1 and the entire Assignment 2, follow the given notes (near the top –
e.g., Note 4, Note 5, Note 6, etc.) and other instructions.
Consider now Figure 1 immediately below but with the modifications stated just below it.
We make some changes. First, the edge JI now has cost 20. We also add another node (or
vertex), K. We also add three edges – namely, HK (cost 45), JK (cost 70) and IK (cost 45).
This describes the network which we analyse at least for the start of Question 1.
Before starting the exercises in Question 1, please remember that it is the modified version of
Figure 1 (with modifications stated immediately above) that should be used at least to start
the question.
Unless stated otherwise, throughout Question 1 we use the modified version of Figure 1.
Stated edge costs are the costs of moving one vehicle – e.g., moving 2 vehicles along an edge
with stated cost 64 would cost 128.
1a) We wish to move 70 vehicles from A to K.
What is the shortest total cost, and what is the flow along the individual edges?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Also explain whether or not the problem is a linear programming (LP) problem or not - and
why or why not.
(If the problem can be presented as an LP problem then it should be done that way.)
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed.
1b) We wish to move 100 vehicles from B to I.
What is the shortest total cost, and what is the flow along the individual edges?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed.
1c) We wish to move 70 vehicles from A to I.
What is the shortest total cost, and what is the flow along the individual edges?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Also explain whether or not the problem is a linear programming (LP) problem or not - and
why or why not.
(If the problem can be presented as an LP problem then it should be done that way.)
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed.
1d) We wish to move 100 vehicles from B to K.
What is the shortest total cost, and what is the flow along the individual edges?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed.
1e) We re-visit the problem from 1d). However, we make some changes.
The edges HK and IK (which had cost of 45 in parts 1a-1d) are now both modified as
follows. For flow up to 75 (i.e., < 75), these edges still cost 45 per unit. But for flows above
75, the excess flow costs 80 per unit. So, as an example, if HK has a flow of 90 then that
costs 45 * 75 + 80 * (90 – 75) = 45 * 75 + 80 * 15 = 3375 + 1200 = 4575 for the flow on that
edge.
What is the shortest total cost, and what is the flow along the individual edges?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed.
1f) We re-visit the problem from 1d) and 1e). However, we make some changes.
The edges HK and IK (which had cost of 45 in parts 1a-1d) are now both modified as
follows. For flow up to 75 (i.e., < 75), these edges still cost 45 per unit. But for flows above
75, the excess flow now costs 110 per unit. So, as an example, if HK has a flow of 90 then
that costs 45 * 75 + 110 * (90 – 75) = 45 * 75 + 110 * 15 = 3375 + 1650 = 5025 for the flow
on that edge.
What is the shortest total cost, and what is the flow along the individual edges?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed.
1g) Following on from 1f, we include the additional constraint that at most 4 edges have
positive non-zero flow.
What is the shortest total cost, and what is the flow along the individual edges?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed.
1h) Combining 1a and 1b (in some sense), we now have 70 vehicles at A and 100 cars at B.
We are required to supply 70 vehicles to K and 100 vehicles to I.
What is the shortest total cost, and what is the flow along the individual edges?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed.
For the earlier parts of the question, we have assumed that there was just one type of vehicle.
So, those (sub-)questions could be done whether everything was a car or everything was a
truck.
For the remainder of the question, we now assume that there is more than one type of vehicle
(e.g., ambulance, fire truck, police car, other truck, other car). If someone has demand for an
ambulance then they want an ambulance and they might have no need for a fire truck.
For simplicity, we might just assume that there are just two different types of vehicle – car
and truck. For the avoidance of doubt, we want the correct number of cars to go from
source/supply to demand/destination/sink, and we also want the correct number of trucks to
go from source to sink. Put in other words, if a demand node seeks 2 cars and 1 truck but
instead gets 1 car and 2 trucks then that is not a correct answer.
1i) Combining 1a, 1b, 1c and 1d (in some sense), we now have two types of vehicles (cars
and trucks). The cars can be thought of as in 1h. More specifically, we have 70 cars at A and
100 cars at B. We are required to supply 70 cars to K and 100 cars to I. However, we also
have 70 trucks at A and 100 trucks at B. We are required to supply 100 trucks to K and 70
trucks to I.
What is the shortest total cost, and what is the flow (both cars and trucks) along the individual
edges?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed. 1j) This is the same as 1i, but with the additional constraint that no edge can carry more than
100 vehicles. So, whether it’s (e.g.) 100 cars or (e.g.) 100 trucks or (e.g.) 27 cars and 73
trucks, etc., no edge can carry more than 100 vehicles.
What is the shortest total cost, and what is the flow (both cars and trucks) along the individual
edges?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed.
Question 2 (6 + 6 + 6 + 6 + 6 + 4 = 34 marks)
Throughout Question 2 and the entire Assignment 2, follow the given notes (near the top –
e.g., Note 4, Note 5, Note 6, etc.) and other instructions.
There are 8 (agents or) workers to be potentially assigned to 12 possible (tasks or) jobs.
The workers put in their first 4 preferences (P1, P2, P3, P4).
For each worker that gets their 1st preference, there is a score of 10.
For each worker that gets their 2nd preference, there is a score of 6.
For each worker that gets their 3rd preference, there is a score of 3.
For each worker that gets their 4th preference, there is a score of 1.
No additional scores are given when a worker gets their 5th, 6th, 7th, … and/or 12th preference.
The preferences (P1, P2, P3, P4) for each person (a, b, c, d, e, f, g, h) are given below:
2a) Each of the eight workers is to be assigned to at most 1 job each.
No job can be done by more than one worker.
What is the maximum score that can be obtained, and what is the assignment of workers to
jobs?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed. 2b) We modify 2a so that each of the eight workers can be assigned to at most 4 jobs each.
No job can be done by more than one worker.
What is the maximum score that can be obtained, and what is the assignment of workers to
jobs?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed.
2c) We modify 2b so that no more than 6 of the 8 workers can be used.
As before, each of these six workers can be assigned to at most 4 jobs each.
No job can be done by more than one worker.
What is the maximum score that can be obtained, and what is the assignment of workers to
jobs?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed.
2d) We modify 2a and 2b so that all 8 workers can be used but each of these eight workers
can be assigned to at most 2 jobs each.
No job can be done by more than one worker.
What is the maximum score that can be obtained, and what is the assignment of workers to
jobs?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed.
2e) We now modify 2d so that at most one (but not both) of worker a and worker b can do a
task. If either worker a does at least one task or worker b does at least one task, then the
other of these two workers can not do any tasks. Put another way, if worker a does at least
one task then worker b does no task, and if worker b does at least one task then worker a does
no task.
Apart from this, all 8 workers can be used but each of these eight workers can be assigned to
at most 2 jobs each.
No job can be done by more than one worker.
What is the maximum score that can be obtained, and what is the assignment of workers to
jobs?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed.
2f) We modify 2d so that at most 6 workers can be used, and each of these six workers can
be assigned to at most 2 jobs each.
No job can be done by more than one worker.
What is the maximum score that can be obtained, and what is the assignment of workers to
jobs?
Express all variables, the objective function, all constraints, working and solution (values of
decision variables, value of objective function).
Further to Note 4 and Note 6, (here and elsewhere) please place your working and solutions
as instructed.
Question 3 (5 + 5 + 4 + 2 = 16 marks)
This question concerns variants of the Economic Order Quantity (EOQ) model.
Throughout Question 3 and the entire Assignment 2, follow the given notes (near the top –
e.g., Note 4, Note 5, Note 6, etc.) and other instructions.
Consider a monthly demand of 2000, a monthly holding cost of 0.02 = 2%, a cost per unit of
100 Malaysian ringgits (MYR) and an ordering cost of 500 MYR.
Assume no quantity discounts and no back-order penalty.
3a) Calculate the economic order quantity (EOQ) value, Q*.
Show your calculations in your .pdf file.
There might be more than one way to do it in your spreadsheet tab.
Whatever you do, show working and solution values (any decision variable or decision
variables, any optimised objective function).
3b) We re-visit Qu 3a but with a back-order penalty of p = MYR 102.32 per annum.
Calculate Q*, S* and the maximum amount by which we would be out of stock before
replenishing with new stock.
Also state the minimum cost.
Show your calculations in your .pdf file.
Also show your calculations in your spreadsheet tab.
Show working and solution values (any decision variable or decision variables, any optimised
objective function).
3c) We re-visit Qu 3a with discount for bulk orders.
For an order of 1200 or more, there is a bulk discount of 19.5%.
Calculate the optimal Q* and the minimum cost.
Show your calculations in your .pdf file.
Also show your calculations in your spreadsheet tab.
Show working and solution values (any decision variable or decision variables, any optimised
objective function).
3d) Which is cheaper – the value from Qu 3b or the value from Qu 3c?
Adjust the back-order penalty p from Qu 3b until the answers to 3b and 3c agree.
What is the new value of p?
Did you have to increase or decrease p - and, if you had to change p, then by how much?
Recall notes and other instructions at the start of the Assignment and throughout the
Assignment – and in the Ed Discussion `Welcome to FIT3158’ post - and follow these.
END OF FIT3158 ASSIGNMENT 2 (Monash University, 2nd semester 2024)
相关推荐
压液氧(LOX)火箭发动机涡轮泵级建立了一条自动化的基于模型的系统工程(MBSE)与多学科设计优化(MDO)流水线.rar
压液氧(LOX)火箭发动机涡轮泵级建立了一条自动化的基于模型的系统工程(MBSE)与多学科设计优化(MDO)流水线.rar
【FDE知识库】(1):AI 编程时代开发语言选型分析,云使用go,企业用java,算法python,底层c
AI 编程时代,开发语言选型需综合考量AI适配度、编译速度、跨平台与学习成本。Python以海量语料和即时执行成首选,适用于AI/ML与原型开发;TypeScript凭借类型系统与秒级构建,成为前端及应用层主流;Go以极速编译与统一风格,契合AI代理高效迭代需求。Rust/C++虽性能强,但编译慢、学习成本高,不适于快速试错。综合推荐:优先选Python、TypeScript、Go,兼顾效率与生态,实现最优AI协作体验。
在加性高斯白噪声和瑞利衰落信道上,针对BPSK_QPSK的误码率性能的MATLAB仿真,并扩展了相位优化的可重构智能表面辅助链路对比.rar
在加性高斯白噪声和瑞利衰落信道上,针对BPSK_QPSK的误码率性能的MATLAB仿真,并扩展了相位优化的可重构智能表面辅助链路对比.rar
DXF、DWG工程制图文件查看器
DXF、DWG工程制图文件查看器。 可以在界面中进行测量(包括距离、面积、角度等等) 无需版权,放心使用。
python 操作海康威视工业相机资源例子--ParametrizeCamera_LoadAndSave.zip
python 操作海康威视工业相机资源例子--ParametrizeCamera_LoadAndSave
数字农业与乡村振兴行业可信数据空间应用规划方案(专项申报版).pptx
数字农业与乡村振兴行业可信数据空间应用规划方案(专项申报版).pptx
含分布式电源的配电网可靠性评估研究(Matlab代码实现)
内容概要:本文围绕含分布式电源的配电网可靠性评估展开研究,基于Matlab代码实现相应的评估模型。研究内容涵盖分布式电源接入对配电网运行特性的影响,采用序贯蒙特卡洛模拟法等可靠性评估方法,对系统在不同运行场景下的供电可靠性指标进行量化分析。通过构建典型配电网模型,仿真分析分布式电源的位置、容量及出力特性对系统可靠性的影响机制,进而为提升配电网韧性与供电质量提供理论支撑和技术手段。研究不仅关注理论建模,还注重实际仿真流程的可操作性与结果的可视化呈现。; 适合人群:具备电力系统基础知识,从事配电网规划、运行与可靠性分析等相关领域的科研人员及工程技术人员,尤其适合研究生及从事新能源并网研究的1-3年工作经验的专业人员。; 使用场景及目标:①掌握含分布式电源的配电网可靠性评估基本理论与方法;②学习并复现主流可靠性评估算法(如蒙特卡洛模拟)的Matlab编程实现;③分析分布式电源接入对系统可靠性的影响规律,支撑配电网优化规划与运行决策。; 阅读建议:建议读者结合电力系统可靠性教材与本文Matlab代码同步学习,重点关注模型构建逻辑与算法实现细节,动手调试代码以加深对评估流程的理解,并尝试在不同网络结构和电源配置下进行仿真对比分析。
Python 列表、元组、集合实验报告:切片删除陷阱、可哈希判定与保序去重
Python 列表、元组、集合实验报告:切片删除陷阱、可哈希判定与保序去重
具有PWM控制VSC-HVDC链路的IEEE30总线传输系统(Simulink仿真实现)
内容概要:本文详细介绍了在Simulink环境中构建和仿真一个集成PWM控制的电压源换流器型高压直流输电(VSC-HVDC)链路的IEEE30节点电力传输系统的研究工作。该模型聚焦于利用PWM技术实现对VSC的高效、精确控制,以提升电力系统的传输效率、动态响应能力和运行稳定性。研究涵盖了系统整体建模、关键设备参数设计、PWM控制策略的实现、以及在标准IEEE30节点系统上的集成方法。通过一系列仿真测试,包括系统在正常运行、负载突变及故障条件下的动态响应,全面分析了VSC-HVDC链路对改善电网电压稳定性、优化潮流分布和增强系统可靠性的具体作用,充分验证了所提方案的有效性和工程应用价值。; 适合人群:具备电力系统分析、高压直流输电技术基础理论知识及Simulink/MATLAB仿真软件操作能力的高校研究生、科研机构研究人员和电力行业工程师。; 使用场景及目标:①作为教学案例,帮助学生深入理解VSC-HVDC的工作原理、控制策略及其在复杂电网中的集成应用;②为电力系统规划与运行人员提供一种可靠的仿真工具,用于评估新型输电技术对现有电网性能的影响,支持电网升级改造决策;③推动VSC-HVDC技术在远距离大容量输电、新能源并网和智能电网建设等领域的创新应用。; 阅读建议:建议读者在学习过程中,结合电力系统稳态与暂态分析的相关理论,重点关注PWM控制模块和VSC的建模细节,动手复现并调试所提供的Simulink模型,通过改变系统参数和运行工况来观察仿真结果的变化,从而深化对VSC-HVDC系统动态特性的理解。
T03_eVTOL低空经济低空无人机AI识别自动处理图像项目设计方案_决策评审版.pptx
T03_eVTOL低空经济低空无人机AI识别自动处理图像项目设计方案_决策评审版.pptx
基于斜坡补偿的Buck电路峰值电流+电压电流双闭环控制【附说明文档】(Simulink仿真实现)优快云首页发布文章优快云同步助手LLC谐振变换器开环+闭环软启动仿真设计(Simulink
内容概要:本文围绕三电平VIENNA整流器的双闭环控制与中点电位平衡问题展开仿真研究,提出了一种基于上下电容电压差值补偿的中点电位平衡策略。该策略在传统电压电流双闭环PI控制的基础上,引入电容电压差值作为反馈信号,通过SVPWM调制中冗余小矢量的时间分配实现中点电荷的定向调节,从而在不改变主控制结构的前提下有效抑制中点电位偏差。仿真结果表明,该方法不仅确保直流母线电压稳定跟踪800V给定值,还能显著提升上下电容电压的均衡度,同时保持输入电流低谐波水平,验证了控制策略的可行性和有效性。; 适合人群:电力电子、电气自动化及相关专业的研究生、科研人员及工程技术人员,具备一定的MATLAB/Simulink仿真基础和电力电子拓扑知识背景者更佳。; 使用场景及目标:①掌握三电平VIENNA整流器的工作原理与中点电位波动的成因;②理解电压电流双闭环PI控制的设计要点与参数整定原则;③学习基于差值补偿的中点电位平衡控制策略及其与SVPWM的协同机制;④应用于充电桩、航空电源、通信电源等中大功率单向整流场合的控制系统设计与优化。; 阅读建议:建议结合文中提供的仿真模型与参数设置进行动手实践,重点关注中点电位平衡投入前后电容电压波形的变化,对比分析不同工况下的系统动态响应,深入理解控制策略的作用机理。同时可进一步探索在电网不平衡、轻载等复杂工况下的控制性能,以拓展应用场景。
基于变频控制的多相交错LLC谐振变换器闭环仿真(Simulink仿真实现)
内容概要:本文详细介绍了基于变频控制的多相交错LLC谐振变换器的闭环仿真设计,重点阐述了其在Simulink环境下的建模与控制策略。通过多相交错技术有效降低输出纹波电流,提升系统效率与功率密度,并采用变频控制(PFM)实现对谐振变换器输出电压的精确调节。文中构建了完整的闭环控制系统,包含电压外环与电流内环,确保系统在负载变化或输入波动等扰动工况下仍能稳定运行。同时,配套提供了仿真模型、参数设计计算书及参考文献,帮助读者深入理解系统设计流程与关键技术细节,具有较强的工程复现价值。该资源适用于电力电子、新能源变换器等相关领域的仿真研究与教学实践。; 适合人群:具备电力电子基础知识,熟悉Simulink仿真工具,从事电源变换器设计、新能源系统研发或相关专业的研究生及工程技术人员。; 使用场景及目标:①掌握多相交错LLC谐振变换器的工作原理与变频控制机制;②学习并实现基于Simulink的闭环控制系统建模与仿真;③理解谐振参数设计、软开关实现及系统稳定性分析方法;④为科研项目、毕业设计或产品原型开发提供可复用的技术参考与仿真平台。; 阅读建议:建议读者结合提供的仿真模型与计算书,逐步完成系统搭建与参数整定,重点关注变频控制逻辑与闭环响应特性。在仿真过程中,可通过调整负载、输入电压等条件,观察系统的动态响应与稳态性能,加深对多相交错与谐振控制优势的理解。同时推荐参考相关文献,拓展对LLC变换器前沿控制策略的认识。
自适应多机器人编队规划,以包围和跟踪具有运动和可见性约束的目标(Matlab代码实现)
内容概要:本文针对“自适应多机器人编队规划,以包围和跟踪具有运动和可见性约束的目标”开展研究,提出一种基于Matlab的仿真方法,实现多机器人在动态环境中对移动目标的协同包围与持续跟踪。该方法综合考虑了机器人的运动学约束与传感器的视线(visibility)限制,设计了分布式控制策略与自适应编队算法,能够在复杂环境下有效维持编队结构的稳定性和任务执行的鲁棒性。研究详细阐述了系统建模过程、控制律设计原理、编队形成与保持机制,并通过Matlab代码实现了完整的仿真验证,展示了算法在不同动态场景下的适应能力与性能优势; 适合人群:具备机器人学、自动控制理论、多智能体系统等相关基础知识,熟悉Matlab编程语言,从事智能系统、协同控制、路径规划与自主导航等方向的研究生、科研人员及工程技术人员; 使用场景及目标:①应用于安防监控、环境探测、灾害救援等场景中的多机器人目标围捕与跟踪任务;②为多智能体协同控制、分布式编队保持、避障与可见性维护等关键技术提供可复现的算法框架与仿真平台;③辅助高校与科研机构在相关领域的教学演示与科研创新,深化对自适应控制与分布式协同机制的理解; 阅读建议:建议读者结合提供的Matlab代码逐模块分析其实现逻辑,重点关注控制律设计、约束处理与自适应机制部分,可通过调整机器人数量、目标轨迹、传感器参数等进行扩展性实验,以深入掌握多机器人协同系统的动态行为与优化方法。
两路半桥LLC谐振变换器软开关Simulink仿真(模拟谐振参数不同、分裂电容)
内容概要:本文详细介绍了两路半桥LLC谐振变换器软开关的Simulink仿真研究,重点模拟了不同谐振参数及分裂电容对系统性能的影响。通过建立精确的电路模型,分析了软开关实现条件、谐振腔参数变化对电压电流波形、效率及功率传输能力的作用机制,探讨了分裂电容结构在改善均流特性与提升系统稳定性方面的优势。仿真结果有助于深入理解LLC变换器的工作原理与动态响应特性,为高频高效电源设计提供理论支持与优化方向。; 适合人群:电力电子、电气工程及其自动化等相关专业的科研人员、研究生及从事开关电源设计的工程师。; 使用场景及目标:①掌握LLC谐振变换器的基本建模与仿真方法;②研究谐振参数(如谐振电感、电容)对软开关过程的影响规律;③分析分裂电容结构在多路并联变换器中的均流与稳定性作用;④为高频高效DC-DC变换器的设计与优化提供仿真依据和技术参考。; 阅读建议:建议结合Simulink模型逐步操作,关注关键波形的观测点,对比不同参数下的仿真结果,深入理解软开关的实现条件与系统动态特性,同时可进一步拓展至效率分析与热管理设计。
patch_1.23.0.2584_game_No6.android.pak
patch_1.23.0.2584_game_No6.android.pak
状态估计【卡尔曼滤波kalman】UKF、EKF、粒子滤波PF学习与研究(Matlab代码实现)
内容概要:本文系统地研究了无迹卡尔曼滤波(UKF)、扩展卡尔曼滤波(EKF)和粒子滤波(PF)在非线性系统状态估计中的理论基础与实际应用,并结合Matlab代码实现进行了深入剖析。内容涵盖三种滤波算法的核心原理、数学推导及其在轨迹估计等工程问题中的具体实施方法。通过详尽的Matlab编程实例,展示了如何利用这些先进滤波技术解决如目标跟踪、传感器融合等复杂问题,并特别探讨了BP神经网络与EKF结合的优化训练策略以及粒子滤波在提高状态跟踪精度方面的潜力。该资料为希望掌握现代状态估计算法的研究人员和技术爱好者提供了一套完整的理论与实践指南; 适合人群:具备一定编程基础,尤其是熟练使用Matlab工具,且对控制理论、信号处理或相关工程技术领域有初步了解的研发人员和高校学生; 使用场景及目标:① 深入理解UKF、EKF和PF的基本概念及其在非线性动态系统中进行状态变量估计的应用;② 通过Matlab代码实践加深对各滤波器工作机制的理解,能够独立开发相应的算法以应对诸如轨迹预测、多源信息融合等实际挑战;③ 探索将BP神经网络与EKF相结合的新途径,以期提升模型的学习效率和预测准确性; 阅读建议:此资源不仅提供了坚实的理论支撑,还包括丰富的代码示例,建议读者按照文档结构循序渐进地学习,同时动手实现每一个案例,以便更深刻地把握各种滤波技术的关键细节。对于致力于深入研究状态估计领域的专业人士而言,这是一份极具价值的学习材料。
数控基础知识数控加工工序的安排原则
数控基础知识数控加工工序的安排原则
计算机技术发展5大阶段,现阶段计算机技术应用及发展
【摘要】现代计算机科学技术的发展和普及运用,为世界各国民众基础性生产生活实践活动的组织开展路径造成了深刻影响,本文围绕现阶段计算机技术应用及发展,择取两个具体方面,展开了简要分析。【关键词】计算机技术;应用;发展改革开放以来,计算机设备的广泛运用,促进了计算机科学技术的逐步发展成熟。计算机科学技术是具备新兴表现特征的尖端应用技术,其在现代工业生产和社会生活实践活动过程中的广泛引入运用,给世界各国基...
658



被折叠的 条评论
为什么被折叠?



