首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   70篇
  免费   5篇
  国内免费   6篇
综合类   8篇
轻工业   1篇
无线电   2篇
一般工业技术   4篇
自动化技术   66篇
  2021年   2篇
  2020年   1篇
  2019年   1篇
  2017年   4篇
  2016年   6篇
  2015年   6篇
  2014年   5篇
  2013年   7篇
  2012年   7篇
  2011年   3篇
  2010年   3篇
  2009年   8篇
  2008年   8篇
  2007年   6篇
  2006年   8篇
  2004年   1篇
  2003年   2篇
  2002年   1篇
  1999年   1篇
  1997年   1篇
排序方式: 共有81条查询结果,搜索用时 15 毫秒
1.
In this paper we study the design and optimization of train timetabling adapted to a dynamic demand environment. This problem arises in rapid train services which are common in most important cities. We present three formulations for the problem, with the aim of minimizing passenger average waiting time. The most intuitive model would consider binary variables representing train departure times but it yields to non-linear objective function. Instead, we introduce flow variables, which allow a linear representation of the objective function. We provide incremental improvements on these formulations, which allows us to evaluate and compare the benefits and disadvantages of each modification. We present a branch-and-cut algorithm applicable to all formulations. Through extensive computational experiments on several instances derived from real data provided by the Madrid Metropolitan Railway, we show the advantages of designing a timetable adapted to the demand pattern, as opposed to a regular timetable. We also perform an extensive computational comparison of all linear formulations in terms of size, solution quality and running time.  相似文献   
2.
排课既是高校教学管理中一项重要而复杂的工作,又是一个多目标约束组合优化问题,为此使用量子进化算法来求解高校排课问题。首先研究了量子进化算法的关键技术,然后根据量子进化算法求解优化问题的思路设计了高校排课算法。通过实验表明,本文方法能够根据开课任务自动完成排课过程,排课的成功率和效率都比较好。  相似文献   
3.
This paper investigates the robust graph coloring problem with application to a kind of examination timetabling by using the matrix semi-tensor product, and presents a number of new results and algorithms. First, using the matrix semi-tensor product, the robust graph coloring is expressed into a kind of optimization problem taking in an algebraic form of matrices, based on which an algorithm is designed to find all the most robust coloring schemes for any simple graph. Second, an equivalent problem of robust graph coloring is studied, and a necessary and sufficient condition is proposed, from which a new algorithm to find all the most robust coloring schemes is established. Third, a kind of examination timetabling is discussed by using the obtained results, and a method to design a practicable timetabling scheme is presented. Finally, the effectiveness of the results/algorithms presented in this paper is shown by two illustrative examples.  相似文献   
4.
In this paper we present an integer programming method for solving the Classroom Assignment Problem in University Course Timetabling. We introduce a novel formulation of the problem which generalises existing models and maintains tractability even for large instances. The model is validated through computational results based on our experiences at the University of Auckland, and on instances from the 2007 International Timetabling Competition. We also expand upon existing results into the computational difficulty of room assignment problems.  相似文献   
5.
Integer Programming (IP) has been used to model educational timetabling problems since the very early days of Operations Research. It is well recognized that these IP models in general are hard to solve, and this area of research is dominated by heuristic solution approaches. In this paper a Two-Stage Decomposition of an IP model for a practical case of high school timetabling is shown. This particular timetabling problem consists of assigning lectures to both a timeslot and a classroom, which is modeled using a very large amount of binary variables. The decomposition splits this model into two separate problems (Stage I and Stage II) with far less variables. These two separate problems are solved in sequence, such that the solution for the Stage I model is given as input to the Stage II model, implying that irreversible decisions are made in Stage I. However, the objective of the Stage II model is partly incorporated in the Stage I model by exploiting that Stage II can be seen as a minimum weight maximum matching problem in a bipartite graph. This theoretically strengthens the decomposition in terms of global optimality. The approach relies on Hall's theorem for the existence of matchings in bipartite graphs, which in its basic form yields an exponential amount of constraints in the Stage I model. However, it is shown that only a small subset of these constraints is needed, making the decomposition tractable in practice for IP solvers. To evaluate the decomposition, 100 real-life problem instances from the database of the high school ERP system Lectio are used. Computational results show that the decomposition performs significantly better than solving the original IP, in terms of both found solutions and bounds.  相似文献   
6.
针对高校教室调度问题进行了研究,综合考虑教室集中时间利用率和学生需求,采用三元组方式,用任务表示课程,用设备表示不同类型的教室。据此,教室排课问题被描述为一类以最小化Cmax与滞后时间和为调度目标,具有机器适用限制的并行机调度问题。然后结合问题特性,建立对应的运筹学调度模型,并运用混合粒子群算法求解该类调度问题。最后仿真结果表明实现了所讨论的两个优化调度目标,获得了满意解;同时通过与其他算法解的比较,得出混合粒子群算法非常适合求解这里所讨论的教室排课问题这一结论。  相似文献   
7.
就高校排课问题进行归纳和分析,从信息管理的角度,提出基于SQL关系运算的高校排课系统分析与设计思路;重点从模块功能设计与算法应用进行探讨,提出系统解决方案,并就排课算法设计进行描述。  相似文献   
8.
A key process for post-secondary educational institutions is the definition of course timetables and classroom assignments. Manual scheduling methods require enormous amounts of time and resources to deliver results of questionable quality, and multiple course and classroom conflicts usually occur. This article presents a scheduling system implemented in a Web environment. This system generates optimal schedules via an integer-programming model. Among its functionalities, this system enables direct interaction with instructors in order to gather data on their time availability for teaching courses. The results demonstrate that significant improvements over the typical fully manual process were obtained.  相似文献   
9.
排课问题的多个优化目标间可能是冲突的,如何有效优化求解的多个目标,是排课问题的关键。适应度计算方法影响遗传算法的采样空间和执行效率,研究适应度的求解方法有助于解决多目标优化问题。利用多目标决策协调模型进行排课问题的改进适应度求解方法的研究,以优化遗传算法的采样空间,加快算法的收敛。把该方法应用到排课问题中,实验结果表明对目前仍没有较好解决方法的组合优化问题,可以得到比较容易的解决。  相似文献   
10.
基于GENET的时间表问题自动求解算法   总被引:2,自引:0,他引:2  
构造大学考试时间表自动生成系统是一个知名的问题.本文用约束满足问题模型来描述大学考试时间表问题,并提出了一个基于GENET的局部搜索算法来解该问题.该算法采用一些问题相关的策略来提高局部搜索效率.实验结果表明,将“强约束违反”转化为“弱约束违反”的方法能大大地提高算法性能,使该算法优于GENET和演化算法。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号