Scheduling by Genetic Local Search with Multi-Step Crossover

In this paper, multi-step crossover (MSX) and a local search method are unified as a single operator called MSXF. MSX and MSXF utilize a neighborhood structure and a distance measure in the search space. In MSXF, a solution, initially set to be one of the parents, is stochastically replaced by a relatively good solution in the neighborhood, where the replacement is biased toward the other parent. After a certain number of iterations of this process, the best solution from those generated is selected as an offspring. Using job-shop scheduling problem benchmarks, MSXF was evaluated in a GA framework as a high-level crossover working on the critical path of a schedule. Experiments showed promising performance for the proposed method.

[1]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[2]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[3]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[4]  Takeshi Yamada,et al.  Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.

[5]  Takeshi Yamada,et al.  A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.

[6]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[7]  Takeshi Yamada,et al.  The ECOlogical Framework II : Improving GA Performance At Virtually Zero Cost , 1993, ICGA.

[8]  Peter Ross,et al.  A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems , 1993, ICGA.

[9]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[10]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[11]  Colin R. Reeves,et al.  Genetic Algorithms and Neighbourhood Search , 1994, Evolutionary Computing, AISB Workshop.

[12]  Christian Bierwirth,et al.  Control of Parallel Population Dynamics by Social-Like Behavior of GA-Individuals , 1994, PPSN.

[13]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[14]  Bruce E. Rosen,et al.  A simulated annealing approach to job shop scheduling using critical block transition operators , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).

[15]  Takeshi Yamada,et al.  A genetic algorithm with multi-step crossover for job-shop scheduling problems , 1995 .

[16]  Takeshi Yamada,et al.  Job-Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search , 1996 .

[17]  J. P. Kelly,et al.  Meta-heuristics : theory & applications , 1996 .

[18]  Emile H. L. Aarts,et al.  Genetic local search for the traveling salesman problem , 1998 .