An Improved Evolutionary Algorithm to Sequence Operations on an ASRS Warehouse

  • José A. Oliveira
  • João Ferreira
  • Guilherme A. B. Pereira
  • Luis S. Dias
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 223)


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.


Evolutionary algorithms Job shop scheduling ASRS warehouse 



This work was funded by the “Programa Operacional Fatores de Competitividade—COMPETE” and by the FCT—Fundação para a Ciência e Tecnologia in the scope of the project: FCOMP-01-0124-FEDER-022674.


  1. 1.
    Rashid, M.M., Kasemi, B., Rahman, M.: New Automated Storage and Retrieval System (ASRS) using wireless communications. In: 2011 4th International Conference on Mechatronics: Integrated Engineering for Industrial and Societal, Development, ICOM’11 (2011)Google Scholar
  2. 2.
    Crdenas, J.J., Garcia, A., Romeral, J.L., Andrade, F.: A genetic algorithm approach to optimization of power peaks in an automated warehouse. In: Proceedings of Industrial Electronics Conference (IECON), pp. 3297–3302 (2009)Google Scholar
  3. 3.
    Hausman, W.H., Schwarz, L.B., Graves, S.C.: Optimal storage assignment in automatic warehousing systems. Manage. Sci. 22, 629–638 (1976)CrossRefzbMATHGoogle Scholar
  4. 4.
    Oliveira, J.A.: A genetic algorithm with a quasi-local search for the job shop problem with recirculation. In: Abraham, A., de Barts, B., Köppen, M., Nickolay, B. (eds.) Applied Soft Computing Technologies: The Challenge of Complexity, pp. 221–234. Springer, Heidelberg (2006)Google Scholar
  5. 5.
    Oliveira, J.A.: Scheduling the truckload operations in automatic warehouses. Eur. J. Oper. Res. 179, 723–735 (2007)CrossRefzbMATHGoogle Scholar
  6. 6.
    Ko, M., Tiwari, A., Mehnen, J.: A review of soft computing applications in supply chain management. Appl. Soft Comput. 10, 661–674 (2010)CrossRefGoogle Scholar
  7. 7.
    Poon, T.C., Choy, K.L., Cheng, C.K., Lao, S.I., Lam, H.Y.: Effective selection and allocation of material handling equipment for stochastic production material demand problems using genetic algorithm. Expert Syst. Appl. 38, 12497–12505 (2011)CrossRefGoogle Scholar
  8. 8.
    Figueiredo, J., Oliveira, J.A., Dias, L., Pereira, G.: A genetic algorithm for the job shop on an ASRS warehouse. Computational science and its applications ICCSA 2012. Lect. Notes Comput. Sci. 7335, 133–146 (2012)CrossRefGoogle Scholar
  9. 9.
    Zhang, C., Li, P., Guan, Z., Rao, Y.: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput. Oper. Res. 53, 313–320 (2007)MathSciNetGoogle Scholar
  10. 10.
    Cheng, R., Gen, M., Tsujimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms—I. representation. Comput. Ind. Eng. 30, 983–997 (1996)CrossRefGoogle Scholar
  11. 11.
    Park, B.J., Choi, H.R., Kim, H.S.: A hybrid genetic algorithm for the job shop scheduling problems. Comput. Ind. Eng. 45, 597–613 (2003)CrossRefGoogle Scholar
  12. 12.
    Oliveira, J.A., Dias, L., Pereira, G.: Solving the job shop problem with a random keys genetic algorithm with instance parameters. In: Proceedings of 2nd International Conference on Engineering Optimization (EngOpt 2010), Lisbon, Portugal, (CDRom) (2010)Google Scholar
  13. 13.
    Vaessens, R., Aarts, E., Lenstra, J.K.: Job shop scheduling by local search. INFORMS J. Comput. 8, 302–317 (1996)CrossRefzbMATHGoogle Scholar
  14. 14.
    Bean, J.C.: Genetics and random keys for sequencing and optimization. ORSA J. Comput. 6, 154–160 (1994)CrossRefzbMATHGoogle Scholar
  15. 15.
    Giffler, B., Thompson, G.L.: Algorithms for solving production scheduling problems. Oper. Res. 8, 487–503 (1960)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • José A. Oliveira
    • 1
  • João Ferreira
    • 1
  • Guilherme A. B. Pereira
    • 1
  • Luis S. Dias
    • 1
  1. 1.Centre ALGORITMIUniversity of MinhoGuimarãesPortugal

Personalised recommendations