New binary bat algorithm for solving 0–1 knapsack problem View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2018-03

AUTHORS

Rizk M. Rizk-Allah, Aboul Ella Hassanien

ABSTRACT

This paper presents a novel binary bat algorithm (NBBA) to solve 0–1 knapsack problems. The proposed algorithm combines two important phases: binary bat algorithm (BBA) and local search scheme (LSS). The bat algorithm enables the bats to enhance the exploration capability while LSS aims to boost the exploitation tendencies and, therefore, it can prevent the BBA–LSS from the entrapment in the local optima. Moreover, the LSS starts its search from BBA found so far. By this methodology, the BBA–LSS enhances the diversity of bats and improves the convergence performance. The proposed algorithm is tested on different size instances from the literature. Computational experiments show that the BBA–LSS can be promise alternative for solving large-scale 0–1 knapsack problems. More... »

PAGES

31-53

References to SciGraph publications

  • 2010. A New Metaheuristic Bat-Inspired Algorithm in NATURE INSPIRED COOPERATIVE STRATEGIES FOR OPTIMIZATION (NICSO 2010)
  • 2016-06. Solving 0–1 Knapsack Problem using Cohort Intelligence Algorithm in INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS
  • 2005. Harmony Search in Water Pump Switching Problem in ADVANCES IN NATURAL COMPUTATION
  • 2013-05. Bat algorithm for constrained optimization tasks in NEURAL COMPUTING AND APPLICATIONS
  • 2018-11. Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem in NEURAL COMPUTING AND APPLICATIONS
  • 2017. Cohort Intelligence: A Socio-inspired Optimization Method in NONE
  • 2014. A Binary Firefly Algorithm for the Set Covering Problem in MODERN TRENDS AND TECHNIQUES IN COMPUTER SCIENCE
  • 2010. A Discrete Harmony Search Algorithm in LIFE SYSTEM MODELING AND INTELLIGENT COMPUTING
  • 2017-07. Solving 0–1 knapsack problem by a novel binary monarch butterfly optimization in NEURAL COMPUTING AND APPLICATIONS
  • 2013. An Adaptive Bat Algorithm in INTELLIGENT COMPUTING THEORIES AND TECHNOLOGY
  • 1982-10. Rough sets in INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING
  • 2014-09. Binary bat algorithm in NEURAL COMPUTING AND APPLICATIONS
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s40747-017-0050-z

    DOI

    http://dx.doi.org/10.1007/s40747-017-0050-z

    DIMENSIONS

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


    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": "Menoufia University", 
              "id": "https://www.grid.ac/institutes/grid.411775.1", 
              "name": [
                "Department of Basic Engineering Science, Faculty of Engineering, Menoufia University, Shebin El-Kom, Egypt", 
                "Scientific Research Group in Egypt, Cairo, Egypt"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Rizk-Allah", 
            "givenName": "Rizk M.", 
            "id": "sg:person.010712431270.38", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010712431270.38"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Cairo University", 
              "id": "https://www.grid.ac/institutes/grid.7776.1", 
              "name": [
                "Faculty of Computers and Information, Cairo University, Giza, Egypt", 
                "Scientific Research Group in Egypt, Cairo, Egypt"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Hassanien", 
            "givenName": "Aboul Ella", 
            "id": "sg:person.012212264333.42", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012212264333.42"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/s13042-014-0272-y", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002301962", 
              "https://doi.org/10.1007/s13042-014-0272-y"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://app.dimensions.ai/details/publication/pub.1002733803", 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-44254-9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002733803", 
              "https://doi.org/10.1007/978-3-319-44254-9"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1108/02644401211235834", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1004203510"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-12538-6_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1005169093", 
              "https://doi.org/10.1007/978-3-642-12538-6_6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-12538-6_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1005169093", 
              "https://doi.org/10.1007/978-3-642-12538-6_6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.amc.2013.04.023", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1006136693"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.neucom.2010.07.010", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1007946957"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.swevo.2011.02.002", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1011052808"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00521-013-1525-5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1011748406", 
              "https://doi.org/10.1007/s00521-013-1525-5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.swevo.2013.09.002", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1014389287"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.asoc.2012.11.048", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1014676479"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01001956", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020579132", 
              "https://doi.org/10.1007/bf01001956"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.ejor.2006.12.046", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1022902118"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1155/2014/709738", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1024885919"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00521-015-2135-1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1026551675", 
              "https://doi.org/10.1007/s00521-015-2135-1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00521-015-2135-1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1026551675", 
              "https://doi.org/10.1007/s00521-015-2135-1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-15859-9_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1029436781", 
              "https://doi.org/10.1007/978-3-642-15859-9_6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-15859-9_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1029436781", 
              "https://doi.org/10.1007/978-3-642-15859-9_6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0045-7825(99)00389-8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1029969435"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.eswa.2015.02.015", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1032709438"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00521-012-1028-9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033196250", 
              "https://doi.org/10.1007/s00521-012-1028-9"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.ins.2012.12.043", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033805237"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1080/18756891.2016.1256577", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033877183"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.ijepes.2013.05.015", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1040081872"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11539902_92", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1041626198", 
              "https://doi.org/10.1007/11539902_92"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11539902_92", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1041626198", 
              "https://doi.org/10.1007/11539902_92"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.asoc.2010.07.019", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1044063139"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-39482-9_25", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047644575", 
              "https://doi.org/10.1007/978-3-642-39482-9_25"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.asoc.2014.02.010", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047671867"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.4236/jilsa.2013.51002", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047837794"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1155/2013/696491", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047888402"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-06740-7_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1053350351", 
              "https://doi.org/10.1007/978-3-319-06740-7_6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.7763/lnse.2013.v1.61", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1074041318"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00521-017-2903-1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1083887997", 
              "https://doi.org/10.1007/s00521-017-2903-1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/icsmc.1997.637339", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1093293147"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/ccdc.2009.5192838", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1094574266"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/icndc.2011.14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095073202"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/icia.2006.305887", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095258525"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/iacsit-sc.2009.31", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095717733"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1201/b19133", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095907765"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2018-03", 
        "datePublishedReg": "2018-03-01", 
        "description": "This paper presents a novel binary bat algorithm (NBBA) to solve 0\u20131 knapsack problems. The proposed algorithm combines two important phases: binary bat algorithm (BBA) and local search scheme (LSS). The bat algorithm enables the bats to enhance the exploration capability while LSS aims to boost the exploitation tendencies and, therefore, it can prevent the BBA\u2013LSS from the entrapment in the local optima. Moreover, the LSS starts its search from BBA found so far. By this methodology, the BBA\u2013LSS enhances the diversity of bats and improves the convergence performance. The proposed algorithm is tested on different size instances from the literature. Computational experiments show that the BBA\u2013LSS can be promise alternative for solving large-scale 0\u20131 knapsack problems.", 
        "genre": "research_article", 
        "id": "sg:pub.10.1007/s40747-017-0050-z", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": true, 
        "isPartOf": [
          {
            "id": "sg:journal.1136144", 
            "issn": [
              "2199-4536", 
              "2198-6053"
            ], 
            "name": "Complex & Intelligent Systems", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "1", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "4"
          }
        ], 
        "name": "New binary bat algorithm for solving 0\u20131 knapsack problem", 
        "pagination": "31-53", 
        "productId": [
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "c9f05e51807ae9cdfc3373ea2dab090b1a17e2acc488413de69586746f4e813a"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s40747-017-0050-z"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1091052446"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s40747-017-0050-z", 
          "https://app.dimensions.ai/details/publication/pub.1091052446"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2019-04-11T10:29", 
        "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/0000000349_0000000349/records_113641_00000004.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://link.springer.com/10.1007%2Fs40747-017-0050-z"
      }
    ]
     

    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/s40747-017-0050-z'

    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/s40747-017-0050-z'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s40747-017-0050-z'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s40747-017-0050-z'


     

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

    195 TRIPLES      21 PREDICATES      64 URIs      19 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s40747-017-0050-z schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author N835a1d978bca4ffba037a021d794a214
    4 schema:citation sg:pub.10.1007/11539902_92
    5 sg:pub.10.1007/978-3-319-06740-7_6
    6 sg:pub.10.1007/978-3-319-44254-9
    7 sg:pub.10.1007/978-3-642-12538-6_6
    8 sg:pub.10.1007/978-3-642-15859-9_6
    9 sg:pub.10.1007/978-3-642-39482-9_25
    10 sg:pub.10.1007/bf01001956
    11 sg:pub.10.1007/s00521-012-1028-9
    12 sg:pub.10.1007/s00521-013-1525-5
    13 sg:pub.10.1007/s00521-015-2135-1
    14 sg:pub.10.1007/s00521-017-2903-1
    15 sg:pub.10.1007/s13042-014-0272-y
    16 https://app.dimensions.ai/details/publication/pub.1002733803
    17 https://doi.org/10.1016/j.amc.2013.04.023
    18 https://doi.org/10.1016/j.asoc.2010.07.019
    19 https://doi.org/10.1016/j.asoc.2012.11.048
    20 https://doi.org/10.1016/j.asoc.2014.02.010
    21 https://doi.org/10.1016/j.ejor.2006.12.046
    22 https://doi.org/10.1016/j.eswa.2015.02.015
    23 https://doi.org/10.1016/j.ijepes.2013.05.015
    24 https://doi.org/10.1016/j.ins.2012.12.043
    25 https://doi.org/10.1016/j.neucom.2010.07.010
    26 https://doi.org/10.1016/j.swevo.2011.02.002
    27 https://doi.org/10.1016/j.swevo.2013.09.002
    28 https://doi.org/10.1016/s0045-7825(99)00389-8
    29 https://doi.org/10.1080/18756891.2016.1256577
    30 https://doi.org/10.1108/02644401211235834
    31 https://doi.org/10.1109/ccdc.2009.5192838
    32 https://doi.org/10.1109/iacsit-sc.2009.31
    33 https://doi.org/10.1109/icia.2006.305887
    34 https://doi.org/10.1109/icndc.2011.14
    35 https://doi.org/10.1109/icsmc.1997.637339
    36 https://doi.org/10.1155/2013/696491
    37 https://doi.org/10.1155/2014/709738
    38 https://doi.org/10.1201/b19133
    39 https://doi.org/10.4236/jilsa.2013.51002
    40 https://doi.org/10.7763/lnse.2013.v1.61
    41 schema:datePublished 2018-03
    42 schema:datePublishedReg 2018-03-01
    43 schema:description This paper presents a novel binary bat algorithm (NBBA) to solve 0–1 knapsack problems. The proposed algorithm combines two important phases: binary bat algorithm (BBA) and local search scheme (LSS). The bat algorithm enables the bats to enhance the exploration capability while LSS aims to boost the exploitation tendencies and, therefore, it can prevent the BBA–LSS from the entrapment in the local optima. Moreover, the LSS starts its search from BBA found so far. By this methodology, the BBA–LSS enhances the diversity of bats and improves the convergence performance. The proposed algorithm is tested on different size instances from the literature. Computational experiments show that the BBA–LSS can be promise alternative for solving large-scale 0–1 knapsack problems.
    44 schema:genre research_article
    45 schema:inLanguage en
    46 schema:isAccessibleForFree true
    47 schema:isPartOf N4b5fee3ca91c4948b0da343499546053
    48 N83e7088095434ad2947f3eb4e0747340
    49 sg:journal.1136144
    50 schema:name New binary bat algorithm for solving 0–1 knapsack problem
    51 schema:pagination 31-53
    52 schema:productId N0912c35916a4482cb291ff330f49d559
    53 N386b2ef8c1f4488390e900366674fd25
    54 N72fa572fc4fb48d3bde54d3f6f8ee0e5
    55 schema:sameAs https://app.dimensions.ai/details/publication/pub.1091052446
    56 https://doi.org/10.1007/s40747-017-0050-z
    57 schema:sdDatePublished 2019-04-11T10:29
    58 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    59 schema:sdPublisher N4b99fc49c02547d18182917963a9db3d
    60 schema:url https://link.springer.com/10.1007%2Fs40747-017-0050-z
    61 sgo:license sg:explorer/license/
    62 sgo:sdDataset articles
    63 rdf:type schema:ScholarlyArticle
    64 N0912c35916a4482cb291ff330f49d559 schema:name dimensions_id
    65 schema:value pub.1091052446
    66 rdf:type schema:PropertyValue
    67 N386b2ef8c1f4488390e900366674fd25 schema:name readcube_id
    68 schema:value c9f05e51807ae9cdfc3373ea2dab090b1a17e2acc488413de69586746f4e813a
    69 rdf:type schema:PropertyValue
    70 N4b5fee3ca91c4948b0da343499546053 schema:volumeNumber 4
    71 rdf:type schema:PublicationVolume
    72 N4b99fc49c02547d18182917963a9db3d schema:name Springer Nature - SN SciGraph project
    73 rdf:type schema:Organization
    74 N72fa572fc4fb48d3bde54d3f6f8ee0e5 schema:name doi
    75 schema:value 10.1007/s40747-017-0050-z
    76 rdf:type schema:PropertyValue
    77 N835a1d978bca4ffba037a021d794a214 rdf:first sg:person.010712431270.38
    78 rdf:rest Nf4cf6de74d774b129df9d1f1362aea95
    79 N83e7088095434ad2947f3eb4e0747340 schema:issueNumber 1
    80 rdf:type schema:PublicationIssue
    81 Nf4cf6de74d774b129df9d1f1362aea95 rdf:first sg:person.012212264333.42
    82 rdf:rest rdf:nil
    83 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    84 schema:name Information and Computing Sciences
    85 rdf:type schema:DefinedTerm
    86 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    87 schema:name Computation Theory and Mathematics
    88 rdf:type schema:DefinedTerm
    89 sg:journal.1136144 schema:issn 2198-6053
    90 2199-4536
    91 schema:name Complex & Intelligent Systems
    92 rdf:type schema:Periodical
    93 sg:person.010712431270.38 schema:affiliation https://www.grid.ac/institutes/grid.411775.1
    94 schema:familyName Rizk-Allah
    95 schema:givenName Rizk M.
    96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010712431270.38
    97 rdf:type schema:Person
    98 sg:person.012212264333.42 schema:affiliation https://www.grid.ac/institutes/grid.7776.1
    99 schema:familyName Hassanien
    100 schema:givenName Aboul Ella
    101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012212264333.42
    102 rdf:type schema:Person
    103 sg:pub.10.1007/11539902_92 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041626198
    104 https://doi.org/10.1007/11539902_92
    105 rdf:type schema:CreativeWork
    106 sg:pub.10.1007/978-3-319-06740-7_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053350351
    107 https://doi.org/10.1007/978-3-319-06740-7_6
    108 rdf:type schema:CreativeWork
    109 sg:pub.10.1007/978-3-319-44254-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002733803
    110 https://doi.org/10.1007/978-3-319-44254-9
    111 rdf:type schema:CreativeWork
    112 sg:pub.10.1007/978-3-642-12538-6_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005169093
    113 https://doi.org/10.1007/978-3-642-12538-6_6
    114 rdf:type schema:CreativeWork
    115 sg:pub.10.1007/978-3-642-15859-9_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029436781
    116 https://doi.org/10.1007/978-3-642-15859-9_6
    117 rdf:type schema:CreativeWork
    118 sg:pub.10.1007/978-3-642-39482-9_25 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047644575
    119 https://doi.org/10.1007/978-3-642-39482-9_25
    120 rdf:type schema:CreativeWork
    121 sg:pub.10.1007/bf01001956 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020579132
    122 https://doi.org/10.1007/bf01001956
    123 rdf:type schema:CreativeWork
    124 sg:pub.10.1007/s00521-012-1028-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033196250
    125 https://doi.org/10.1007/s00521-012-1028-9
    126 rdf:type schema:CreativeWork
    127 sg:pub.10.1007/s00521-013-1525-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011748406
    128 https://doi.org/10.1007/s00521-013-1525-5
    129 rdf:type schema:CreativeWork
    130 sg:pub.10.1007/s00521-015-2135-1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026551675
    131 https://doi.org/10.1007/s00521-015-2135-1
    132 rdf:type schema:CreativeWork
    133 sg:pub.10.1007/s00521-017-2903-1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1083887997
    134 https://doi.org/10.1007/s00521-017-2903-1
    135 rdf:type schema:CreativeWork
    136 sg:pub.10.1007/s13042-014-0272-y schema:sameAs https://app.dimensions.ai/details/publication/pub.1002301962
    137 https://doi.org/10.1007/s13042-014-0272-y
    138 rdf:type schema:CreativeWork
    139 https://app.dimensions.ai/details/publication/pub.1002733803 schema:CreativeWork
    140 https://doi.org/10.1016/j.amc.2013.04.023 schema:sameAs https://app.dimensions.ai/details/publication/pub.1006136693
    141 rdf:type schema:CreativeWork
    142 https://doi.org/10.1016/j.asoc.2010.07.019 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044063139
    143 rdf:type schema:CreativeWork
    144 https://doi.org/10.1016/j.asoc.2012.11.048 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014676479
    145 rdf:type schema:CreativeWork
    146 https://doi.org/10.1016/j.asoc.2014.02.010 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047671867
    147 rdf:type schema:CreativeWork
    148 https://doi.org/10.1016/j.ejor.2006.12.046 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022902118
    149 rdf:type schema:CreativeWork
    150 https://doi.org/10.1016/j.eswa.2015.02.015 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032709438
    151 rdf:type schema:CreativeWork
    152 https://doi.org/10.1016/j.ijepes.2013.05.015 schema:sameAs https://app.dimensions.ai/details/publication/pub.1040081872
    153 rdf:type schema:CreativeWork
    154 https://doi.org/10.1016/j.ins.2012.12.043 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033805237
    155 rdf:type schema:CreativeWork
    156 https://doi.org/10.1016/j.neucom.2010.07.010 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007946957
    157 rdf:type schema:CreativeWork
    158 https://doi.org/10.1016/j.swevo.2011.02.002 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011052808
    159 rdf:type schema:CreativeWork
    160 https://doi.org/10.1016/j.swevo.2013.09.002 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014389287
    161 rdf:type schema:CreativeWork
    162 https://doi.org/10.1016/s0045-7825(99)00389-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029969435
    163 rdf:type schema:CreativeWork
    164 https://doi.org/10.1080/18756891.2016.1256577 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033877183
    165 rdf:type schema:CreativeWork
    166 https://doi.org/10.1108/02644401211235834 schema:sameAs https://app.dimensions.ai/details/publication/pub.1004203510
    167 rdf:type schema:CreativeWork
    168 https://doi.org/10.1109/ccdc.2009.5192838 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094574266
    169 rdf:type schema:CreativeWork
    170 https://doi.org/10.1109/iacsit-sc.2009.31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095717733
    171 rdf:type schema:CreativeWork
    172 https://doi.org/10.1109/icia.2006.305887 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095258525
    173 rdf:type schema:CreativeWork
    174 https://doi.org/10.1109/icndc.2011.14 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095073202
    175 rdf:type schema:CreativeWork
    176 https://doi.org/10.1109/icsmc.1997.637339 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093293147
    177 rdf:type schema:CreativeWork
    178 https://doi.org/10.1155/2013/696491 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047888402
    179 rdf:type schema:CreativeWork
    180 https://doi.org/10.1155/2014/709738 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024885919
    181 rdf:type schema:CreativeWork
    182 https://doi.org/10.1201/b19133 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095907765
    183 rdf:type schema:CreativeWork
    184 https://doi.org/10.4236/jilsa.2013.51002 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047837794
    185 rdf:type schema:CreativeWork
    186 https://doi.org/10.7763/lnse.2013.v1.61 schema:sameAs https://app.dimensions.ai/details/publication/pub.1074041318
    187 rdf:type schema:CreativeWork
    188 https://www.grid.ac/institutes/grid.411775.1 schema:alternateName Menoufia University
    189 schema:name Department of Basic Engineering Science, Faculty of Engineering, Menoufia University, Shebin El-Kom, Egypt
    190 Scientific Research Group in Egypt, Cairo, Egypt
    191 rdf:type schema:Organization
    192 https://www.grid.ac/institutes/grid.7776.1 schema:alternateName Cairo University
    193 schema:name Faculty of Computers and Information, Cairo University, Giza, Egypt
    194 Scientific Research Group in Egypt, Cairo, Egypt
    195 rdf:type schema:Organization
     




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


    ...