高校排课问题与算法分析

高校教务管理工作中,课程安排是一项重要而又复杂的基本工作。排课问题是典型的多重约束和组合优化的问题,通过最优的排列组合合理分配教学资源。本文通过对排课问题基本要素及相互约束条件的分析,结合自身实践描述了课表的编排原则,同时对模拟退火算法、图论法、遗传算法、蚁群算法等主要排课算法的原理和特点进行了阐述。     

云计算环境下基于遗传蚁群算法的任务调度

研究了云计算环境下的任务调度问题,通过构造云计算环境下的任务调度模型,提出了一种混合调度算法,该算法是蚁群算法与遗传算法的有机融合。其中的遗传算法采用间接编码方式,结合由遗传算法衍生出的优化解,对蚁群信息素的分布进行初始化处理,使遗传算法的快速搜索能力得到充分利用,并通过克服蚁群算法的起始信息素不足问题,加快了求解速度。云计算环境下的仿真实验结果表明,该混合算法是一种行之有效的任务调度算法。     

改进分区蚁群算法在Ad Hoc网络路由中的应用

本文针对当前Ad Hoc网络路由的特点,在Ad Hoc路由优化算法基础上提出一种改进的蚁群算法.该算法首先将影响蚁群算法性能的参数作为遗传算法中的染色体,通过迭代找出最优的参数组合,然后对区域节点采用动态邻域分解的同时进行并行优化计算,最后将各子区域进行邻域全局连接得到最优解,该算法体现"分而治之"的思想.实验仿真结果表明,改进算法有效地提高了网络传输性能和通信效率,在性能上较基本蚁群算法有更大的优势.     

一种基于遗传蚁群算法的海量案例检索方法

针对传统的蚁群算法在海量案例检索应用中,由于冗余案例数据的干扰,算法易陷入局部最优解而不能对解空间进行全面搜索的缺陷,将具有快速良好的全局搜索能力的遗传算法加入到蚁群系统的每一次迭代过程中,提出了一种融合遗传算法和蚁群算法的案例检索算法,对案例进行聚类处理,建立案例映射模型,克服了蚁群算法的缺陷.实验结果表明,利用本文提出的遗传蚁群算法进行案例检索,能够有效地提高案例检索的效率,取得了令人满意的效果.     

混合遗传蚁群算法的改进及在TSP问题中的应用研究

蚁群算法(ACA)与遗传算法(GA)都属于仿生型优化算法,是解决组合优化问题的强有力工具,并都分别成功应用于旅行商问题(TSP)中.本文将两种算法进行融合,并给出了新的融合方式.实验结果表明,新的遗传蚁群混合算法有效地改进了算法的全局收敛性,并加快了收敛速度.     

基于云计算资源调度的多Agent遗传算法

针对标准遗传算法在云计算资源调度的应用中往往会出现负载不均的问题,本文提出了一种基于云计算资源调度的多Agent遗传算法,首先引入蚁群算法,利用蚂蚁变换方向的影响权重对标准遗传算法的信息素关联进行优化,然后优化了原算法的信息素更新方式,最后利用小生境方法限制种群个体的繁衍,以达到种族多样化的优化。仿真试验结果表明,本文提出的基于云计算资源调度的多Agent遗传算法在CPU利用率和内存利用率上比标准遗传算法具有更优秀的性能。     

基于求解TSP问题的ACA-GA-PSO算法

为了有效求解TSP问题,提出一种融合蚁群算法、遗传算法、粒子群优化算法思想的混合算法。该算法基于最大-最小蚁群系统框架,在选择下一个城市时采用局部搜索策略避免陷入局部最优,在每次循环结束时用演化交叉策略优化得到的全局最短路径,从而提高求解TSP问题的求解精度及收敛速度。TSPLIB中不同规模的TSP问题的仿真实验结果表明了该算法的有效性与可行性。     

基于蚁群算法的无线传感器网络路由算法实现

本文利用蚁群算法简单、局部工作等特点,结合传感器网络的特征,分析研究了基于蚁群算法的WSN路由算法,并阐述了蚁群算法的无线传感器网络路由算法的实现和仿真设计与分析。     

改进蚁群算法在车间作业调度问题中的应用

Job Shop问题是与实际生产相关的多约束组合优化问题,具有约束较多,计算量大的特点,一直以来是研究的热点。应用改进型蚁群算法解决车间作业调度问题。在原有标准蚁群算法的基础上采用了新的信息素更新规则,提高了算法的效率和可用性。实验结果表明算法对解决小规模Job Shop问题有很好的性能。     

基于多目标鱼群-蚁群算法的水资源优化配置

为了解决复杂的水资源优化配置问题和丰富智能优化方法在水资源优化配置中的应用,建立了以经济、社会、环境综合效益最大为目标的水资源优化配置模型和多目标鱼群-蚁群算法。经济效益以区域供水带来的直接经济效益最大为目标;社会效益以区域总缺水量最小为目标;生态环境效益以区域重要污染物排放量最小为目标;约束条件包括供水、需水、水环境和经济发展协调度等。多目标鱼群-蚁群算法融合了人工鱼群算法的快速跟踪变化和跳出局部极值优点以及蚁群算法的信息素正反馈优点,并将人工鱼群算法中的拥挤度概念引入到蚁群算法中,避免了蚁群算法初期可能早熟的问题。通过实验仿真,此算法具有较快的收敛速度和较高的寻优性能,能有效地找到优化解,从而为解决复杂的水资源优化配置问题提供了新的思路。     

基于离散粒子群算法的多约束多目标优化

利用粒子群算法(PSO)提出了一个新的粒子编码方法,并将其用于高校排课问题。通过对某高校的排课数据进行测试,结果表明,本文所提出的改进PSO算法对于解决高校排课问题的优化是有效的,对其它多目标问题地求解也有借鉴意义。     

Financial crisis prediction model using ant colony optimization

Financial decisions are often based on classification models which are used to assign a set of observations into predefined groups. Different data classification models were developed to foresee the financial crisis of an organization using their historical data. One important step towards the development of accurate financial crisis prediction (FCP) model involves the selection of appropriate variables (features) which are relevant for the problems at hand. This is termed as feature selection problem which helps to improve the classification performance. This paper proposes an Ant Colony Optimization (ACO) based financial crisis prediction (FCP) model which incorporates two phases: ACO based feature selection (ACO-FS) algorithm and ACO based data classification (ACO-DC) algorithm. The proposed ACO-FCP model is validated using a set of five benchmark dataset includes both qualitative and quantitative. For feature selection design, the developed ACO-FS method is compared with three existing feature selection algorithms namely genetic algorithm (GA), Particle Swarm Optimization (PSO) algorithm and Grey Wolf Optimization (GWO) algorithm. In addition, a comparison of classification results is also made between ACO-DC and state of art methods. Experimental analysis shows that the ACO-FCP ensemble model is superior and more robust than its counterparts. In consequence, this study strongly recommends that the proposed ACO-FCP model is highly competitive than traditional and other artificial intelligence techniques.     

基于.net的高校排课管理系统

介绍了高校排课管理系统中遇到的多种冲突矛盾,给出了解决这些矛盾的方法;提出了一种依据教学计划,以教学班级的授课任务为单位,自动完成选取学期课程、选择教室、安排授课时间和教学场地的高效的智能排课系统方案。实现算法为：先安排教学任务时间,再根据授课时间和所授课程类别安排教室。     

基于UML的自动排课系统的需求分析

UML是建立系统模型和分析业务处理流程的强有力的可视化建模工具。文中探讨了基于UML的系统需求分析的方法,并用此方法对《基于并行处理机调度算法思想的高校智能排课系统》进行了需求分析。实践表明：与传统的以文字说明方式的需求分析方法相比,用UML进行需求分析具有良好的优越性。     

VIDPSO: Victim item deletion based PSO inspired sensitive pattern hiding algorithm for dense datasets

Collaborative frequent itemset mining involves analyzing the data shared from multiple business entities to find interesting patterns from it. However, this comes at the cost of high privacy risk. Because some of these patterns may contain business-sensitive information and hence are denoted as sensitive patterns. The revelation of such patterns can disclose confidential information. Privacy-preserving data mining (PPDM) includes various sensitive pattern hiding (SPH) techniques, which ensures that sensitive patterns do not get revealed when data mining models are applied on shared datasets. In the process of hiding sensitive patterns, some of the non-sensitive patterns also become infrequent. SPH techniques thus affect the results of data mining models. Maintaining a balance between data privacy and data utility is an NP-hard problem because it requires the selection of sensitive items for deletion and also the selection of transactions containing these items such that side effects of deletion are minimal. There are various algorithms proposed by researchers that use evolutionary approaches such as genetic algorithm(GA), particle swarm optimization (PSO) and ant colony optimization (ACO). These evolutionary SPH algorithms mask sensitive patterns through the deletion of sensitive transactions. Failure in the sensitive patterns masking and loss of data have been the biggest challenges for such algorithms. The performance of evolutionary algorithms further gets degraded when applied on dense datasets. In this research paper, victim item deletion based PSO inspired evolutionary algorithm named VIDPSO is proposed to sanitize the dense datasets. In the proposed algorithm, each particle of the population consists of n number of sub-particles derived from pre-calculated victim items. The proposed algorithm has a high exploration capability to search the solution space for selecting optimal transactions. Experiments conducted on real and synthetic dense datasets depict that VIDPSO algorithm performs better vis-a-vis GA, PSO and ACO based SPH algorithms in terms of hiding failure with minimal loss of data.     

现代企业战略网络关系管理过程研究

组织间关系作为企业的关键资源,使得关系管理成为战略网络的主要管理模式.论述了关系管理在战略网络管理作用的基础上,结合组织冲突理论和联盟网络理论等,从过程论和组织间关系理论的视角,提出现代企业战略网络关系管理过程的动态模型,并对模型作进一步分析,为企业有效地实施战略网络关系管理提供理论指导.     

基于改进的遗传算法的后非线性盲源分离

针对后非线性盲源分离中非线性参数估计中存在的问题,提出一种基于改进的自适应遗传算法的后非线性盲源分离方法.该方法给出一种新的适应度函数,利用适应度函数值反馈调节交叉概率和变异概率的选取,并将优先进化策略和模拟退火机制引入遗传算法中,再通过线性分离算法得到分离矩阵.仿真验证表明,该方法较传统方法具有更快的收敛速度和较高的分离精度.     

基于GA-BP神经网络的扬声器音盆性能预测技术

在电声零器件制造行业中,扬声器音盆的性能好坏直接关系到扬声器产品的质量.本文提出用遗传算法(GA)优化BP神经网络模型对扬声器音盆性能进行预测.在分析了BP神经网络原理的基础上,主要阐述了如何应用遗传算法优化BP神经网络,以改进BP神经网络收敛速度慢、易陷入局部极小值的缺点.针对音盆产品特点,建立音盆性能的GA-BP神...     

Stability analysis of networked control systems with round-robin scheduling and packet dropouts

In this paper, the stability of networked control systems (NCSs) with communication constraints at both channels is investigated. A Conventional Round-Robin Scheduling (CRRS) is applied to deal with the communication constraints issue for its simple structure. Furthermore, a Dynamic Round-Robin Scheduling (DRRS), which can preserve the controllability and the detectability of the systems, is considered. For the unreliable communication channels, two independent homogeneous Markov chains are selected to model the packet dropouts phenomenon in the sensor-to-controller (S/C) channel and the controller-to-actuator (C/A) channel. According to the periodic property of the Round-Robin Scheduling (RRS), an auxiliary system with augmented Markov chain is established by the lifting technique to facilitate the stability analysis of the closed-loop system. A necessary and sufficient condition of the exponential mean-square stability for the NCSs is derived. Two illustrative examples are shown to demonstrate the effectiveness of the proposed stability analysis method.     

基于Media Queries的精品课程网站重构研究

精品课程是网络教学资源的重要组成部分,而构建适合于智能移动客户端访问的精品课程资源不仅是对现有精品课程的提升与扩展,同时也是M-Learning的理念之体现。针对现有精品课程网站是重新建设还是进行重构这个问题,提出了一个重构原则。并对重构原理及技术实现进行了详细分析,提出采用Media Queries来实现。