Skip to main content
SpringerLink
Log in

Multirecombined Evolutionary Algorithm Inspired in the Selfish Gene Theory to Face the Weighted Tardiness Scheduling Problem

  • Conference paper
Book cover Advances in Artificial Intelligence – IBERAMIA 2004 (IBERAMIA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3315))

Included in the following conference series:

Abstract

In a production system it is usual to stress minimum tardiness to achieve higher client satisfaction. According to the client relevance, job processing cost, and many other considerations a weight is assigned to each job. An important and non-trivial objective is to minimize weighted tardiness. Evolutionary Algorithms have been successfully applied to solve scheduling problems. MCMP-SRI (Multiple Crossover Multiple Parents – Stud Random Immigrants) is a MCMP variant which considers the inclusion of a studbreeding individual in a parent’s pool of random immigrants. The Selfish Gene Algorithm proposed by Corno et al. is an interpretation of Darwinian theory given by the biologist Richard Dawkins. In this work we are showing a new algorithm that combines the MCMP-SRI and Selfish Gene approaches. This algorithm is used to face the weighted tardiness problem in a single machine environment. The paper summarizes implementation details and discusses its performance for a set of problem instances taken from the OR-Library.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Burke, E.K., Coewling, P.I., Keuthen, R.: Effective Heuristic and Metaheuristic Approaches to Optimize Component Placement in Printed Circuit Board Assembly. In: CEC 2000, La Jolla, USA, July 2000, pp. 301–309 (2000)

    Google Scholar 

  2. Basseur, M., Seynhaede, F., ghazali, E.: Design of Multiobjective Evolutionary Algorithms: Application to the Flow-Shop Scheduling Problem. In: CEC 2002, Honolulu, Hawai, May 2002, pp. 1151–1156 (2002)

    Google Scholar 

  3. Chen, T., Gupta, M.: Survey of scheduling research involving due date determination decision. European Journal of Operational Research 38, 156–166 (1989)

    Article  MathSciNet  Google Scholar 

  4. Beasley, J.E.: Weighted Tardiness Scheduling, OR Library, http://mscmga.ms.ic.ac.uk/

  5. Cowling, P., Graham, K., Han, L.: An Investigation of Hyper heuristic Genetic Algorithm Applied to a Trainer Scheduling Problem. In: CEC 2002, Honolulu, Hawai, May 2002, pp. 1185–1190 (2002)

    Google Scholar 

  6. Crauwels, H.A.J., Potts, C.N., Van Wassenhove, L.N.: Local search heuristics for the single machine total weighted tardiness scheduling problem. Informs Journal on Computing 10, 341–350 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Corno, F., Sonza Reorda, M., Squillero, G.: The Selfish Gene Algorithm: a new Evolutionary Optimization Stategy. In: 13th Annual ACM Symposium Applied Computing, Atlanta, Georgia (USA), February 1998, pp. 349–355 (1998)

    Google Scholar 

  8. Corno, F., Sonza Reorda, M., Squillero, G.: A new Evolutionary Algorithm Inspired by the Selfish Gene Theory. In: ICEC1998: IEEE International Conference on Evolutionary Computation, May 1998, pp. 575–580 (1998)

    Google Scholar 

  9. Corno, F., Sonza Reorda, M., Squillero, G.: Exploiting the Selfish Gene Algorithm for Evolving Hardware Cellular Automata. In: CEC 2000: Congress on Evolutionary Computation, San Diego (USA), July 2000, pp. 1401–1406 (2000)

    Google Scholar 

  10. Corno, F., Sonza Reorda, M., Squillero, G.: Exploiting the Selfish Gene Algorithm for Evolving Hardware Cellular Automata. In: IJCNN 2000: IEEE-INNS-ENNS International Joint Conference Neural Networks, Como (Italy), July 2000, pp. 577–581 (2000)

    Google Scholar 

  11. Corno, F., Sonza Reorda, M., Squillero, G.: Evolving Effective CA/CSTP BIST Architectures for Sequential Circuits. In: SAC2001: ACM Symposium on Applied Computing, Las Vegas (USA), March 2001, pp. 345–350 (2001)

    Google Scholar 

  12. Richard, D.: The selfish gene. Oxford University Press, Oxford (1976)

    Google Scholar 

  13. Davis, L.: Applying adaptive algorithms to domains. In: proceedings of the international Joint Conference on Artificial Intelligence, pp. 162–164 (1985)

    Google Scholar 

  14. Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold Computer Library, New York (1991)

    Google Scholar 

  15. De San Pedro, M.E., Lasso, M., Villagra, A., Pandolfi, D., Gallard, R.: Solutions to the Dynamic Average Tardiness Problem in the Single machine Environments. In: CACIC 2003 IX Congreso Argentino de Ciencias de la Computación, La Plata, Argentina, octubre, 2003, pp. 1251–1258 (2003)

    Google Scholar 

  16. De San Pedro, M.E., Pandolfi, D., Villagra, A., Vilanova, G., Gallard, R.: Stud and immigrants in multirecombined evolutionary algorithm to face weighted tardiness scheduling problems. In: CACIC 2001 VII Congreso Argentino de Ciencias de la Computación, El Calafate, Argentina, octubre, 2001, pp. 1251–1258 (2001)

    Google Scholar 

  17. De San Pedro, M.E., Villagra, A., Lasso, M., Pandolfi, D., Diaz Vivar, M., Gallard, R.: CSITeA 2003 International Conference on Computer Science, Software Engineering Information Technology, E-Business and Applications, Rio de Janeiro, Brazil, pp. 438-443 (June 2003)

    Google Scholar 

  18. Eiben, A.E., Bäch, T.: An Empirical investigation of multi-parent recombination operators in evolution strategies. Evolutionary Computation 5(3), 347–365 (1997)

    Article  Google Scholar 

  19. Esquivel, S., Leiva, A., Gallard, R.: Multiple Crossovers per Couple in Genetic Algorithms. In: Proceedings of 4th IEEE Conference Evolutionary Computation, ICEC 1997, Indianapolis. USA, April 1997, pp. 103–106 (1997)

    Google Scholar 

  20. Esquivel, S., Leiva, A., Gallard, R.: Couple Fitness Based Selection with Multiple Crossover per Couple in Genetic Algorithms. In: Proceedings of the International Symposium of Engineering of Intelligent Systems (EIS 1998), La Laguna, Tenerife, Spain, vol. 1, pp. 235–241 (1998)

    Google Scholar 

  21. Esquivel, S., Leiva, A., Gallard, R.: Multiple Crossover between Multiple Parents to improve search in Evolutionary Algorithms. In: Proceedings of Congress on Evolutionary Computation, CEC, Washington DC, USA, pp. 1589–1594 (1999)

    Google Scholar 

  22. Eiben, A.E., Raué, P.-E., Ruttkay, Z.: Genetic algorithms with multi-parent recombination. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 78–87. Springer, Heidelberg (1994)

    Google Scholar 

  23. Eiben, A.E., van Kemenade, C.H.M., Kok, J.N.: Orgy in the computer: Multi-parent reproduction in genetic algorithms. In: Morán, F., Merelo, J.J., Moreno, A., Chacon, P. (eds.) ECAL 1995. LNCS (LNAI), vol. 929, pp. 934–945. Springer, Heidelberg (1995)

    Google Scholar 

  24. Goldberg, D., Lingle, R.: Alleles, loci and the traveling salesman problem. In: Proceeding of the First International Conference on Genetic Algorithm, pp. 154–159. Lawrence Eribaum Associates, Hillsdale (1987)

    Google Scholar 

  25. Lasso, M., Pandolfi, D., De San Pedro, M.E., Villagra, A., Gallard, R.: Heuristics to Solve Dynamic W-T problems in Single Machine Environments. In: CSITeA03 International Conference on Computer Science, Software Engineering Information Technology, EBusiness and Applications, Rio de Janeiro,, Brazil, June 2003, pp. 432–437 (2003)

    Google Scholar 

  26. Michalewicz, M.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd third revised edition. Springer, Heidelberg (1996)

    MATH  Google Scholar 

  27. Morton, T., Pentico, D.: Heuristic scheduling systems. Wiley series in Engineering and technology management. John Wiley and Sons INC, Chichester (1993)

    Google Scholar 

  28. Madureira, A., Ramos, C., do Carmo Silva, S.: A Coordination Mechanism for Real World Scheduling Problems Using Genetic Algorithms. In: CEC 2002, Honolulu, Hawai, May 2002, pp. 175–180 (2002)

    Google Scholar 

  29. Oliver, I., Smith, D., Holland, J.: A study of permutation crossover operators on the traveling salesman problem. European Journal of Operational Research, 224–230 (1986)

    Google Scholar 

  30. Pandolfi, D., Lasso, M., De San Pedro, M.E., Villagra, A., Gallard, R.: Evolutionary Algorithms to solve average tardiness problems in the single machine environments. In: CSITeA 2003 International Conference on Computer Science, Software Engineering Information Technology, E-Business and Applications, Rio de Janeiro, Brazil, June 2003, pp. 444–449 (2003)

    Google Scholar 

  31. Pandolfi, D., Vilanova, G., De San Pedro, M.E., Villagra, A., Gallard, R.: Solving the singlemachine common due date problem via studs and immigrants in evolutionary algorithms. In: Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics, Emergent Computing and Virtual Engineering, Orlando, Florida, July 2002, vol. III, pp. 409–413 (2002)

    Google Scholar 

  32. Pandolfi, D., Vilanova, G., De San Pedro, M.E., Villagra, A., Gallard, R.: Adaptability of multirecombined evolutionary algorithms in the single-machine common due date problem. In: Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics,Emergent Computing and Virtual Engineering, Orlando, Florida, July 2002, vol. III, pp. 401–404 (2002)

    Google Scholar 

  33. Pandolfi, D., De San Pedro, M.E., Vilanova, G., Villagra, A., Gallard, R.: Multirecombining random and seed immigrants in evolutionary algorithms to solve W-T scheduling problems. In: Proceedings ACIS International Conference on Computer Science, Software Engineering, Information Technology eBusiness and Application, Foz Iguazu Brazil (2002)

    Google Scholar 

  34. Pandolfi, D., De San Pedro, M.E., Villagra, A., Vilanova, G., Gallard, R.: Studs Mating Immigrants in Evolutionary Algorithm to Solve the Earliness-Tardiness Scheduling Problem. Cybernetics and Systems of Taylor and Francis Journal, 391–400 (June 2002)

    Google Scholar 

  35. Michael, P.: Scheduling: Theory, Algorithms and System, 1st edn., pp. 143–145. Prentice Hall, Englewood Cliffs (1995)

    Google Scholar 

  36. Pandolfi, D., Vilanova, G., De San Pedro, M.E., Villagra, A., Gallard, R.: Multirecombining studs and immigrants in evolutionary algorithm to face earliness-tardiness scheduling problems. In: Proceedings of the International Conference in Soft Computing, June 2001, p. 138. University of Paisley, Scotland (2001)

    Google Scholar 

  37. Reeves, C.: A genetic algorithm for flow sequencing. Computers and Operations Reserach 22, 5–13 (1995)

    Article  MATH  Google Scholar 

  38. Shaw, K.J., Lee, P.L., Nott, H.P., Thompson, M.: Genetic Algorithms for Multiobjective Scheduling of Combined Batch/Continuous process Plants. In: CEC 2000, La Jolla, USA, July 2000, pp. 293–300 (2000)

    Google Scholar 

  39. Tsujimura, Y., Gen, M., Kubota, E.: Flow shop scheduling with fuzzy processing time using genetic algorithms. In: The 11th Fuzzy Systems Symposium, Okinawa, pp. 248–252 (1995)

    Google Scholar 

  40. Wilson, E.O.: Sociobiology: the new synthesis. Harvard University Press, Cambridge (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Proyecto UNPA-29/B064, División Tecnología, Unidad Académica Caleta Olivia, Universidad Nacional de Patagonia Austral, Ruta 3 Acceso Norte s/n, (9011), Caleta Olivia, Santa Cruz, 4854888 ext.122, Argentina

    A. Villagra, M. De San Pedro, M. Lasso & D. Pandolfi

Authors
  1. A. Villagra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. De San Pedro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Lasso
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. D. Pandolfi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratorio Nacional de Informatica Avanzada, A.C. Lania, Rebsamen 80, Col. Centro, 91000, Xalapa, Veracruz, Mexico

    Christian Lemaître

  2. Department of Computer Science, National Institute of Astrophysics, Optics and Electronics (INAOE), Luis E. Erro 1, 72840, Sta. Maria Tonantzintla, Puebla, Mexico

    Carlos A. Reyes

  3. Computer Science Department, National Institute of Astrophysics, Optics and Electronics, Luis Enrique Erro 1, 72840, Tonantzintla, México

    Jesús A. González

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Villagra, A., De San Pedro, M., Lasso, M., Pandolfi, D. (2004). Multirecombined Evolutionary Algorithm Inspired in the Selfish Gene Theory to Face the Weighted Tardiness Scheduling Problem. In: Lemaître, C., Reyes, C.A., González, J.A. (eds) Advances in Artificial Intelligence – IBERAMIA 2004. IBERAMIA 2004. Lecture Notes in Computer Science(), vol 3315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30498-2_81

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30498-2_81

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23806-5

  • Online ISBN: 978-3-540-30498-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation