A novel heuristic optimization method: charged system search View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2010-01-22

AUTHORS

A. Kaveh, S. Talatahari

ABSTRACT

This paper presents a new optimization algorithm based on some principles from physics and mechanics, which will be called Charged System Search (CSS). We utilize the governing Coulomb law from electrostatics and the Newtonian laws of mechanics. CSS is a multi-agent approach in which each agent is a Charged Particle (CP). CPs can affect each other based on their fitness values and their separation distances. The quantity of the resultant force is determined by using the electrostatics laws and the quality of the movement is determined using Newtonian mechanics laws. CSS can be utilized in all optimization fields; especially it is suitable for non-smooth or non-convex domains. CSS needs neither the gradient information nor the continuity of the search space. The efficiency of the new approach is demonstrated using standard benchmark functions and some well-studied engineering design problems. A comparison of the results with those of other evolutionary algorithms shows that the proposed algorithm outperforms its rivals. More... »

PAGES

267-289

References to SciGraph publications

  • 1997. GeneAS: A Robust Optimal Design Technique for Mechanical Component Design in EVOLUTIONARY ALGORITHMS IN ENGINEERING APPLICATIONS
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s00707-009-0270-4

    DOI

    http://dx.doi.org/10.1007/s00707-009-0270-4

    DIMENSIONS

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


    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/01", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Mathematical Sciences", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0103", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Numerical and Computational Mathematics", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "Department of Civil Engineering, Centre of Excellence for Fundamental Studies in Structural Engineering, Iran University of Science and Technology, Narmak, Tehran-16, Iran", 
              "id": "http://www.grid.ac/institutes/grid.411748.f", 
              "name": [
                "Department of Civil Engineering, Centre of Excellence for Fundamental Studies in Structural Engineering, Iran University of Science and Technology, Narmak, Tehran-16, Iran"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Kaveh", 
            "givenName": "A.", 
            "id": "sg:person.010233563411.92", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010233563411.92"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Department of Civil Engineering, University of Tabriz, Tabriz, Iran", 
              "id": "http://www.grid.ac/institutes/grid.412831.d", 
              "name": [
                "Department of Civil Engineering, University of Tabriz, Tabriz, Iran"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Talatahari", 
            "givenName": "S.", 
            "id": "sg:person.013567303112.34", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013567303112.34"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/978-3-662-03423-1_27", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1011772001", 
              "https://doi.org/10.1007/978-3-662-03423-1_27"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2010-01-22", 
        "datePublishedReg": "2010-01-22", 
        "description": "This paper presents a new optimization algorithm based on some principles from physics and mechanics, which will be called Charged System Search (CSS). We utilize the governing Coulomb law from electrostatics and the Newtonian laws of mechanics. CSS is a multi-agent approach in which each agent is a Charged Particle (CP). CPs can affect each other based on their fitness values and their separation distances. The quantity of the resultant force is determined by using the electrostatics laws and the quality of the movement is determined using Newtonian mechanics laws. CSS can be utilized in all optimization fields; especially it is suitable for non-smooth or non-convex domains. CSS needs neither the gradient information nor the continuity of the search space. The efficiency of the new approach is demonstrated using standard benchmark functions and some well-studied engineering design problems. A comparison of the results with those of other evolutionary algorithms shows that the proposed algorithm outperforms its rivals.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/s00707-009-0270-4", 
        "inLanguage": "en", 
        "isAccessibleForFree": false, 
        "isPartOf": [
          {
            "id": "sg:journal.1044151", 
            "issn": [
              "0001-5970", 
              "1619-6937"
            ], 
            "name": "Acta Mechanica", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "3-4", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "213"
          }
        ], 
        "keywords": [
          "novel heuristic optimization method", 
          "heuristic optimization method", 
          "engineering design problems", 
          "new optimization algorithm", 
          "standard benchmark functions", 
          "non-convex domains", 
          "system search", 
          "optimization field", 
          "optimization method", 
          "benchmark functions", 
          "optimization algorithm", 
          "Newtonian law", 
          "design problem", 
          "evolutionary algorithm", 
          "gradient information", 
          "Coulomb's law", 
          "mechanics laws", 
          "search space", 
          "electrostatics laws", 
          "fitness value", 
          "mechanics", 
          "algorithm", 
          "law", 
          "resultant force", 
          "physics", 
          "new approach", 
          "multi-agent approach", 
          "space", 
          "separation distance", 
          "problem", 
          "electrostatics", 
          "approach", 
          "field", 
          "principles", 
          "quantity", 
          "search", 
          "force", 
          "function", 
          "distance", 
          "continuity", 
          "particles", 
          "efficiency", 
          "domain", 
          "results", 
          "comparison", 
          "values", 
          "CSS", 
          "information", 
          "CPS", 
          "quality", 
          "movement", 
          "method", 
          "CS", 
          "agents", 
          "rivals", 
          "paper", 
          "Newtonian mechanics laws"
        ], 
        "name": "A novel heuristic optimization method: charged system search", 
        "pagination": "267-289", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1031320732"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s00707-009-0270-4"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s00707-009-0270-4", 
          "https://app.dimensions.ai/details/publication/pub.1031320732"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2021-12-01T19:24", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20211201/entities/gbq_results/article/article_513.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/s00707-009-0270-4"
      }
    ]
     

    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/s00707-009-0270-4'

    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/s00707-009-0270-4'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00707-009-0270-4'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00707-009-0270-4'


     

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

    129 TRIPLES      22 PREDICATES      83 URIs      74 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s00707-009-0270-4 schema:about anzsrc-for:01
    2 anzsrc-for:0103
    3 schema:author Nab77a47381fe444bb6550c302bc469a5
    4 schema:citation sg:pub.10.1007/978-3-662-03423-1_27
    5 schema:datePublished 2010-01-22
    6 schema:datePublishedReg 2010-01-22
    7 schema:description This paper presents a new optimization algorithm based on some principles from physics and mechanics, which will be called Charged System Search (CSS). We utilize the governing Coulomb law from electrostatics and the Newtonian laws of mechanics. CSS is a multi-agent approach in which each agent is a Charged Particle (CP). CPs can affect each other based on their fitness values and their separation distances. The quantity of the resultant force is determined by using the electrostatics laws and the quality of the movement is determined using Newtonian mechanics laws. CSS can be utilized in all optimization fields; especially it is suitable for non-smooth or non-convex domains. CSS needs neither the gradient information nor the continuity of the search space. The efficiency of the new approach is demonstrated using standard benchmark functions and some well-studied engineering design problems. A comparison of the results with those of other evolutionary algorithms shows that the proposed algorithm outperforms its rivals.
    8 schema:genre article
    9 schema:inLanguage en
    10 schema:isAccessibleForFree false
    11 schema:isPartOf N3489eb9180c24cb894f85742d9faa9c1
    12 Nb360e5e63c394b05bbe2b3246ee0a982
    13 sg:journal.1044151
    14 schema:keywords CPS
    15 CS
    16 CSS
    17 Coulomb's law
    18 Newtonian law
    19 Newtonian mechanics laws
    20 agents
    21 algorithm
    22 approach
    23 benchmark functions
    24 comparison
    25 continuity
    26 design problem
    27 distance
    28 domain
    29 efficiency
    30 electrostatics
    31 electrostatics laws
    32 engineering design problems
    33 evolutionary algorithm
    34 field
    35 fitness value
    36 force
    37 function
    38 gradient information
    39 heuristic optimization method
    40 information
    41 law
    42 mechanics
    43 mechanics laws
    44 method
    45 movement
    46 multi-agent approach
    47 new approach
    48 new optimization algorithm
    49 non-convex domains
    50 novel heuristic optimization method
    51 optimization algorithm
    52 optimization field
    53 optimization method
    54 paper
    55 particles
    56 physics
    57 principles
    58 problem
    59 quality
    60 quantity
    61 resultant force
    62 results
    63 rivals
    64 search
    65 search space
    66 separation distance
    67 space
    68 standard benchmark functions
    69 system search
    70 values
    71 schema:name A novel heuristic optimization method: charged system search
    72 schema:pagination 267-289
    73 schema:productId N07574d94336e4a69afa299b3c6025814
    74 Nb07838d4417f4dcbb7da93addd051ddf
    75 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031320732
    76 https://doi.org/10.1007/s00707-009-0270-4
    77 schema:sdDatePublished 2021-12-01T19:24
    78 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    79 schema:sdPublisher Ne6c030a1dd5c4e8eb3822dfc3781f658
    80 schema:url https://doi.org/10.1007/s00707-009-0270-4
    81 sgo:license sg:explorer/license/
    82 sgo:sdDataset articles
    83 rdf:type schema:ScholarlyArticle
    84 N07574d94336e4a69afa299b3c6025814 schema:name doi
    85 schema:value 10.1007/s00707-009-0270-4
    86 rdf:type schema:PropertyValue
    87 N3489eb9180c24cb894f85742d9faa9c1 schema:volumeNumber 213
    88 rdf:type schema:PublicationVolume
    89 N6208b29a901747c189635f6319156acc rdf:first sg:person.013567303112.34
    90 rdf:rest rdf:nil
    91 Nab77a47381fe444bb6550c302bc469a5 rdf:first sg:person.010233563411.92
    92 rdf:rest N6208b29a901747c189635f6319156acc
    93 Nb07838d4417f4dcbb7da93addd051ddf schema:name dimensions_id
    94 schema:value pub.1031320732
    95 rdf:type schema:PropertyValue
    96 Nb360e5e63c394b05bbe2b3246ee0a982 schema:issueNumber 3-4
    97 rdf:type schema:PublicationIssue
    98 Ne6c030a1dd5c4e8eb3822dfc3781f658 schema:name Springer Nature - SN SciGraph project
    99 rdf:type schema:Organization
    100 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
    101 schema:name Mathematical Sciences
    102 rdf:type schema:DefinedTerm
    103 anzsrc-for:0103 schema:inDefinedTermSet anzsrc-for:
    104 schema:name Numerical and Computational Mathematics
    105 rdf:type schema:DefinedTerm
    106 sg:journal.1044151 schema:issn 0001-5970
    107 1619-6937
    108 schema:name Acta Mechanica
    109 schema:publisher Springer Nature
    110 rdf:type schema:Periodical
    111 sg:person.010233563411.92 schema:affiliation grid-institutes:grid.411748.f
    112 schema:familyName Kaveh
    113 schema:givenName A.
    114 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010233563411.92
    115 rdf:type schema:Person
    116 sg:person.013567303112.34 schema:affiliation grid-institutes:grid.412831.d
    117 schema:familyName Talatahari
    118 schema:givenName S.
    119 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013567303112.34
    120 rdf:type schema:Person
    121 sg:pub.10.1007/978-3-662-03423-1_27 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011772001
    122 https://doi.org/10.1007/978-3-662-03423-1_27
    123 rdf:type schema:CreativeWork
    124 grid-institutes:grid.411748.f schema:alternateName Department of Civil Engineering, Centre of Excellence for Fundamental Studies in Structural Engineering, Iran University of Science and Technology, Narmak, Tehran-16, Iran
    125 schema:name Department of Civil Engineering, Centre of Excellence for Fundamental Studies in Structural Engineering, Iran University of Science and Technology, Narmak, Tehran-16, Iran
    126 rdf:type schema:Organization
    127 grid-institutes:grid.412831.d schema:alternateName Department of Civil Engineering, University of Tabriz, Tabriz, Iran
    128 schema:name Department of Civil Engineering, University of Tabriz, Tabriz, Iran
    129 rdf:type schema:Organization
     




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


    ...