IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v64y2013i12p1725-1741.html
   My bibliography  Save this article

Automated code generation by local search

Author

Listed:
  • M R Hyde

    (University of Nottingham, Nottingham, UK)

  • E K Burke

    (University of Nottingham, Nottingham, UK)

  • G Kendall

    (University of Nottingham, Nottingham, UK)

Abstract

There are many successful evolutionary computation techniques for automatic program generation, with the best known, perhaps, being genetic programming. Genetic programming has obtained human competitive results, even infringing on patented inventions. The majority of the scientific literature on automatic program generation employs such population-based search approaches, to allow a computer system to search a space of programs. In this paper, we present an alternative approach based on local search. There are many local search methodologies that allow successful search of a solution space, based on maintaining a single incumbent solution and searching its neighbourhood. However, use of these methodologies in searching a space of programs has not yet been systematically investigated. The contribution of this paper is to show that a local search of programs can be more successful at automatic program generation than current nature inspired evolutionary computation methodologies.

Suggested Citation

  • M R Hyde & E K Burke & G Kendall, 2013. "Automated code generation by local search," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(12), pages 1725-1741, December.
    • Handle: RePEc:pal:jorsoc:v:64:y:2013:i:12:p:1725-1741
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v64/n12/pdf/jors2012149a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v64/n12/full/jors2012149a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:64:y:2013:i:12:p:1725-1741. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.