Comparative Study of Simulated Annealing Algorithms for Optimal Arrangement Problems in a Linear Consecutive-k-out-of-n: F System View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2010

AUTHORS

Koji Shingyochi , Hisashi Yamamoto

ABSTRACT

A linear consecutive-k-out-of-n: F system is an ordered sequence of n components. This system fails if, and only if, k or more consecutive components fail. Optimal arrangement problem is one of the main problems for such kind of system. We can obtain an optimal solution for this problem by calculating n! system reliabilities. As n increases, however, the amount of calculation would be too much to obtain the optimal solution within a reasonable computing time. In this paper, we applied simulated annealing algorithm to obtain quasi optimal arrangements, because it is known as a powerful tool for solving many optimization problems. In order to search efficiently, we proposed eight types of neighborhood generating method on the basis of three ideas. We compared those performances through numerical experiments. More... »

PAGES

157-168

Book

TITLE

Advanced Computer Science and Information Technology

ISBN

978-3-642-13345-9
978-3-642-13346-6

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-13346-6_15

DOI

http://dx.doi.org/10.1007/978-3-642-13346-6_15

DIMENSIONS

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


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/0103", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Numerical and Computational Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Jumonji University", 
          "id": "https://www.grid.ac/institutes/grid.444497.e", 
          "name": [
            "Faculty of Social and Information Sciences, Jumonji University, 2-1-28 Sugasawa, Niiza, 352-8510, Saitama, Japan"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Shingyochi", 
        "givenName": "Koji", 
        "id": "sg:person.07622713631.18", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07622713631.18"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Tokyo Metropolitan University", 
          "id": "https://www.grid.ac/institutes/grid.265074.2", 
          "name": [
            "Faculty of System Design, Tokyo Metropolitan University, 6-6 Asahigaoka, Hino, 191-0065, Tokyo, Japan"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Yamamoto", 
        "givenName": "Hisashi", 
        "id": "sg:person.013120042411.03", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013120042411.03"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1109/24.55888", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061133811"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tr.1982.5221229", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061782062"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tr.1982.5221426", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061782161"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tr.1984.5221885", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061782364"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tr.1985.5221924", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061782427"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1126/science.220.4598.671", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062526985"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1587/transfun.e92.a.1578", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1068089340"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2010", 
    "datePublishedReg": "2010-01-01", 
    "description": "A linear consecutive-k-out-of-n: F system is an ordered sequence of n components. This system fails if, and only if, k or more consecutive components fail. Optimal arrangement problem is one of the main problems for such kind of system. We can obtain an optimal solution for this problem by calculating n! system reliabilities. As n increases, however, the amount of calculation would be too much to obtain the optimal solution within a reasonable computing time. In this paper, we applied simulated annealing algorithm to obtain quasi optimal arrangements, because it is known as a powerful tool for solving many optimization problems. In order to search efficiently, we proposed eight types of neighborhood generating method on the basis of three ideas. We compared those performances through numerical experiments.", 
    "editor": [
      {
        "familyName": "Tomar", 
        "givenName": "G. S.", 
        "type": "Person"
      }, 
      {
        "familyName": "Chang", 
        "givenName": "Ruay-Shiung", 
        "type": "Person"
      }, 
      {
        "familyName": "Gervasi", 
        "givenName": "Osvaldo", 
        "type": "Person"
      }, 
      {
        "familyName": "Kim", 
        "givenName": "Tai-hoon", 
        "type": "Person"
      }, 
      {
        "familyName": "Bandyopadhyay", 
        "givenName": "Samir Kumar", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-13346-6_15", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-642-13345-9", 
        "978-3-642-13346-6"
      ], 
      "name": "Advanced Computer Science and Information Technology", 
      "type": "Book"
    }, 
    "name": "Comparative Study of Simulated Annealing Algorithms for Optimal Arrangement Problems in a Linear Consecutive-k-out-of-n: F System", 
    "pagination": "157-168", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1009322016"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-13346-6_15"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "2c6833a59faeb310a40ea1b85cc0a1feddcc7df893e0d3e51686bf98466f4bb8"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-13346-6_15", 
      "https://app.dimensions.ai/details/publication/pub.1009322016"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-16T08:27", 
    "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/0000000363_0000000363/records_70064_00000000.jsonl", 
    "type": "Chapter", 
    "url": "https://link.springer.com/10.1007%2F978-3-642-13346-6_15"
  }
]
 

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-13346-6_15'

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-13346-6_15'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-13346-6_15'

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-13346-6_15'


 

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

116 TRIPLES      23 PREDICATES      34 URIs      20 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-13346-6_15 schema:about anzsrc-for:01
2 anzsrc-for:0103
3 schema:author Nf1c12fce84f1488d968cb05f268089a3
4 schema:citation https://doi.org/10.1109/24.55888
5 https://doi.org/10.1109/tr.1982.5221229
6 https://doi.org/10.1109/tr.1982.5221426
7 https://doi.org/10.1109/tr.1984.5221885
8 https://doi.org/10.1109/tr.1985.5221924
9 https://doi.org/10.1126/science.220.4598.671
10 https://doi.org/10.1587/transfun.e92.a.1578
11 schema:datePublished 2010
12 schema:datePublishedReg 2010-01-01
13 schema:description A linear consecutive-k-out-of-n: F system is an ordered sequence of n components. This system fails if, and only if, k or more consecutive components fail. Optimal arrangement problem is one of the main problems for such kind of system. We can obtain an optimal solution for this problem by calculating n! system reliabilities. As n increases, however, the amount of calculation would be too much to obtain the optimal solution within a reasonable computing time. In this paper, we applied simulated annealing algorithm to obtain quasi optimal arrangements, because it is known as a powerful tool for solving many optimization problems. In order to search efficiently, we proposed eight types of neighborhood generating method on the basis of three ideas. We compared those performances through numerical experiments.
14 schema:editor N5964863e8f194e98a5c45077df0f279f
15 schema:genre chapter
16 schema:inLanguage en
17 schema:isAccessibleForFree false
18 schema:isPartOf N8ca928e651a046d1a1cd15ed71481d85
19 schema:name Comparative Study of Simulated Annealing Algorithms for Optimal Arrangement Problems in a Linear Consecutive-k-out-of-n: F System
20 schema:pagination 157-168
21 schema:productId N345c8593f73c4ba7a4fca266eb46fb74
22 N6eb202fd86ba4612a8ea4aa833cbf5ea
23 Nd34cfa17e9834e7a85e7e3ed5fc18397
24 schema:publisher N7f39a51de58d46fca6da5e65170a1119
25 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009322016
26 https://doi.org/10.1007/978-3-642-13346-6_15
27 schema:sdDatePublished 2019-04-16T08:27
28 schema:sdLicense https://scigraph.springernature.com/explorer/license/
29 schema:sdPublisher Nac0bf5ccdf5a478aa6f669cbf2a38dbe
30 schema:url https://link.springer.com/10.1007%2F978-3-642-13346-6_15
31 sgo:license sg:explorer/license/
32 sgo:sdDataset chapters
33 rdf:type schema:Chapter
34 N101ed4497ed34aec97a5ca15c986819a rdf:first N9473b65188884c44ba9c1f5ed2854d2b
35 rdf:rest rdf:nil
36 N3333dbdab0bc42cc84a09608548e3022 schema:familyName Gervasi
37 schema:givenName Osvaldo
38 rdf:type schema:Person
39 N345c8593f73c4ba7a4fca266eb46fb74 schema:name dimensions_id
40 schema:value pub.1009322016
41 rdf:type schema:PropertyValue
42 N5964863e8f194e98a5c45077df0f279f rdf:first N86b53c3dec714d0e81d9eaf0f6d9cf9b
43 rdf:rest Nc38694498102431a8958de13c528a7eb
44 N6eb202fd86ba4612a8ea4aa833cbf5ea schema:name doi
45 schema:value 10.1007/978-3-642-13346-6_15
46 rdf:type schema:PropertyValue
47 N7aa666e2723145c4950ed4570501f0fa rdf:first N7e612552e4e94f20a4210334d4651a99
48 rdf:rest N101ed4497ed34aec97a5ca15c986819a
49 N7e612552e4e94f20a4210334d4651a99 schema:familyName Kim
50 schema:givenName Tai-hoon
51 rdf:type schema:Person
52 N7f39a51de58d46fca6da5e65170a1119 schema:location Berlin, Heidelberg
53 schema:name Springer Berlin Heidelberg
54 rdf:type schema:Organisation
55 N86b53c3dec714d0e81d9eaf0f6d9cf9b schema:familyName Tomar
56 schema:givenName G. S.
57 rdf:type schema:Person
58 N8ca928e651a046d1a1cd15ed71481d85 schema:isbn 978-3-642-13345-9
59 978-3-642-13346-6
60 schema:name Advanced Computer Science and Information Technology
61 rdf:type schema:Book
62 N9473b65188884c44ba9c1f5ed2854d2b schema:familyName Bandyopadhyay
63 schema:givenName Samir Kumar
64 rdf:type schema:Person
65 Na67b9ea9dcb64e80aae10c56e1b5919a schema:familyName Chang
66 schema:givenName Ruay-Shiung
67 rdf:type schema:Person
68 Nac0bf5ccdf5a478aa6f669cbf2a38dbe schema:name Springer Nature - SN SciGraph project
69 rdf:type schema:Organization
70 Nc38694498102431a8958de13c528a7eb rdf:first Na67b9ea9dcb64e80aae10c56e1b5919a
71 rdf:rest Ndab7eb83550949778ed3e64546092245
72 Nc5682458cdb74f89a54883167a1adb27 rdf:first sg:person.013120042411.03
73 rdf:rest rdf:nil
74 Nd34cfa17e9834e7a85e7e3ed5fc18397 schema:name readcube_id
75 schema:value 2c6833a59faeb310a40ea1b85cc0a1feddcc7df893e0d3e51686bf98466f4bb8
76 rdf:type schema:PropertyValue
77 Ndab7eb83550949778ed3e64546092245 rdf:first N3333dbdab0bc42cc84a09608548e3022
78 rdf:rest N7aa666e2723145c4950ed4570501f0fa
79 Nf1c12fce84f1488d968cb05f268089a3 rdf:first sg:person.07622713631.18
80 rdf:rest Nc5682458cdb74f89a54883167a1adb27
81 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
82 schema:name Mathematical Sciences
83 rdf:type schema:DefinedTerm
84 anzsrc-for:0103 schema:inDefinedTermSet anzsrc-for:
85 schema:name Numerical and Computational Mathematics
86 rdf:type schema:DefinedTerm
87 sg:person.013120042411.03 schema:affiliation https://www.grid.ac/institutes/grid.265074.2
88 schema:familyName Yamamoto
89 schema:givenName Hisashi
90 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013120042411.03
91 rdf:type schema:Person
92 sg:person.07622713631.18 schema:affiliation https://www.grid.ac/institutes/grid.444497.e
93 schema:familyName Shingyochi
94 schema:givenName Koji
95 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07622713631.18
96 rdf:type schema:Person
97 https://doi.org/10.1109/24.55888 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061133811
98 rdf:type schema:CreativeWork
99 https://doi.org/10.1109/tr.1982.5221229 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061782062
100 rdf:type schema:CreativeWork
101 https://doi.org/10.1109/tr.1982.5221426 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061782161
102 rdf:type schema:CreativeWork
103 https://doi.org/10.1109/tr.1984.5221885 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061782364
104 rdf:type schema:CreativeWork
105 https://doi.org/10.1109/tr.1985.5221924 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061782427
106 rdf:type schema:CreativeWork
107 https://doi.org/10.1126/science.220.4598.671 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062526985
108 rdf:type schema:CreativeWork
109 https://doi.org/10.1587/transfun.e92.a.1578 schema:sameAs https://app.dimensions.ai/details/publication/pub.1068089340
110 rdf:type schema:CreativeWork
111 https://www.grid.ac/institutes/grid.265074.2 schema:alternateName Tokyo Metropolitan University
112 schema:name Faculty of System Design, Tokyo Metropolitan University, 6-6 Asahigaoka, Hino, 191-0065, Tokyo, Japan
113 rdf:type schema:Organization
114 https://www.grid.ac/institutes/grid.444497.e schema:alternateName Jumonji University
115 schema:name Faculty of Social and Information Sciences, Jumonji University, 2-1-28 Sugasawa, Niiza, 352-8510, Saitama, Japan
116 rdf:type schema:Organization
 




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


...