An improved evolutionary algorithm to sequence operations on an ASRS warehouse

This paper describes the hybridization of an evolutionary algorithm with a greedy algorithm to solve a job-shop problem with recirculation. We model a real problem that arises within the domain of loads’ dispatch inside an automatic warehouse. The evolutionary algorithm is based on random key representation. It is very easy to implement and allows the use of conventional genetic operators for combinatorial optimization problems. A greedy algorithm is used to generate active schedules. This constructive algorithm reads the chromosome and decides which operation is scheduled next. This option increases the efficiency of the evolutionary algorithm. The algorithm was tested using some instances of the real problem and computational results are presented.

[1]  J.L. Romeral,et al.  A genetic algorithm approach to optimization of power peaks in an automated warehouse , 2009, 2009 35th Annual Conference of IEEE Industrial Electronics.

[2]  Stephen C. Graves,et al.  Optimal Storage Assignment in Automatic Warehousing Systems , 1976 .

[3]  Luís M. S. Dias,et al.  Solving the Job Shop Problem with a random keys genetic algorithm with instance parameters , 2010 .

[4]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[5]  Mahmudur Rahman,et al.  New Automated Storage and Retrieval System (ASRS) using wireless communications , 2011, 2011 4th International Conference on Mechatronics (ICOM).

[6]  Sanjay Misra,et al.  Computational Science and Its Applications – ICCSA 2012 , 2012, Lecture Notes in Computer Science.

[7]  José António Oliveira.  A Genetic Algorithm with a Quasi-local Search for the Job Shop Problem with Recirculation , 2004, WSC.

[8]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[9]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[10]  King Lun Choy,et al.  Effective selection and allocation of material handling equipment for stochastic production material demand problems using genetic algorithm , 2011, Expert Syst. Appl..

[11]  Luís M. S. Dias,et al.  A Genetic Algorithm for the Job Shop on an ASRS Warehouse , 2012, ICCSA.

[12]  Hyung Rim Choi,et al.  A hybrid genetic algorithm for the job shop scheduling problems , 2003, Comput. Ind. Eng..

[13]  Ashutosh Tiwari,et al.  A review of soft computing applications in supply chain management , 2010, Appl. Soft Comput..

[14]  Peigen Li,et al.  A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem , 2007, Comput. Oper. Res..

[15]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[16]  José António Oliveira.  Scheduling the truckload operations in automatic warehouses , 2007, Eur. J. Oper. Res..

[17]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

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

[19]  J. C. Bean.  Genetics and random keys for sequencing amd optimization , 1993 .