共查询到20条相似文献,搜索用时 0 毫秒
1.
求解作业车间调度问题的一种改进遗传算法 总被引:19,自引:3,他引:19
为克服传统遗传算法解决车间作业调度问题的局限性,综合遗传算法和局部搜索的优点,提出一种改进的遗传算法。为基于工序的编码提出了一种新的POX交叉算子。同时,为克服传统遗传算法在求解车间作业调度问题时的早熟收敛,设计了一种子代交替模式的交叉方式,并运用局部搜索改善交叉和变异后得到的调度解,将提出的改进遗传算法应用于MuthandThompson基准问题的实验运行,显示了该算法的有效性。 相似文献
2.
3.
Miguel A. Salido Joan Escamilla Adriana Giret Federico Barber 《The International Journal of Advanced Manufacturing Technology》2016,84(5-8):1303-1312
Many real-world scheduling problems are solved to obtain optimal solutions in term of processing time, cost, and quality as optimization objectives. Currently, energy-efficiency is also taken into consideration in these problems. However, this problem is NP-hard, so many search techniques are not able to obtain a solution in a reasonable time. In this paper, a genetic algorithm is developed to solve an extended version of the Job-shop Scheduling Problem in which machines can consume different amounts of energy to process tasks at different rates (speed scaling). This problem represents an extension of the classical job-shop scheduling problem, where each operation has to be executed by one machine and this machine can work at different speeds. The evaluation section shows that a powerful commercial tool for solving scheduling problems was not able to solve large instances in a reasonable time, meanwhile our genetic algorithm was able to solve all instances with a good solution quality. 相似文献
4.
Tung-Kuan Liu Jinn-Tsong Tsai Jyh-Horng Chou 《The International Journal of Advanced Manufacturing Technology》2006,27(9-10):1021-1029
In this paper, an improved genetic algorithm, called the hybrid Taguchi-genetic algorithm (HTGA), is proposed to solve the job-shop scheduling problem (JSP). The HTGA approach is a method of combining the traditional genetic algorithm (TGA), which has a powerful global exploration capability, with the Taguchi method, which can exploit the optimal offspring. The Taguchi method is inserted between crossover and mutation operations of a TGA. Then, the systematic reasoning ability of the Taguchi method is incorporated in the crossover operations to systematically select the better genes to achieve crossover, and consequently enhance the genetic algorithm. Therefore, the proposed HTGA approach possesses the merits of global exploration and robustness. The proposed HTGA approach is effectively applied to solve the famous Fisher-Thompson benchmarks of 10 jobs to 10 machines and 20 jobs to 5 machines for the JSP. In these studied problems, there are numerous local optima so that these studied problems are challenging enough for evaluating the performances of any proposed GA-based approaches. The computational experiments show that the proposed HTGA approach can obtain both better and more robust results than other GA-based methods reported recently. 相似文献
5.
设计了两种不同实现方式的粒子群算法解决车间作业调度问题,即基于粒子位置矢量更新的实现方式和基于遗传操作的实现方式.同时选择一些典型的Job-Shop调度问题作为算法的试验对象,试验结果表明上述两种不同实现方式的粒子群算法在求解小规模调度问题时都能得到较好的结果,在求解较大规模调度问题时基于遗传操作的粒子群算法可以得到更好的结果.这一方面说明了上述两种不同实现方式的粒子群算法在求解调度问题上的有效性,同时也表明基于遗传操作的粒子群算法在求解较大规模调度问题上具有更大的优势. 相似文献
6.
禁忌-并行遗传算法在作业车间调度中的应用 总被引:5,自引:0,他引:5
根据并行遗传算法与禁忌搜索算法的优点,提出了一种禁忌一并行遗传算法。该算法能够避免早熟,不仅保证了算法的全局收敛,而且提高了算法收敛速度和解的质量,特别是在求解大规模问题上具有优势。仿真结果证明了该算法的有效性。 相似文献
7.
薛玲玲 《计算机集成制造系统》2021,27(10):2848-2857
针对以最小化最大完工时间为优化目标的作业车间调度问题,提出一种基于块结构邻域搜索的遗传算法.采用基于工序的编码方法进行个体编码,并在编码后的个体上进行邻域构建.首先,将关键工序块的块首或块尾工序与块内某个工序组合,然后对该组合进行交换、移动操作构建出邻域个体.其次,提出了个体的冗余性判断条件,对邻域中调度方案相同的个体只保留其中一个,达到减少冗余个体的目的.另外,为改善整个种群基因的有效性和延迟算法的早熟,采用具有子代选择特征的改进选择机制.最后,通过在典型算例上的仿真实验,验证了所提算法的有效性. 相似文献
8.
Qiong Liu Saif Ullah Chaoyong Zhang 《The International Journal of Advanced Manufacturing Technology》2011,56(1-4):345-354
In order to deal with uncertainties, a robust schedule for M-machine permutation flowshop is proposed. The presented robust schedule is aimed to maximize the probability of ensuring that makespan will not exceed the expected completion time. An improved genetic algorithm (GA) with a new generation scheme is developed, which can preserve good characteristics of parents in the new generation. Experiments are performed to get robust schedules for well-known Car and Rec permutation flowshop problems, taken from OR library. The schedules obtained from the improved GA are compared with the schedules formed by well-known heuristic in literature. Computational results show that the permutation flowshop schedules obtained from improved GA are robust to produce an affirmative percentage increase in the probability of getting makespan less than expected completion time. 相似文献
9.
Qiao Lihong Lv Shengping 《The International Journal of Advanced Manufacturing Technology》2012,58(5-8):727-740
Process planning and scheduling are two of the most important functions involved in manufacturing process and they are actually interrelated; integration of the two is essential to improve the flexibility of scheduling and achieve a global improvement for the performance of a manufacturing system. In order to facilitate the optimization of process planning and scheduling simultaneously, a mathematical model for the integrated process planning and scheduling (IPPS) is established, and an improved genetic algorithm (IGA) is proposed for the problem. For the performance improvement of the algorithm, new initial selection method for process plans, new genetic representations for the scheduling plan combined with process plans and genetic operator method are developed. To verify the feasibility and performance of the proposed approach, experimental studies are conducted and comparisons are made between this approach and others with the makespan and mean flow time performance measures. The results show that the proposed approach on IPPS has achieved significant improvement in minimizing makespan and obtained good results for the mean flow time performance measure with high efficiency. 相似文献
10.
车间生产调度问题(Job-shop scheduling problem,JSSP)属于NP完全问题,现在多使用现代优化算法来解决此类问题.本文将模拟退火算法、禁忌搜索算法的思想融入到遗传算法中,提出了模拟退火-交叉机制和禁忌搜索-变异机制,形成了一种适用于解决车间调度方面问题的新的混合遗传算法.三种算法取长补短,使得遗传算法局部搜索能力差和易早熟的缺点得以改善.同时运用这种混合遗传算法对经典车间调度问题进行了仿真. 相似文献
11.
12.
Xiao-dong Xu Cong-xin Li 《The International Journal of Advanced Manufacturing Technology》2007,31(7-8):783-789
Machine condition monitoring is important to factory efficiency and safety of workers. A variety of vibration signals analysis
techniques have long been used to diagnosis machine status. Based on the newest Internet and mobile communication technology
we developed a remote fault diagnostic system with many merits. This remote monitoring system takes XML as a core and uses
it to encode diagnostic data. The utilization of XML gives this system many advantages including minimum research work on
the client side, and simplicity to expand the system. This system publishes the diagnosis data not only by WEB, but also by
WAP. Then users can check the machine status including data, image and video, through the Internet and mobile terminals. The
automatic alarm part, which is developed based on Microsoft’s Smartphone 2003 operating system, can actively send alerting
messages to the engineers’ mobile phones and call these phones to make sure they get an alert when the machine’s status is
abnormal. 相似文献
13.
14.
15.
16.
17.
18.
19.
An effective artificial bee colony algorithm for the flexible job-shop scheduling problem 总被引:1,自引:1,他引:0
Ling Wang Gang Zhou Ye Xu Shengyao Wang Min Liu 《The International Journal of Advanced Manufacturing Technology》2012,60(1-4):303-315
An effective artificial bee colony (ABC) algorithm is proposed in this paper for solving the flexible job-shop scheduling problem with the criterion to minimize the maximum completion time (makespan). The ABC algorithm stresses the balance between global exploration and local exploitation. First, multiple strategies are utilized in a combination to generate the initial solutions with certain quality and diversity as the food sources. Second, crossover and mutation operators are well designed for machine assignment and operation sequence to generate the new neighbor food sources for the employed bees. Third, a local search strategy based on critical path is proposed and embedded in the searching framework to enhance the local intensification capability for the onlooker bees. Meanwhile, an updating mechanism of population by generating the scout bees with the initialing strategy is proposed to enrich the searching behavior and avoid the premature convergence of the algorithm. In addition, a well-designed left-shift decoding scheme is employed to transform a solution to an active schedule. Numerical simulation results based on well-known benchmarks and comparisons with some existing algorithms demonstrate the effectiveness of the proposed ABC algorithm. 相似文献