Parsimony Pressure versus Multi-objective Optimization for Variable Length Representations View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2012

AUTHORS

Markus Wagner , Frank Neumann

ABSTRACT

We contribute to the theoretical understanding of variable length evolutionary algorithms. Such algorithms are very flexible but can encounter the bloat problem which means solutions grow during the optimization run without providing additional benefit. We explore two common mechanisms for dealing with this problem from a theoretical point of view and point out the differences of a parsimony and a multi-objective approach in a rigorous way. As an example to point out the differences, we consider different measures of sortedness for the classical sorting problem which has already been studied in the computational complexity analysis of evolutionary algorithms with fixed length representations. More... »

PAGES

133-142

Book

TITLE

Parallel Problem Solving from Nature - PPSN XII

ISBN

978-3-642-32936-4
978-3-642-32937-1

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-32937-1_14

DOI

http://dx.doi.org/10.1007/978-3-642-32937-1_14

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1044824152


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "University of Adelaide", 
          "id": "https://www.grid.ac/institutes/grid.1010.0", 
          "name": [
            "School of Computer Science, University of Adelaide, Adelaide, SA, 5005, Australia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Wagner", 
        "givenName": "Markus", 
        "id": "sg:person.012277443734.79", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012277443734.79"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Adelaide", 
          "id": "https://www.grid.ac/institutes/grid.1010.0", 
          "name": [
            "School of Computer Science, University of Adelaide, Adelaide, SA, 5005, Australia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Neumann", 
        "givenName": "Frank", 
        "id": "sg:person.0706067076.32", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0706067076.32"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1023/b:jmma.0000049379.14872.f5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1020814341", 
          "https://doi.org/10.1023/b:jmma.0000049379.14872.f5"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1162/evco_a_00003", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1020863034"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-32937-1_11", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1025981564", 
          "https://doi.org/10.1007/978-3-642-32937-1_11"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1967654.1967670", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1027103708"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.ejor.2006.08.002", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1033498332"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1162/evco_a_00013", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1039540747"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/2330163.2330274", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1042661080"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/2330163.2330348", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1044440612"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tevc.2004.823470", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061604619"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/0-306-48041-7_14", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1086117855", 
          "https://doi.org/10.1007/0-306-48041-7_14"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2012", 
    "datePublishedReg": "2012-01-01", 
    "description": "We contribute to the theoretical understanding of variable length evolutionary algorithms. Such algorithms are very flexible but can encounter the bloat problem which means solutions grow during the optimization run without providing additional benefit. We explore two common mechanisms for dealing with this problem from a theoretical point of view and point out the differences of a parsimony and a multi-objective approach in a rigorous way. As an example to point out the differences, we consider different measures of sortedness for the classical sorting problem which has already been studied in the computational complexity analysis of evolutionary algorithms with fixed length representations.", 
    "editor": [
      {
        "familyName": "Coello", 
        "givenName": "Carlos A. Coello", 
        "type": "Person"
      }, 
      {
        "familyName": "Cutello", 
        "givenName": "Vincenzo", 
        "type": "Person"
      }, 
      {
        "familyName": "Deb", 
        "givenName": "Kalyanmoy", 
        "type": "Person"
      }, 
      {
        "familyName": "Forrest", 
        "givenName": "Stephanie", 
        "type": "Person"
      }, 
      {
        "familyName": "Nicosia", 
        "givenName": "Giuseppe", 
        "type": "Person"
      }, 
      {
        "familyName": "Pavone", 
        "givenName": "Mario", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-32937-1_14", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-642-32936-4", 
        "978-3-642-32937-1"
      ], 
      "name": "Parallel Problem Solving from Nature - PPSN XII", 
      "type": "Book"
    }, 
    "name": "Parsimony Pressure versus Multi-objective Optimization for Variable Length Representations", 
    "pagination": "133-142", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-32937-1_14"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "d5830f7aa173701fc62a0e55fe04c1ef2ff1399b92c508df9a323421c0545eb8"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1044824152"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-32937-1_14", 
      "https://app.dimensions.ai/details/publication/pub.1044824152"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-15T16:19", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8675_00000271.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/978-3-642-32937-1_14"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-32937-1_14'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-32937-1_14'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-32937-1_14'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-32937-1_14'


 

This table displays all metadata directly associated to this object as RDF triples.

130 TRIPLES      23 PREDICATES      37 URIs      20 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-32937-1_14 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N6751a9e7dd4c4f5983dc27ad4bd654ba
4 schema:citation sg:pub.10.1007/0-306-48041-7_14
5 sg:pub.10.1007/978-3-642-32937-1_11
6 sg:pub.10.1023/b:jmma.0000049379.14872.f5
7 https://doi.org/10.1016/j.ejor.2006.08.002
8 https://doi.org/10.1109/tevc.2004.823470
9 https://doi.org/10.1145/1967654.1967670
10 https://doi.org/10.1145/2330163.2330274
11 https://doi.org/10.1145/2330163.2330348
12 https://doi.org/10.1162/evco_a_00003
13 https://doi.org/10.1162/evco_a_00013
14 schema:datePublished 2012
15 schema:datePublishedReg 2012-01-01
16 schema:description We contribute to the theoretical understanding of variable length evolutionary algorithms. Such algorithms are very flexible but can encounter the bloat problem which means solutions grow during the optimization run without providing additional benefit. We explore two common mechanisms for dealing with this problem from a theoretical point of view and point out the differences of a parsimony and a multi-objective approach in a rigorous way. As an example to point out the differences, we consider different measures of sortedness for the classical sorting problem which has already been studied in the computational complexity analysis of evolutionary algorithms with fixed length representations.
17 schema:editor N69c23788d127488ea97d9ffff81599e7
18 schema:genre chapter
19 schema:inLanguage en
20 schema:isAccessibleForFree false
21 schema:isPartOf Ned73f00beedf42b182e511aa8f2d595f
22 schema:name Parsimony Pressure versus Multi-objective Optimization for Variable Length Representations
23 schema:pagination 133-142
24 schema:productId N115deb74ce4e41cab7ffeb553f34058e
25 N41dae8c685414b4aac5397e13e3ae9c3
26 N8ee2bc9d589249b798bad451dfa3c0d6
27 schema:publisher Na96d478aaae44728b17891fb6cc1a887
28 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044824152
29 https://doi.org/10.1007/978-3-642-32937-1_14
30 schema:sdDatePublished 2019-04-15T16:19
31 schema:sdLicense https://scigraph.springernature.com/explorer/license/
32 schema:sdPublisher Nc45fd42958cd4699a64083bc0eb9990a
33 schema:url http://link.springer.com/10.1007/978-3-642-32937-1_14
34 sgo:license sg:explorer/license/
35 sgo:sdDataset chapters
36 rdf:type schema:Chapter
37 N08553a2056394460bbd366ca84d53d6c rdf:first Nc3066d2e0290455e8e70790c432a4429
38 rdf:rest N89e80a1159084d98aa6b4c6100f5d889
39 N115deb74ce4e41cab7ffeb553f34058e schema:name readcube_id
40 schema:value d5830f7aa173701fc62a0e55fe04c1ef2ff1399b92c508df9a323421c0545eb8
41 rdf:type schema:PropertyValue
42 N3e8d9207f5eb46508ae8236a61801bc3 schema:familyName Deb
43 schema:givenName Kalyanmoy
44 rdf:type schema:Person
45 N41dae8c685414b4aac5397e13e3ae9c3 schema:name dimensions_id
46 schema:value pub.1044824152
47 rdf:type schema:PropertyValue
48 N55d6e1313982481a90900383dce9e74c rdf:first N8facc8360e5240f491bfedde11eae865
49 rdf:rest N62bcefb7cba24c20bb4be95aade7becb
50 N62bcefb7cba24c20bb4be95aade7becb rdf:first N3e8d9207f5eb46508ae8236a61801bc3
51 rdf:rest N8bf1a71ae40849b283707b1a57287600
52 N6751a9e7dd4c4f5983dc27ad4bd654ba rdf:first sg:person.012277443734.79
53 rdf:rest Nc0e6c3b4ef404700bde2ffae97e74918
54 N69c23788d127488ea97d9ffff81599e7 rdf:first Nb07f93b3ed9746b48db8513b41586e41
55 rdf:rest N55d6e1313982481a90900383dce9e74c
56 N89e80a1159084d98aa6b4c6100f5d889 rdf:first Ne0c25cddfd484670b17bf08d312d8df7
57 rdf:rest rdf:nil
58 N8bf1a71ae40849b283707b1a57287600 rdf:first Nf30e25c54c85488192a3c5e7872cb125
59 rdf:rest N08553a2056394460bbd366ca84d53d6c
60 N8ee2bc9d589249b798bad451dfa3c0d6 schema:name doi
61 schema:value 10.1007/978-3-642-32937-1_14
62 rdf:type schema:PropertyValue
63 N8facc8360e5240f491bfedde11eae865 schema:familyName Cutello
64 schema:givenName Vincenzo
65 rdf:type schema:Person
66 Na96d478aaae44728b17891fb6cc1a887 schema:location Berlin, Heidelberg
67 schema:name Springer Berlin Heidelberg
68 rdf:type schema:Organisation
69 Nb07f93b3ed9746b48db8513b41586e41 schema:familyName Coello
70 schema:givenName Carlos A. Coello
71 rdf:type schema:Person
72 Nc0e6c3b4ef404700bde2ffae97e74918 rdf:first sg:person.0706067076.32
73 rdf:rest rdf:nil
74 Nc3066d2e0290455e8e70790c432a4429 schema:familyName Nicosia
75 schema:givenName Giuseppe
76 rdf:type schema:Person
77 Nc45fd42958cd4699a64083bc0eb9990a schema:name Springer Nature - SN SciGraph project
78 rdf:type schema:Organization
79 Ne0c25cddfd484670b17bf08d312d8df7 schema:familyName Pavone
80 schema:givenName Mario
81 rdf:type schema:Person
82 Ned73f00beedf42b182e511aa8f2d595f schema:isbn 978-3-642-32936-4
83 978-3-642-32937-1
84 schema:name Parallel Problem Solving from Nature - PPSN XII
85 rdf:type schema:Book
86 Nf30e25c54c85488192a3c5e7872cb125 schema:familyName Forrest
87 schema:givenName Stephanie
88 rdf:type schema:Person
89 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
90 schema:name Information and Computing Sciences
91 rdf:type schema:DefinedTerm
92 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
93 schema:name Computation Theory and Mathematics
94 rdf:type schema:DefinedTerm
95 sg:person.012277443734.79 schema:affiliation https://www.grid.ac/institutes/grid.1010.0
96 schema:familyName Wagner
97 schema:givenName Markus
98 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012277443734.79
99 rdf:type schema:Person
100 sg:person.0706067076.32 schema:affiliation https://www.grid.ac/institutes/grid.1010.0
101 schema:familyName Neumann
102 schema:givenName Frank
103 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0706067076.32
104 rdf:type schema:Person
105 sg:pub.10.1007/0-306-48041-7_14 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086117855
106 https://doi.org/10.1007/0-306-48041-7_14
107 rdf:type schema:CreativeWork
108 sg:pub.10.1007/978-3-642-32937-1_11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025981564
109 https://doi.org/10.1007/978-3-642-32937-1_11
110 rdf:type schema:CreativeWork
111 sg:pub.10.1023/b:jmma.0000049379.14872.f5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020814341
112 https://doi.org/10.1023/b:jmma.0000049379.14872.f5
113 rdf:type schema:CreativeWork
114 https://doi.org/10.1016/j.ejor.2006.08.002 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033498332
115 rdf:type schema:CreativeWork
116 https://doi.org/10.1109/tevc.2004.823470 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061604619
117 rdf:type schema:CreativeWork
118 https://doi.org/10.1145/1967654.1967670 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027103708
119 rdf:type schema:CreativeWork
120 https://doi.org/10.1145/2330163.2330274 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042661080
121 rdf:type schema:CreativeWork
122 https://doi.org/10.1145/2330163.2330348 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044440612
123 rdf:type schema:CreativeWork
124 https://doi.org/10.1162/evco_a_00003 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020863034
125 rdf:type schema:CreativeWork
126 https://doi.org/10.1162/evco_a_00013 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039540747
127 rdf:type schema:CreativeWork
128 https://www.grid.ac/institutes/grid.1010.0 schema:alternateName University of Adelaide
129 schema:name School of Computer Science, University of Adelaide, Adelaide, SA, 5005, Australia
130 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...