数学建模竞赛论文评审优化协商方案摘要大数据时代下，如何利用数据信息，调配资源，合理分配任务是提高系统效能的关键。本文针对数学建模竞赛中论文评分差异过大相关的分数协商分配问题，利用了非线性整数优化、多目标优化及动态演变分析等方法，建立了论文评分协商最优分配模型、有约束的论文协商分配模型和多目标约束协商优化模型。通过MATLAB编程计算，求解得到了最佳的协商方案。针对问题一，首先利用数据信息构造协商关系图，将论文协商分配问题转化为协商关系图的最大边覆盖问题，建立了非线性整数优化模型，并运用遗传算法进行求解模型，得到最优的协商分配方案，整个协商过程耗时仅28min。针对问题二，考虑到不同教师协商工作大小的差别，构造了加权的协商关系图，将老师间协商任务量作为协商关系图中边的权值，在每一轮迭代过程中，动态更新协商关系图中边的权重，建立了动态约束目的优化模型，并运用粒子群算法求解优化方程，在协商教师互不相识的情况，得到最佳的协商分配方案，整个方案耗时65min。针对问题三，鉴于三位老师的特殊情况，将整体论文协商分配问题转化多个协商子问题，分步构造目标优化子模型，从而结合形成有约束多目标优化模型，并提出迭代的多目标遗传优化算法，通过计算，求解得知此条件下的最优协商分配方案，整个协商过程耗时64min,三位老师花费24min结束协商，符合需在14:30之前结束协商的需求。关键词非线性整数优化多目标约束遗传算法最大边覆盖论文协商分配MathematicalmodelingcontestpaperreviewandoptimizationnegotiationschemeAbstractIntheeraofbigdata,howtoutilizedatainformation,allocateresourcesandallocatetasksreasonablyisthekeytoimprovesystemefficiency.Inthispaper,theoptimalallocationmodel,theconstrainedallocationmodelandtheconstrainedallocationmodelareestablishedbyusingthemethodsofnonlinearintegeroptimization,multi-objectiveoptimizationanddynamicevolutionanalysis.ThroughMATLABprogrammingcalculation,thebestnegotiationschemeisobtained.Inviewofproblem1,firstly,anegotiationgraphisconstructedbyusingdatainformation,thethesisnegotiationallocationproblemistransformedintothemaximumedgecoveringproblemofthenegotiationgraph,anonlinearintegeroptimizationmodelisestablished,andageneticalgorithmisusedtosolvethemodel,soastoobtaintheoptimalnegotiationallocationscheme.Thewholenegotiationprocesstakesonly28min.Toquestion2,consideringthedifferencesbetweendifferentteachersconsultationworksize,diagram,constructstheweightednegotiationwillnegotiatetoquotaasnegotiationbetweenteacherdiagramedgeweights,ineachroundofiterationprocess,dynamicupdateconsultationofedgeweightsinthediagram,thedynamicconstraintobjectiveoptimizationmodelwasestablished,andusedtosolvetheoptimizationequationofparticleswarmoptimization(pso),teacherstrangersinconsultation,negotiationscheme,forthebest,thewholeschemetakesonly56min.Forquestion3,inviewofthethreeteachersofspecialcircumstances,thewholethesisnegotiationassignmentproblemintosubproblemsmultiplenegotiation,constructtheobjectiveoptimizationmodel,stepbystepsoastoformaconstrainedmulti-objectiveoptimizationmodelofmulti-objectivegeneticoptimizationalgorithm,andproposestheiterationbycalculation,solvingabouttheoptimaldistributionplanforthenegotiation,undertheconditionofthewholenegotiationprocesstakes64min,inlinewiththethreeteachersdemandshouldbenegotiatedbeforecomestoend.Keywordsnonlinearintegeroptimizationmulti-objectiveconstraintgeneticalgorithmmaximumedgecoveringpapernegotiationallocatio目录引言...................................................................................................................................................11.问题重...
