Skip to main content
SpringerLink
Log in
Book cover

AISB Workshop on Evolutionary Computing

AISB EC 1995: Evolutionary Computing pp 132–153Cite as

Scheduling planned maintenance of the national grid

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 993))

Abstract

The maintenance of the high voltage electricity transmission network in England and Wales (the National Grid) is planned so as to minimise costs taking into account:

  • location and size of demand for electricity,

  • generator capacities and availabilities,

  • electricity carrying capacity of the remainder of the network, i.e. that part not undergoing maintenance.

This complex optimization and scheduling problem is currently performed manually (computerised viability checks can be performed after the schedule has been produced). This paper reports work aiming to automatically generate low cost schedules using genetic algorithms (GA). So far:

  • A small demonstration problem has been identified,

  • A fitness function has been devised,

  • To date work has concentrated upon devising a representation based upon “greedy optimizers”, which combine permutation GAs with scheduling heuristics,

  • The best of these heuristics has been incorporated in the QGAME genetic algorithm programming environment and optimal solutions have been readily found.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Laurent Atlan, Jerome Bonnet, and Martine Naillon. Learning distributed reactive strategies by genetic programming for the general job shop problem. In Proceedings of the 7th annual Florida Artificial Intelligence Research Symposium, Pensacola, Florida, USA. IEEE Press, 1994.

    Google Scholar 

  2. David Andre. Automatically defined features: The simultaneous evolution of 2-dimensional feature detectors and an algorithm for using them. In Kenneth E. Kinnear, Jr., editor, Advances in Genetic Programming, chapter 23. MIT Press, 1994.

    Google Scholar 

  3. David Beasley, David R. Bull, and Ralph R. Martin. Reducing epistasis in combinatorial problems by expansive coding. In Stephanie Forrest, editor, Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93, pages 400–407. Morgan Kaufmann, July 1993.

    Google Scholar 

  4. Hugh M. Cartwright and Stephen P. Harris. Analysis of the distribution of airborne pollution using genetic algorithms. Atmospheric Environment, 27A(12):1783–1791, 1993.

    Google Scholar 

  5. Lawrence Davis, editor. Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York, 1991.

    Google Scholar 

  6. R. M. Dunnett. A proposal to use a genetic algorithm for maintenance planning. PSBM note, National Grid, Technology and Science Laboratories, July 1993. Private communication.

    Google Scholar 

  7. Hsiao-Lan Fang, Peter Ross, and Dave Corne. A promising genetic algorithm approach to job-shop scheduling, rescheduling and open-shop scheduling problems. In Stephanie Forrest, editor, Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-9S. Morgan Kaufmann, 1993.

    Google Scholar 

  8. Hsiao-Lan Fang, Peter Ross, and Dave Corne. A promising hybrid GA/heuristic approach for open-shop scheduling problems. In A. Cohn, editor, ECAI 94 Proceedings of the 11th European Conference on Artificial Intelligence, pages 590–594. John Wiley & Sons, Ltd., 1994.

    Google Scholar 

  9. J. L. Ribeiro Filho and P. Treleaven. GAME: A framework for programming genetic algorithms applications. In Proceedings of the First IEEE Conference on Evolutionary Computing — Proceedings of the 1994 IEEE World Congress on Computational Intelligence, volume 2, pages 840–845. IEEE Press, 1994. 26th June–2nd July, Orlando, USA.

    Google Scholar 

  10. David E. Goldberg. Genetic Algorithms in Search Optimization and Machine Learning. Addison Wesley, 1989.

    Google Scholar 

  11. John H. Holland. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. MIT Press, 1992. First Published by University of Michigan Press 1975.

    Google Scholar 

  12. John R. Koza. Genetic Programming: On the Programming of Computers by Natural Selection. MIT press, Cambridge, MA, 1992.

    Google Scholar 

  13. David Levine. A Parallel Genetic Algorithm for the Set Partitioning Problem. PhD thesis, Illinois Institute of Technology, Mathematics and Computer Science Division, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, IL 60439, USA, May 1994.

    Google Scholar 

  14. M. L. Maher and S. Kundu. Adaptive design using a genetic algorithm. In John S. Gero and Fay Sudweeks, editors, Formal design methods for computer-aided design, pages 211–228, University of Sydney, NSW, Australia, Jun 1993. Key Center of Design Computing, University of Sydney.

    Google Scholar 

  15. Peter Ross. About PGA 2.8, 1994. Available via ftp ftp.dai.ed.ac.uk directory pub/pga-2,8.

    Google Scholar 

  16. Jane Shaw. References on the application of genetic algorithms to production scheduling, June 1994. Available via anonymous ftp site cs.ucl.ac.uk file genetic/biblio/ga-js-shed-bibliography.txt.

    Google Scholar 

  17. T. Starkweather, S. McDaniel, K. Mathias, D. Whitley, and C. Whitley. A comparison of genetic sequencing operators. In Richard K. Belew and Lashon B. Booker, editors, Proceedings of the fourth international conference on Genetic Algorithms, pages 69–76, Briarcliff Manor, NY, USA, June 1991. Morgan Kaufmann, San Mateo, California.

    Google Scholar 

  18. Gilbert Syswerda. Schedule optimization using genetic algorithms. In Lawrence Davis, editor, Handbook of Genetic Algorithms, pages 332–349. Van Nostrand Reinhold, New York, 1991.

    Google Scholar 

  19. Christine L. Valenzuela and Antonia J. Jones. Evolutionary divide and conquer (I): novel genetic approach to the TSP. Evolutionary Computation, 1(4):313–333, 1993.

    Google Scholar 

  20. Takeshi Yamada and Ryohei Nakano. A genetic algorithm applicable to large-scale job-shop problems. In R. Manner and B. Manderick, editors, Parallel Problem Solving from Nature 2, pages 281–290, Brussels, Belgium, 1992. Elsevier Science.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept of Computer Science, University College London, Gower Street, WC1E 6BT, London

    W. B. Langdon

Authors
  1. W. B. Langdon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Terence C. Fogarty

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Langdon, W.B. (1995). Scheduling planned maintenance of the national grid. In: Fogarty, T.C. (eds) Evolutionary Computing. AISB EC 1995. Lecture Notes in Computer Science, vol 993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60469-3_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-60469-3_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60469-3

  • Online ISBN: 978-3-540-47515-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation