共查询到20条相似文献,搜索用时 15 毫秒
1.
This paper considers the job-shop problem with release dates and due dates, with the objective of minimizing the total weighted tardiness. A genetic algorithm is combined with an iterated local search that uses a longest path approach on a disjunctive graph model. A design of experiments approach is employed to calibrate the parameters and operators of the algorithm. Previous studies on genetic algorithms for the job-shop problem point out that these algorithms are highly depended on the way the chromosomes are decoded. In this paper, we show that the efficiency of genetic algorithms does no longer depend on the schedule builder when an iterated local search is used. Computational experiments carried out on instances of the literature show the efficiency of the proposed algorithm. 相似文献
2.
Problem difficulty for tabu search in job-shop scheduling 总被引:2,自引:0,他引:2
Jean-Paul Watson J.Christopher Beck Adele E. Howe L.Darrell Whitley 《Artificial Intelligence》2003,143(2):189-217
Tabu search algorithms are among the most effective approaches for solving the job-shop scheduling problem (JSP). Yet, we have little understanding of why these algorithms work so well, and under what conditions. We develop a model of problem difficulty for tabu search in the JSP, borrowing from similar models developed for SAT and other NP-complete problems. We show that the mean distance between random local optima and the nearest optimal solution is highly correlated with the cost of locating optimal solutions to typical, random JSPs. Additionally, this model accounts for the cost of locating sub-optimal solutions, and provides an explanation for differences in the relative difficulty of square versus rectangular JSPs. We also identify two important limitations of our model. First, model accuracy is inversely correlated with problem difficulty, and is exceptionally poor for rare, very high-cost problem instances. Second, the model is significantly less accurate for structured, non-random JSPs. Our results are also likely to be useful in future research on difficulty models of local search in SAT, as local search cost in both SAT and the JSP is largely dictated by the same search space features. Similarly, our research represents the first attempt to quantitatively model the cost of tabu search for any NP-complete problem, and may possibly be leveraged in an effort to understand tabu search in problems other than job-shop scheduling. 相似文献
3.
We introduce a heuristic that is based on a unique genetic algorithm (GA) to solve the resource-sharing and scheduling problem (RSSP). This problem was previously formulated as a continuous-time mixed integer linear programming model and was solved optimally using a branch-and-bound (B&B) algorithm. The RSSP considers the use of a set of resources for the production of several products. Producing each product requires a set of operations with precedence relationships among them. Each operation can be performed using alternative modes which define the subset of the resources needed, and an operation may share different resources simultaneously. The problem is to select a single mode for each operation and accordingly to schedule the resources, while minimizing the makespan time. The GA we propose is based on a new encoding schema that adopts the structure of a DNA in nature. In our experiments we compared the effectiveness and runtime of our GA versus a B&B algorithm and two truncated B&B algorithms that we developed on a set of 118 problem instances. The results demonstrate that the GA solved all the problems (10 runs each), and reaches optimality in 75% of the runs, had an average deviation of less than 1% from the optimal makespan, and a runtime that was much less sensitive to the size of the problem instance. 相似文献
4.
Pasquale Carotenuto Stefano Giordani Salvatore Ricciardelli Silvia Rismondo 《Computers & Operations Research》2007
Vehicle routing and scheduling are two main issues in the hazardous material (hazmat) transportation problem. In this paper, we study the problem of managing a set of hazmat transportation requests in terms of hazmat shipment route selection and actual departure time definition. For each hazmat shipment, a set of minimum and equitable risk alternative routes from origin to destination points and a preferred departure time are given. The aim is to assign a route to each hazmat shipment and schedule these shipments on the assigned routes in order to minimize the total shipment delay, while equitably spreading the risk spatially and preventing the risk induced by vehicles traveling too close to each other. We model this hazmat shipment scheduling problem as a job-shop scheduling problem with alternative routes. No-wait constraints arise in the scheduling model as well, since, supposing that no safe area is available, when a hazmat vehicle starts traveling from the given origin it cannot stop until it arrives at the given destination. A tabu search algorithm is proposed for the problem, which is experimentally evaluated on a set of realistic test problems over a regional area, evaluating the provided solutions also with respect to the total route risk and length. 相似文献
5.
For many combinatorial problems the solution landscape is such that near-optimal solutions share common characteristics: the so-called commonalities or building blocks. We propose a method to identify and exploit these commonalities, which is based on applying multistart local search. In the first phase, we apply the local search heuristic, which is based on simulated annealing, to perform a set of independent runs. We discard the solutions of poor quality and compare the remaining ones to identify commonalities. In the second phase, we apply another series of independent runs in which we exploit the commonalities. We have tested this generic methodology on the so-called job-shop scheduling problem, on which many local search methods have been tested. In our computational study we found that the inclusion of commonalities in simulated annealing improves the solution quality considerably even though we found evidence that the job-shop scheduling problem is not very well suited to the use of these commonalities. Since the use of commonalities is easy to implement, it may be very useful as a standard addition to local search techniques in a general sense. 相似文献
6.
针对车间调度中计算复杂度问题,提出将神经网络嵌入遗传算法中,在初始化序列时考虑到工件中工序的加工顺序,采用基于保序的方法来对染色体进行交叉和变异。实验仿真表明,该算法能够获得比较理想的加工序列,在指定的代数内能够收敛于优值。 相似文献
7.
Javad Rezaeian Zeidi Nikbakhsh Javadian Reza Tavakkoli-Moghaddam Fariborz Jolai 《Computers & Industrial Engineering》2013
One important issue related to the implementation of cellular manufacturing systems (CMSs) is to decide whether to convert an existing job shop into a CMS comprehensively in a single run, or in stages incrementally by forming cells one after the other, taking the advantage of the experiences of implementation. This paper presents a new multi-objective nonlinear programming model in a dynamic environment. Furthermore, a novel hybrid multi-objective approach based on the genetic algorithm and artificial neural network is proposed to solve the presented model. From the computational analyses, the proposed algorithm is found much more efficient than the fast non-dominated sorting genetic algorithm (NSGA-II) in generating Pareto optimal fronts. 相似文献
8.
Ren Qing-dao-er-ji 《Computers & Operations Research》2012,39(10):2291-2299
Job shop scheduling problem is a typical NP-hard problem. To solve the job shop scheduling problem more effectively, some genetic operators were designed in this paper. In order to increase the diversity of the population, a mixed selection operator based on the fitness value and the concentration value was given. To make full use of the characteristics of the problem itself, new crossover operator based on the machine and mutation operator based on the critical path were specifically designed. To find the critical path, a new algorithm to find the critical path from schedule was presented. Furthermore, a local search operator was designed, which can improve the local search ability of GA greatly. Based on all these, a hybrid genetic algorithm was proposed and its convergence was proved. The computer simulations were made on a set of benchmark problems and the results demonstrated the effectiveness of the proposed algorithm. 相似文献
9.
10.
This paper describes the application of an artificial immune system to a scheduling application. A novel approach multi-modal immune algorithm is proposed for finding optimal solutions to job-shop scheduling problems emulating the features of a biological immune system. Inter-relationships within the proposed algorithm resemble antibody molecule structure, antibody-antigen relationships in terms of specificity, clonal proliferation, germinal center, and the memory characteristics of adaptive immune responses. Gene fragment recombination and several antibody diversification schemes including somatic recombination, somatic mutation, gene conversion, gene reversion, gene drift, and nucleotide addition were incorporated into the algorithm in order to improve the balance between exploitation and exploration. In addition, niche antibody was employed to discover multi-modal solutions. Numerous well-studied benchmark examples in job-shop scheduling problems were utilized to evaluate the proposed approach. The results indicate the effectiveness and flexibility of the immune algorithm. 相似文献
11.
This research investigates a two-stage hybrid flowshop scheduling problem in a metal-working company. The first stage consists of multiple parallel machines and the second stage has only one machine. Four characteristics of the company have substantiated the complexity of the problem. First, all machines in stage one are able to process multiple jobs simultaneously but the jobs must be sequentially set up one after another. Second, the setup time of each job is separated from its processing time and depends upon its preceding job. Third, a blocking environment exists between two stages with no intermediate buffer storage. Finally, machines are not continuously available due to the preventive maintenance and machine breakdown. Two types of machine unavailability, namely, deterministic case and stochastic case, are identified in this problem. The former occurs on stage-two machine with the start time and the end time known in advance. The latter occurs on one of the parallel machine in stage one and a real-time rescheduling will be triggered. Minimizing the makespan is considered as the objective to develop the optimal scheduling algorithm. A genetic algorithm is used to obtain a near-optimal solution. The computational results with actual data are favorable and superior over the results from existing manual schedules. 相似文献
12.
A hybrid genetic algorithm for the job shop scheduling problems 总被引:19,自引:0,他引:19
The Job Shop Scheduling Problem (JSSP) is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on genetic algorithm to address JSSP. We design a scheduling method based on Single Genetic Algorithm (SGA) and Parallel Genetic Algorithm (PGA). In the scheduling method, the representation, which encodes the job number, is made to be always feasible, the initial population is generated through integrating representation and G&T algorithm, the new genetic operators and selection method are designed to better transmit the temporal relationships in the chromosome, and island model PGA are proposed. The scheduling methods based on genetic algorithm are tested on five standard benchmark JSSP. The results are compared with other proposed approaches. Compared to traditional genetic algorithm, the proposed approach yields significant improvement in solution quality. The superior results indicate the successful incorporation of a method to generate initial population into the genetic operators. 相似文献
13.
In obstacle avoidance by a legged mobile robot, it is not necessary to avoid all of the obstacles by turning only, because
it can climb or stride over some of them, depending on the obstacle configuration and the state of the robot, unlike a wheel-type
or a crawler-type robot. It is thought that mobility efficiency to a destination is improved by crawling over or striding
over obstacles. Moreover, if robots have many legs, like 4-legged or 6-legged types, then the robot's movement range is affected
by the order of the swing leg. In this article a neural network (NN) is used to determine the action of a quadruped robot
in an obstacle-avoiding situation by using information about the destination, the obstacle configuration, and the robot's
self-state. To acquire a free gait in static walking, the order of the swing leg is realized using an alternative NN whose
inputs are the amount of movement and the robot's self-state. The design parameters of the former NN are adjusted by a genetic
algorithm (GA) off-line.
This work was presented in part at the 9th International Symposium on Artificial Life and Robotics, Oita, Japan, January 28–30,
2004 相似文献
14.
Traditionally, process planning and scheduling for parts were carried out in a sequential way, where scheduling was done after process plans had been generated. Considering the fact that the two functions are usually complementary, it is necessary to integrate them more tightly so that performance of a manufacturing system can be improved greatly. In this paper, a new integration model and a modified genetic algorithm-based approach have been developed to facilitate the integration and optimization of the two functions. In the model, process planning and scheduling functions are carried out simultaneously. In order to improve the optimized performance of the modified genetic algorithm-based approach, more efficient genetic representations and operator schemes have been developed. Experimental studies have been conducted and the comparisons have been made between this approach and others to indicate the superiority and adaptability of this method. The experimental results show that the proposed approach is a promising and very effective method for the integration of process planning and scheduling. 相似文献
15.
An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems 总被引:1,自引:0,他引:1
This paper proposes an effective hybrid tabu search algorithm (HTSA) to solve the flexible job-shop scheduling problem. Three minimization objectives – the maximum completion time (makespan), the total workload of machines and the workload of the critical machine are considered simultaneously. In this study, a tabu search (TS) algorithm with an effective neighborhood structure combining two adaptive rules is developed, which constructs improved local search in the machine assignment module. Then, a well-designed left-shift decoding function is defined to transform a solution to an active schedule. In addition, a variable neighborhood search (VNS) algorithm integrating three insert and swap neighborhood structures based on public critical block theory is presented to perform local search in the operation scheduling component. The proposed HTSA is tested on sets of the well-known benchmark instances. The statistical analysis of performance comparisons shows that the proposed HTSA is superior to four existing algorithms including the AL + CGA algorithm by Kacem, Hammadi, and Borne (2002b), the PSO + SA algorithm by Xia and Wu (2005), the PSO + TS algorithm by Zhang, Shao, Li, and Gao (2009), and the Xing’s algorithm by Xing, Chen, and Yang (2009a) in terms of both solution quality and efficiency. 相似文献
16.
In this paper, we designed novel methods for Neural Network (NN) and Radial Basis function Neural Networks (RBFNN) training using Shuffled Frog-Leaping Algorithm (SFLA). This paper basically deals with the problem of multi-processor scheduling in a grid environment. We, in this paper, introduce three novel approaches for the task scheduling problem using a recently proposed Shuffled Frog-Leaping Algorithm (SFLA). In a first attempt, the scheduling problem is structured as a problem of optimization and solved by SFLA. Next, this paper makes use of SFLA trained Artificial Neural Network (ANN) and Radial Basis function Neural Networks (RBFNN) for the problem of task scheduling. Interestingly, the proposed methods yield better performance than contemporary algorithms as evidenced by simulation results. 相似文献
17.
A genetic algorithm-based artificial neural network model for the optimization of machining processes 总被引:3,自引:2,他引:3
Artificial intelligent tools like genetic algorithm, artificial neural network (ANN) and fuzzy logic are found to be extremely
useful in modeling reliable processes in the field of computer integrated manufacturing (for example, selecting optimal parameters
during process planning, design and implementing the adaptive control systems). When knowledge about the relationship among
the various parameters of manufacturing are found to be lacking, ANNs are used as process models, because they can handle
strong nonlinearities, a large number of parameters and missing information. When the dependencies between parameters become
noninvertible, the input and output configurations used in ANN strongly influence the accuracy. However, running of a neural
network is found to be time consuming. If genetic algorithm-based ANNs are used to construct models, it can provide more accurate
results in less time. This article proposes a genetic algorithm-based ANN model for the turning process in manufacturing Industry.
This model is found to be a time-saving model that satisfies all the accuracy requirements. 相似文献
18.
Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method 总被引:2,自引:0,他引:2
This paper proposes an ant colony optimisation-based software system for solving FMS scheduling in a job-shop environment with routing flexibility, sequence-dependent setup and transportation time. In particular, the optimisation problem for a real environment, including parallel machines and operation lag times, has been approached by means of an effective pheromone trail coding and tailored ant colony operators for improving solution quality. The method used to tune the system parameters is also described. The algorithm has been tested by using standard benchmarks and problems, properly designed for a typical FMS layout. The effectiveness of the proposed system has been verified in comparison with alternative approaches. 相似文献
19.
An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem 总被引:7,自引:0,他引:7
Guohui Zhang Xinyu Shao Peigen Li Liang Gao 《Computers & Industrial Engineering》2009,56(4):1309-1318
Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. Although the traditional optimization algorithms could obtain preferable results in solving the mono-objective FJSP. However, they are very difficult to solve multi-objective FJSP very well. In this paper, a particle swarm optimization (PSO) algorithm and a tabu search (TS) algorithm are combined to solve the multi-objective FJSP with several conflicting and incommensurable objectives. PSO which integrates local search and global search scheme possesses high search efficiency. And, TS is a meta-heuristic which is designed for finding a near optimal solution of combinatorial optimization problems. Through reasonably hybridizing the two optimization algorithms, an effective hybrid approach for the multi-objective FJSP has been proposed. The computational results have proved that the proposed hybrid algorithm is an efficient and effective approach to solve the multi-objective FJSP, especially for the problems on a large scale. 相似文献
20.
Md. Monirul KabirAuthor Vitae 《Neurocomputing》2011,74(17):2914-2928
This paper presents a new hybrid genetic algorithm (HGA) for feature selection (FS), called as HGAFS. The vital aspect of this algorithm is the selection of salient feature subset within a reduced size. HGAFS incorporates a new local search operation that is devised and embedded in HGA to fine-tune the search in FS process. The local search technique works on basis of the distinct and informative nature of input features that is computed by their correlation information. The aim is to guide the search process so that the newly generated offsprings can be adjusted by the less correlated (distinct) features consisting of general and special characteristics of a given dataset. Thus, the proposed HGAFS receives the reduced redundancy of information among the selected features. On the other hand, HGAFS emphasizes on selecting a subset of salient features with reduced number using a subset size determination scheme. We have tested our HGAFS on 11 real-world classification datasets having dimensions varying from 8 to 7129. The performances of HGAFS have been compared with the results of other existing ten well-known FS algorithms. It is found that, HGAFS produces consistently better performances on selecting the subsets of salient features with resulting better classification accuracies. 相似文献