Finding a feasible course schedule using Tabu search(2)

文章地址Finding a feasible course schedule using Tabu search翻译进度 [#] 介绍 [#] 问题描述 [#] 禁忌搜索技术 [ ] 修改禁忌搜索 [ ] 数字化结果 [ ] 扩展 [ ] 结束语 上一篇链接 Tabu search techniquesTabu search is a metaheuristic designed for getting a global optimum to a combinatorial optimization problem. It has been first suggested by Glover [lo] and independently by Hansen et al. [l 11 for a specific application, and later developed in a more general framework. A description of the method can be found in [6, 10]. Tabu search has already been efficiently adapted to a large collection of applications [6,11-14,16] We shall sketch here the basic ideas of the technique.An objective function f has to be minimized on a set X of feasible solutions. A neighborhood N(s) is defined for each solution s in X. The set X and the definition of the neighborhood induce a state-space graph G (which may by the way be infinite). Tabu search is basically an iterative procedure which starts from an initial feasible solution and tries to reach an optimal solution by moving step by step in the state-space graph G. Each step consists in first generating a collection V of solutions in the neighborhood N(s) of the current solution s, and then moving to the best solution s’ in V, even if f (s?> f (s). Let us write s’=s⊕m with the meaning that s’ is obtained by applying a modification m to s. The solutions consecutively visited in the iterative process induce an oriented path in G. Finding the best solution in V may sometimes be a nontrivial matter. It may be necessary to solve the optimization problem min(_f(si) 1 Si E V} by a heuristic procedure.A risk of cycling exists as soon as a solution s’ worse than s is accepted. In order to prevent cycling to some extent, modifications which would bring us back to a previously visited solution should be forbidden. But it may sometimes be useful to come back to an already visited solution and continue the search in another direction from there. This is realized in Tabu search by keeping a list T containing the last k modifications (k may be fixed or variable). Whenever a modification m is made for moving from s to s’, m is introduced in T and its reverse is considered as tabu.Deciding that some moves are tabu moves may be too absolute: it is shown in [6] that moves to solutions which have not been visited may be tabu. For this reason, it should be possible to cancel the tabu status of a move if it seems desirable to do so. This is realized as follows. Let s be the current solution and m a modification which we want to apply to s. A penalization a(s, m) and a threshold value A(s, m) are computed: if a(s, m)     继续阅读
MXlwq's avatar
MXlwq 3月 16, 2016
 | 

生命是一连串长期而持续的累积

摘自彭教授的书:《生命是一连串长期而持续的累积》生命是一种长期而持续的累积过程,绝不会因为单一的事件而毁了一个人的一生,也不会因为单一的事件而救了一个人的一生。     继续阅读
MXlwq's avatar
MXlwq 3月 16, 2016
 | 

对Java的String类的掌握还是不够

20160318添加String类和其他基本数据类型包装类转换String运用正则表达式 昨晚改FireFight的代码,有用到了处理字符串,这点自己以前没有掌握好,再加上Java JTextArea的文字处理,把这个问题想复杂了,要实现的是只处理JTextArea中的最后一行,并且能够识别输入的换行,并将换行删除,用到了split方法     继续阅读
MXlwq's avatar
MXlwq 3月 16, 2016
 | 

进程和线程的简单解释

原文出处http://www.ruanyifeng.com/blog/2013/04/processes_and_threads.html 进程(process)和线程(thread)是操作系统的基本概念,但是它们比较抽象,不容易掌握。最近,我读到一篇材料,发现有一个很好的类比,可以把它们解释地清晰易懂。     继续阅读
MXlwq's avatar
MXlwq 3月 14, 2016
 | 

MarkDown规则

这里是一级标题这里是三级标题这里是六级标题,就到这里了,木有七级!     继续阅读
MXlwq's avatar
MXlwq 3月 13, 2016
 | 

Finding a feasible course schedule using Tabu search(1)

文章地址Finding a feasible course schedule using Tabu search翻译进度 [#] 介绍 [#] 问题描述 [ ] 禁忌搜索技术 [ ] 修改禁忌搜索 [ ] 数字化结果 [ ] 扩展 [ ] 结束语 作者和期刊相关期刊:Discrete Applied MathematicsTHE JOURNAL OF COMBINATORIAL ALGORITHMS, INFORMATICS AND COMPUTATIONAL SCIENCES组合算法,信息与计算科学期刊     继续阅读
MXlwq's avatar
MXlwq 3月 12, 2016
 | 

新的开始

    继续阅读
MXlwq's avatar
MXlwq 3月 12, 2016
 | 

Java数组小结

两种数组类型数组名的不同     继续阅读
MXlwq's avatar
MXlwq 3月 03, 2016
 | 

Java String类

20160607更新修正 ##Java String类的方法##1. String对象的初始化由于String对象特别常用,所以在对String对象进行初始化时,Java提供了一种简化的特殊语法,格式如下: String s = “abc”; s = “Java语言”;其实按照面向对象的标准语法,其格式应该为: String s = new String(“abc”); s = new String(“Java语言”);只是按照面向对象的标准语法,在内存使用上存在比较大的浪费。例如String s = new String(“abc”);实际上创建了两个String对象,一个是”abc”对象,存储在常量空间中,一个是使用new关键字为对象s申请的空间。其它的构造方法的参数,可以参看String类的API文档。     继续阅读
MXlwq's avatar
MXlwq 3月 02, 2016
 | 

MFC单文档中添加按钮控件和消息响应函数

详细见:http://blog.csdn.net/lwq573384928/article/details/50240455     继续阅读
MXlwq's avatar
MXlwq 12月 09, 2015
 |