Evolving Efficient Recursive Sorting Algorithms

Object Oriented Genetic Programming (OOGP) is applied to the task of evolving general recursive sorting algorithms. We studied the effects of language primitives and fitness functions on the success of the evolutionary process. For language primitives, these were the methods of a simple list process...

Full description

Saved in:
Bibliographic Details
Published in:2006 IEEE International Conference on Evolutionary Computation pp. 2677 - 2684
Main Authors: Agapitos, A., Lucas, S.M.
Format: Conference Proceeding
Language:English
Published: IEEE 2006
Subjects:
Computer industry
Computer science
Control systems
Genetic programming
Iterative algorithms
Java
Object oriented programming
Packaging
Sorting
Time measurement
ISBN:9780780394872, 0780394879
ISSN:1089-778X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Object Oriented Genetic Programming (OOGP) is applied to the task of evolving general recursive sorting algorithms. We studied the effects of language primitives and fitness functions on the success of the evolutionary process. For language primitives, these were the methods of a simple list processing package. Five different fitness functions based on sequence disorder were evaluated. The time complexity of the successfully evolved algorithms was measured experimentally in terms of the number of method invocations made, and for the best evolved individuals this was best approximated as O(n times log(n)). This is the first time that sorting algorithms of this complexity have been evolved.
AbstractList Object Oriented Genetic Programming (OOGP) is applied to the task of evolving general recursive sorting algorithms. We studied the effects of language primitives and fitness functions on the success of the evolutionary process. For language primitives, these were the methods of a simple list processing package. Five different fitness functions based on sequence disorder were evaluated. The time complexity of the successfully evolved algorithms was measured experimentally in terms of the number of method invocations made, and for the best evolved individuals this was best approximated as O(n times log(n)). This is the first time that sorting algorithms of this complexity have been evolved.
Author Agapitos, A.
Lucas, S.M.
Author_xml – sequence: 1
  givenname: A.
  surname: Agapitos
  fullname: Agapitos, A.
  organization: Essex Univ., Colchester
– sequence: 2
  givenname: S.M.
  surname: Lucas
  fullname: Lucas, S.M.
  organization: Essex Univ., Colchester
BookMark eNotj0tLw0AUhQesYFu7F9zkDyS988g8liXEBxQE7cJdmZneqSNpIjMx4L-3YuHAWXxw-M6CzPqhR0LuKFSUglk3bVMxAFlRqbUU_IqsjNJwDjdCKzYjcwralErp9xuyyPkTgIqamjlZt9PQTbE_Fm0I0Ufsx-IV_XfKccLibUjjH9t0xyHF8eOUb8l1sF3G1aWXZPfQ7pqncvvy-NxstmU0MJZCeO608GjBB7QuSMmkOlDpkAsNTEM4OO8CC4pZsBJrb1Gi4nWN8qzKl-T-fzYi4v4rxZNNP_vLPf4LEUxFxQ
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CEC.2006.1688643
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EndPage 2684
ExternalDocumentID 1688643
Genre orig-research
GroupedDBID -~X
.DC
0R~
29I
4.4
5GY
5VS
6IE
6IF
6IK
6IL
6IN
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABJNI
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ADZIZ
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
CS3
EBS
EJD
HZ~
H~9
IEGSK
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
PQQKQ
RIA
RIE
RIL
RNS
TN5
VH1
ID FETCH-LOGICAL-i90t-44c3b84cea0cfeabf66267d16be3480280fdbcbf2f72a0a6e5cae6e7355e61083
IEDL.DBID RIE
ISBN 9780780394872
0780394879
ISSN 1089-778X
IngestDate Wed Aug 27 01:33:49 EDT 2025
IsPeerReviewed true
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-44c3b84cea0cfeabf66267d16be3480280fdbcbf2f72a0a6e5cae6e7355e61083
PageCount 8
ParticipantIDs ieee_primary_1688643
PublicationCentury 2000
PublicationDate 20060000
PublicationDateYYYYMMDD 2006-01-01
PublicationDate_xml – year: 2006
  text: 20060000
PublicationDecade 2000
PublicationTitle 2006 IEEE International Conference on Evolutionary Computation
PublicationTitleAbbrev CEC
PublicationYear 2006
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0014519
ssj0000394734
Score 1.6855632
Snippet Object Oriented Genetic Programming (OOGP) is applied to the task of evolving general recursive sorting algorithms. We studied the effects of language...
SourceID ieee
SourceType Publisher
StartPage 2677
SubjectTerms Computer industry
Computer science
Control systems
Genetic programming
Iterative algorithms
Java
Object oriented programming
Packaging
Sorting
Time measurement
Title Evolving Efficient Recursive Sorting Algorithms
URI https://ieeexplore.ieee.org/document/1688643
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH4B4kEvKGD8nR08OtnWsrZHQ0Y8EaIcuJG2e0USZQaGf79tN0ATL966ZemWbut77_ve-x7AvSGuuTRRobH2LLQbXhwqoUnIDKFJbr-xQa58swk2HvPZTEwa8LCvhUFEn3yGj27oufy80FsHlfXjlHNrQZvQZCytarX2eEpEBGVO6qxmEJxsSpVcL6wHyWc-ZOfuKs5ErbyzO052_GUk-sNsWFEU9c1-dV3xRmfU_t_jnkLvUL0XTPZ26QwauOpAe9e-Iaj_5g6c_NAi7EI_sxuVQxeCzKtK2KmDFwfGu_z24LVwagOL4Ol9UayX5dvHpgfTUTYdPod1N4VwKaIypFQTxalGGWmDUpnUhjIsj1OFhHJHsJpcaWUSwxIZyRQHWmKKzPojaF0sTs6htSpWeAFBoqi0s9BIKjuyIQYSJZCj9RzyONHyErpuMeaflV7GvF6Hq79PX8PxAda4gVa53uItHOmvcrlZ3_mX_A2L-aDI
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BNFEvKGD87Q4enWxr2dqjISMYkRDlwI203SuSKDMw_PtttwGaePHWLUu3dFvfe9_33vcAbjWxzaWJdLWxZ67Z8HxXckXcSBMaJOYbaycybzYRDQZsPObDCtxtamEQMU8-w3s7zLn8JFUrC5W1_JAxY0F3YLdNaeAV1VobRMUjnEZW7KzkEKxwSpFez40PycZ50M7sVSzipfbO-jhYM5geb3XiTkFSlLf71XclNzvd2v8e-Aia2_o9Z7ixTMdQwXkdausGDk75P9fh8IcaYQNasdmqLL7gxLmuhJnaebFwvM1wd15TqzcwdR7ep-lilr19LJsw6sajTs8t-ym4M-5lLqWKSEYVCk9pFFKHJpiJEj-USCizFKtOpJI60FEgPBFiWwkMMTIeCRoni5ETqM7TOZ6CE0gqzCzUE9KMTJCBRHJkaHyHxA-UOIOGXYzJZ6GYMSnX4fzv0zew3xs99yf9x8HTBRxsQY5LqGaLFV7BnvrKZsvFdf7CvwEfVaQP
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2006+IEEE+International+Conference+on+Evolutionary+Computation&rft.atitle=Evolving+Efficient+Recursive+Sorting+Algorithms&rft.au=Agapitos%2C+A.&rft.au=Lucas%2C+S.M.&rft.date=2006-01-01&rft.pub=IEEE&rft.isbn=9780780394872&rft.issn=1089-778X&rft.spage=2677&rft.epage=2684&rft_id=info:doi/10.1109%2FCEC.2006.1688643&rft.externalDocID=1688643
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1089-778X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1089-778X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1089-778X&client=summon