共查询到20条相似文献,搜索用时 109 毫秒
1.
2.
基于改进自适应遗传算法的网格任务调度算法 总被引:3,自引:0,他引:3
肖莉萍 《中国制造业信息化》2009,38(1)
针对网格环境动态多变性的特点,对网格环境任务调度中的遗传算法进行研究,提出一种改进的自适应遗传算法.通过对影响遗传算法行为和性能的关键参数交叉概率与变异概率进行分析,提出利用自适应思想以及表征调度性能的种群适应度对交叉概率和变异概率合理选取的自适应遗传算法,使交叉概率和变异概率能随种群适应度自动调节、改变.试验结果表明,改进的自适应遗传算法能使网格任务调度具有较好的种群自适应度,从而表明该方法的有效性. 相似文献
3.
《机电工程》2015,(10)
针对用遗传算法求解车间调度问题(job shop problem)容易早熟的缺点,对遗传算法的收敛性、搜索效率和最优解等方面进行了研究,改进了遗传算法,引入了模拟退火算法,提出了新的混合遗传算法。重新设计了基于工件编号的交叉算子和变异算子;采用自适应交叉概率和变异概率;在每一代遗传进化中引入了Metropolis接受准则。通过结合遗传算法、自适应概率和模拟退火算法的各自优点,提高了算法搜索能力。用遗传算法、模拟退火算法和混合遗传算法对Job Shop Problem中FT06问题进行了仿真。仿真结果表明,混合遗传算法提高了搜索效率,能够找到最佳的调度方案。 相似文献
4.
5.
作业调度问题(JSP)是一类典型的NP-hard问题,遗传算法作为一种通用的优化算法在求解JSP中得到了广泛的应用.针对车间作业优化调度问题,通过对原有遗传算法进行了改进,建立了具体的基于遗传算法的改进模型,使其在优化过程中自动给出比较合适的交叉概率和变异概率,并保持群体的多样性,方法和解决步骤,显著提高了搜索效率.较好地解决了车间资源优化调度问题. 相似文献
6.
7.
针对柔性作业车间调度问题,提出了一种将模拟退火算法和莱维(Levy)飞行扰动策略引入传统遗传算法(Genetic Algorithm, GA)的改进混合遗传算法。基于传统遗传算法,增加了自适应交叉概率和变异概率,生成初始种群后,对优秀个体进行保护,对性能较差的个体进行模拟退火和Levy飞行操作,克服了传统遗传算法的“早熟”和易陷入局部最优解的问题。通过仿真对比实验的测试,证明了该算法的有效性和优越性。 相似文献
8.
针对轮胎加工生产过程中的瓶颈即硫化工序的生产调度,建立了一个基于改进自适应遗传算法的调度方案.改进自适应遗传算法相对于普通遗传算法,能够更有效收敛于目标,提高运算速度,并通过实例证明了该算法的有效性和可行性. 相似文献
9.
针对已有的启发式算法在应用于带有缓存约束的作业车间调度时求解精度不高的问题,提出将解决方案从工件层级扩展到工序层级,并采用遗传算法对问题进行求解,以得到精度更高的解.同时,为避免传统遗传算法过早收敛和陷入局部最优,结合自适应交叉变异概率和良种交叉算子对算法进行改进.最后,通过实验计算结果,验证了算法能在同等缓存容量下获得精度更高的解. 相似文献
10.
为有效解决船坞/船台完工分段堆场调度问题,给出了以缩短整船周转周期和提高场地资源利用率为优化目标的时空三维调度问题模型。在有效处理多维约束条件的基础上,设计了求解本问题模型的改进遗传算法,即以分段的吊装计划节点为基准约束,采用分层遗传算法进行优化,并通过不断自适应调整算法在运行时的交叉和变异概率来有效优化种群进化速度,从而改良了算法整体运算性能。通过算例的对比分析,验证了该改进算法的可行性和有效性。 相似文献
11.
Developing two multi-objective evolutionary algorithms for the multi-objective flexible job shop scheduling problem 总被引:1,自引:1,他引:0
Seyed Habib A. Rahmati M. Zandieh M. Yazdani 《The International Journal of Advanced Manufacturing Technology》2013,64(5-8):915-932
The aim of this paper is to study multi-objective flexible job shop scheduling problem (MOFJSP). Flexible job shop scheduling problem is a modified version of job shop scheduling problem (JSP) in which an operation is allowed to be processed by any machine from a given set of capable machines. The objectives that are considered in this study are makespan, critical machine work load, and total work load of machines. In the literature of the MOFJSP, since this problem is known as an NP-hard problem, most of the studies have developed metaheuristic algorithms to solve it. Most of them have integrated their objective functions and used an integrated single-objective metaheuristic algorithm though. In this study, two new version of multi-objective evolutionary algorithms including non-dominated sorting genetic algorithm and non-dominated ranking genetic algorithm are adapted for MOFJSP. These algorithms use new multi-objective Pareto-based modules instead of multi-criteria concepts to guide their process. Another contribution of this paper is introducing of famous metrics of the multi-objective evaluation to literature of the MOFJSP. A new measure is also proposed. Finally, through using numerous test problems, calculating a number of measures, performing different statistical tests, and plotting different types of figures, it is shown that proposed algorithms are at least as good as literature’s algorithm. 相似文献
12.
Yong Ming Wang Nan Feng Xiao Hong Li Yin En Liang Hu Cheng Gui Zhao Yan Rong Jiang 《The International Journal of Advanced Manufacturing Technology》2008,39(7-8):813-820
The majority of large size job shop scheduling problems are non-polynomial-hard (NP-hard). In the past few decades, genetic algorithms (GAs) have demonstrated considerable success in providing efficient solutions to many NP-hard optimization problems. But there is no literature available considering the optimal parameters when designing GAs. Unsuitable parameters may generate an inadequate solution for a specific scheduling problem. In this paper, we proposed a two-stage GA which attempts to firstly find the fittest control parameters, namely, number of population, probability of crossover, and probability of mutation, for a given job shop problem with a fraction of time using the optimal computing budget allocation method, and then the fittest parameters are used in the GA for a further searching operation to find the optimal solution. For large size problems, the two-stage GA can obtain optimal solutions effectively and efficiently. The method was validated based on some hard benchmark problems of job shop scheduling. 相似文献
13.
Jian Fang Yugeng Xi 《The International Journal of Advanced Manufacturing Technology》1997,13(3):227-232
In this paper, the job shop scheduling problem in a dynamic environment is studied. Jobs arrive continuously, machines breakdown, machines are repaired and due dates of jobs may change during processing. Inspired by the rolling horizon optimisation method from predictive control technology, a periodic and event-driven rolling horizon scheduling strategy is presented and adapted to continuous processing in a changing environment. The scheduling algorithm is a hybrid of genetic algorithms and dispatching rules for solving the job shop scheduling problem with sequence-dependent set-up time and due date constraints. Simulation results show that the proposed strategy is more suitable for a dynamic job shop environment than the static scheduling strategy. 相似文献
14.
以带有控制器的Petri网为建模工具对柔性生产调度中的离散事件建模,利用遗传算法和模拟退火算法获得调度结果,并通过Petri网进行控制.用于解决作业车间的加工受到机床、操作工人等生产资源制约条件下的优化调度.以生产周期为目标进行的优化调度,将遗传算法和模拟退火相结合.通过多种交叉、变异、概率更新选择、再分配策略等遗传和模拟操作,得到目标的最优或次优解.对算法进行了仿真研究,仿真结果表明该算法是有效性. 相似文献
15.
Chaoyong Zhang Yunqing Rao Peigen Li 《The International Journal of Advanced Manufacturing Technology》2008,39(9-10):965-974
From the computational point of view, the job shop scheduling problem (JSP) is one of the most notoriously intractable NP-hard optimization problems. This paper applies an effective hybrid genetic algorithm for the JSP. We proposed three novel features for this algorithm to solve the JSP. Firstly, a new full active schedule (FAS) procedure based on the operation-based representation is presented to construct a schedule. After a schedule is obtained, a local search heuristic is applied to improve the solution. Secondly, a new crossover operator, called the precedence operation crossover (POX), is proposed for the operation-based representation, which can preserve the meaningful characteristics of the previous generation. Thirdly, in order to reduce the disruptive effects of genetic operators, the approach of an improved generation alteration model is introduced. The proposed approaches are tested on some standard instances and compared with other approaches. The superior results validate the effectiveness of the proposed algorithm. 相似文献
16.
基于免疫遗传算法的车间调度问题的研究 总被引:1,自引:0,他引:1
根据生命科学中免疫系统的信息处理机制,在一般遗传算法的基础上,将免疫计算和改进的遗传算法(预防近亲结合的多重交叉策略)相结合,建立了一种用于车间调度的免疫遗传算法,通过接种疫苗提高抗体的适应度,通过免疫选择防止种群的退化。针对作业车间调度问题,设计了免疫遗传计算中疫苗的提取和接种方法,即基于加工机器的基因片断抽取疫苗方法和接种方法。通过作业车间调度十个典型标准问题验证,文中所述免疫遗传算法可行,较现有免疫算法、一般遗传算法及一些传统优化设计方法在收敛效率和准确性等方面有很大改进与提高。 相似文献
17.
在传统柔性作业车间调度问题(FJSP)中加入运输和装配环节,提出一种柔性作业车间多资源调度问题(MRFJSP),以完工时间最短为目标建立了包含加工、运输和装配的柔性作业车间调度模型。为了提高传统遗传算法(GA)在车间调度问题中的寻优能力,将粒子群算法(PSO)的寻优过程进行改进并与遗传算法进行结合,提出一种带保优策略的遗传-粒子群混合算法,利用单层编码对模型进行求解。通过算例验证了模型的可行性,并将提出的混合算法与遗传算法和粒子群算法进行比较,证明了混合算法的优越性。 相似文献
18.
S.G. Ponnambalam N. Jawahar B. Kumar 《The International Journal of Advanced Manufacturing Technology》2002,19(3):224-234
Genetic algorithms (GA) have demonstrated considerable success in providing good solutions to many non-polynomial hard optimization
problems. GAs are applied for identifying efficient solutions for a set of numerical optimization problems. Job shop scheduling
(JSS) has earned a reputation for being difficult to solve. Many workers have used various values of genetic parameters. This
paper attempts to tune the control parameters for efficiency, that are used to acceleate the genetic algorithm (applied to
JSS) to converge on an optimal solution. The genetic parameters, namely, number of generations, probability of crossover,
probability of mutation, are optimized relating to the size of problems. The results are validated in job shop scheduling
problems. The results indicate that by using an appropriate range of parameters, the genetic algorithm is able to find an
optimal solution faster.
RID="
ID=" <E5>Correspondence and offprint requests to</E5>: Dr S. G. Ponnambalam, Department of Production Engineering, Regional
Engineering College, Tiruchirapalli, 620 015, India. E-mail: pons@rect.ernet.in 相似文献
19.
20.
Rong-Hwa Huang Chang-Lin Yang 《The International Journal of Advanced Manufacturing Technology》2008,39(1-2):151-157
Scheduling for a job shop production system is an integral aspect of production management. Scheduling operations must minimize stock, waste, and idle time and ensure on-time delivery of goods in a time window problem. In this study, due date is considered as an interval instead of a time point. This study addresses scheduling with a time window of job shop scheduling problem (JSP) and yields a solution that is close to the time window. The total penalty due to earliness and tardiness is minimized. As the problem is NP-hard, a mathematical model of the JSP with a time window is initially constructed, and data are then simulated. Solutions are obtained by ant colony optimization (ACO) programs written in C-language and are compared with the best solution obtained using LINGO 7.0 to determine the efficiency and robustness. Test results indicate that ACO is extremely efficient. Solution time using ACO is less than that using LINGO. Hence, ACO is both effective and efficient, which are two qualities stressed in business management. 相似文献