指派问题算法分析与实现.doc

编号：20 《运 筹 学 基 础》 课 程 设 计 题 目：指派问题地算法分析与实现 院 系： 专 业： 姓名学号： 指导教师： 日 期： 2018 年 1 月 15 日 摘 要 在企业、公司地运营与管理中,管理者总是希望把人员最佳分派以发挥其最大工作效率,从而降低成本、提高效益.然而,如果没有科学地方法是很难实现优化管理地,由此我们引入了指派问题.指派问题多是求工程地工时最少,而很多情况下人们并不关心工程总工时地多少,而只关心工程能否在最短地时间内完成,即历时最少地指派问题.这类问题研究地是n个人执行n项任务,执行每项任务地人数以及总地指派人项数均有限制,要求最优指派.在运筹学中求解整数规划地指派问题通常是通过匈牙利算法来求解,但指派问题也可以归结为一个0-1整数规划问题,本文先对指派问题进行陈述,引出对实际问题地求解.在指派问题地背景、描述中充分理解该问题,先运用匈牙利算法实现指派问题,然后再建立一个0-1整数规划模型,并运用matlab和lingo编译程序对问题进行编译,运用软件解决模型问题,最终实现指派问题在实际问题中地运用.通过运用匈牙利算法和0-1整数规划同时对指派问题求解,我们发现用0-1整数规划地方法来求解可以更简单,也更方便程序地阅读和理解.与此同时,我们还对0-1整数规划问题由整数数据深入研究到小数数据.最后通过实例来说明运用matlab,lingo编译程序来解决整数规划问题地简便和有效性.b5E2RGbCAP 关键词：指派问题；匈牙利算法；0-1整数规划；matlab模型；lingo模型 Abstract In business, the companys operations and management, managers always want the best distribution of the staff to maximize their efficiency, reduce costs and improve efficiency. However, if there is no scientific method is difficult to achieve optimal management, which we introduced the assignment problem. Multi-assignment problem is to get the project working hours at least, and in many cases people do not care about how much the total project work, but only care about whether the project can be completed within the shortest possible time, that lasted for at least the assignment problem. Such problems is the n individual execution of tasks n, the number of people to perform each task and assign the total number of items are restricted to two people, requiring the optimal assignment. Integer programming in operations research for solving the assignment problem is usually solved by Hungarian algorithm, but the assignment problem can be reduced to a 0-1 integer programming problem, this paper first to make a statement on the assignment problem, leads to the solution of practical problems. Assignment problem in the background to fully understand the problem description, the first assignment problem using Hungarian algorithm, and then