A Memetic Immunological Algorithm for Resource Allocation Problem View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2011

AUTHORS

Jole Costanza , Vincenzo Cutello , Mario Pavone

ABSTRACT

In this research work, we present a combination of a memetic algorithm and an immunological algorithm that we call Memetic Immunological Algorithm – MIA. This algorithm has been designed to tackle the resource allocation problem on a communication network. The aim of the problem is to supply all resource requested on a communication network with minimal costs and using a fixed number of providers, everyone with a limited resource quantity to be supplied. The scheduling of several resource allocations is a classical combinatorial problem that finds many applications in real-world problems. MIA incorporates two deterministic approaches: (1) a local search operator, which is based on the exploration of the neighbourhood; and (2) a deterministic approach for the assignment scheme based on the Depth First Search (DFS) algorithm. The results show that the usage of a local search procedure and mainly the DFS algorithm is an effective and efficient approach to better exploring the complex search space of the problem. To evaluate the performances of MIA we have used 28 different instances. The obtained results suggest that MIA is an effective optimization algorithm in terms of the quality of the solution produced and of the computational effort. More... »

PAGES

308-320

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-22371-6_27

DOI

http://dx.doi.org/10.1007/978-3-642-22371-6_27

DIMENSIONS

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


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/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Mathematics and Computer Science, University of Catania, V.le A. Doria 6, 95125, Catania, Italy", 
          "id": "http://www.grid.ac/institutes/grid.8158.4", 
          "name": [
            "Department of Mathematics and Computer Science, University of Catania, V.le A. Doria 6, 95125, Catania, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Costanza", 
        "givenName": "Jole", 
        "id": "sg:person.010420143347.24", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010420143347.24"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Mathematics and Computer Science, University of Catania, V.le A. Doria 6, 95125, Catania, Italy", 
          "id": "http://www.grid.ac/institutes/grid.8158.4", 
          "name": [
            "Department of Mathematics and Computer Science, University of Catania, V.le A. Doria 6, 95125, Catania, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Cutello", 
        "givenName": "Vincenzo", 
        "id": "sg:person.013504603243.51", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013504603243.51"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Mathematics and Computer Science, University of Catania, V.le A. Doria 6, 95125, Catania, Italy", 
          "id": "http://www.grid.ac/institutes/grid.8158.4", 
          "name": [
            "Department of Mathematics and Computer Science, University of Catania, V.le A. Doria 6, 95125, Catania, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Pavone", 
        "givenName": "Mario", 
        "id": "sg:person.07350620665.82", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07350620665.82"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2011", 
    "datePublishedReg": "2011-01-01", 
    "description": "In this research work, we present a combination of a memetic algorithm and an immunological algorithm that we call Memetic Immunological Algorithm \u2013 MIA. This algorithm has been designed to tackle the resource allocation problem on a communication network. The aim of the problem is to supply all resource requested on a communication network with minimal costs and using a fixed number of providers, everyone with a limited resource quantity to be supplied. The scheduling of several resource allocations is a classical combinatorial problem that finds many applications in real-world problems. MIA incorporates two deterministic approaches: (1) a local search operator, which is based on the exploration of the neighbourhood; and (2) a deterministic approach for the assignment scheme based on the Depth First Search (DFS) algorithm. The results show that the usage of a local search procedure and mainly the DFS algorithm is an effective and efficient approach to better exploring the complex search space of the problem. To evaluate the performances of MIA we have used 28 different instances. The obtained results suggest that MIA is an effective optimization algorithm in terms of the quality of the solution produced and of the computational effort.", 
    "editor": [
      {
        "familyName": "Li\u00f2", 
        "givenName": "Pietro", 
        "type": "Person"
      }, 
      {
        "familyName": "Nicosia", 
        "givenName": "Giuseppe", 
        "type": "Person"
      }, 
      {
        "familyName": "Stibor", 
        "givenName": "Thomas", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-22371-6_27", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-22370-9", 
        "978-3-642-22371-6"
      ], 
      "name": "Artificial Immune Systems", 
      "type": "Book"
    }, 
    "keywords": [
      "resource allocation problem", 
      "communication networks", 
      "allocation problem", 
      "depth first search algorithm", 
      "complex search space", 
      "real-world problems", 
      "first search algorithm", 
      "immunological algorithm", 
      "local search operator", 
      "local search procedure", 
      "classical combinatorial problem", 
      "effective optimization algorithm", 
      "memetic algorithm", 
      "DFS algorithm", 
      "search algorithm", 
      "search space", 
      "search operators", 
      "combinatorial problems", 
      "assignment scheme", 
      "search procedure", 
      "different instances", 
      "algorithm", 
      "optimization algorithm", 
      "resource allocation", 
      "computational effort", 
      "deterministic approach", 
      "efficient approach", 
      "research work", 
      "minimal cost", 
      "network", 
      "number of providers", 
      "scheduling", 
      "resource quantity", 
      "scheme", 
      "allocation", 
      "usage", 
      "operators", 
      "resources", 
      "providers", 
      "instances", 
      "applications", 
      "performance", 
      "cost", 
      "space", 
      "MIA", 
      "exploration", 
      "quality", 
      "solution", 
      "work", 
      "neighborhood", 
      "results", 
      "efforts", 
      "terms", 
      "number", 
      "combination", 
      "procedure", 
      "quantity", 
      "aim", 
      "problem", 
      "approach", 
      "Memetic Immunological Algorithm \u2013 MIA", 
      "Immunological Algorithm \u2013 MIA", 
      "Algorithm \u2013 MIA", 
      "limited resource quantity", 
      "performances of MIA", 
      "Memetic Immunological Algorithm"
    ], 
    "name": "A Memetic Immunological Algorithm for Resource Allocation Problem", 
    "pagination": "308-320", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1037498388"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-22371-6_27"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-22371-6_27", 
      "https://app.dimensions.ai/details/publication/pub.1037498388"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:15", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_276.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-22371-6_27"
  }
]
 

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-22371-6_27'

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-22371-6_27'

Turtle is a human-readable linked data format.

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

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-22371-6_27'


 

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

150 TRIPLES      23 PREDICATES      92 URIs      85 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-22371-6_27 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Nf8e14ee543f842d8bb3ab9713f5a40e1
4 schema:datePublished 2011
5 schema:datePublishedReg 2011-01-01
6 schema:description In this research work, we present a combination of a memetic algorithm and an immunological algorithm that we call Memetic Immunological Algorithm – MIA. This algorithm has been designed to tackle the resource allocation problem on a communication network. The aim of the problem is to supply all resource requested on a communication network with minimal costs and using a fixed number of providers, everyone with a limited resource quantity to be supplied. The scheduling of several resource allocations is a classical combinatorial problem that finds many applications in real-world problems. MIA incorporates two deterministic approaches: (1) a local search operator, which is based on the exploration of the neighbourhood; and (2) a deterministic approach for the assignment scheme based on the Depth First Search (DFS) algorithm. The results show that the usage of a local search procedure and mainly the DFS algorithm is an effective and efficient approach to better exploring the complex search space of the problem. To evaluate the performances of MIA we have used 28 different instances. The obtained results suggest that MIA is an effective optimization algorithm in terms of the quality of the solution produced and of the computational effort.
7 schema:editor Nc888fd85eb184464baccb80feb99059c
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf Nf474319f78cf4df8bd7f6b147c643a8b
12 schema:keywords Algorithm – MIA
13 DFS algorithm
14 Immunological Algorithm – MIA
15 MIA
16 Memetic Immunological Algorithm
17 Memetic Immunological Algorithm – MIA
18 aim
19 algorithm
20 allocation
21 allocation problem
22 applications
23 approach
24 assignment scheme
25 classical combinatorial problem
26 combination
27 combinatorial problems
28 communication networks
29 complex search space
30 computational effort
31 cost
32 depth first search algorithm
33 deterministic approach
34 different instances
35 effective optimization algorithm
36 efficient approach
37 efforts
38 exploration
39 first search algorithm
40 immunological algorithm
41 instances
42 limited resource quantity
43 local search operator
44 local search procedure
45 memetic algorithm
46 minimal cost
47 neighborhood
48 network
49 number
50 number of providers
51 operators
52 optimization algorithm
53 performance
54 performances of MIA
55 problem
56 procedure
57 providers
58 quality
59 quantity
60 real-world problems
61 research work
62 resource allocation
63 resource allocation problem
64 resource quantity
65 resources
66 results
67 scheduling
68 scheme
69 search algorithm
70 search operators
71 search procedure
72 search space
73 solution
74 space
75 terms
76 usage
77 work
78 schema:name A Memetic Immunological Algorithm for Resource Allocation Problem
79 schema:pagination 308-320
80 schema:productId N6a91c674b0274bcc989d4121adcafe47
81 N96ac150efc924b0f8f7f846025a296bd
82 schema:publisher N4a540438f4774160b37036ccf11ad114
83 schema:sameAs https://app.dimensions.ai/details/publication/pub.1037498388
84 https://doi.org/10.1007/978-3-642-22371-6_27
85 schema:sdDatePublished 2022-01-01T19:15
86 schema:sdLicense https://scigraph.springernature.com/explorer/license/
87 schema:sdPublisher Nd5e089abd3334a4a90979025b6672ae3
88 schema:url https://doi.org/10.1007/978-3-642-22371-6_27
89 sgo:license sg:explorer/license/
90 sgo:sdDataset chapters
91 rdf:type schema:Chapter
92 N3228c0f79f3a473ba2f0e1b9136ed5e4 rdf:first sg:person.013504603243.51
93 rdf:rest Na25a3993c858473a8b9d0bc5c103da15
94 N3adde3084ab44bf7907f5d94140fafa0 rdf:first Ned8d384c8b4e422fb2a36c4c4c93d917
95 rdf:rest rdf:nil
96 N4a540438f4774160b37036ccf11ad114 schema:name Springer Nature
97 rdf:type schema:Organisation
98 N6a91c674b0274bcc989d4121adcafe47 schema:name doi
99 schema:value 10.1007/978-3-642-22371-6_27
100 rdf:type schema:PropertyValue
101 N7ff6757f215f4e05b086195443c13d66 rdf:first Nc12cbd163c0e4bfa9554c9ccfcd34007
102 rdf:rest N3adde3084ab44bf7907f5d94140fafa0
103 N8473ce8dc06c47e6a2fe5564e884166e schema:familyName Liò
104 schema:givenName Pietro
105 rdf:type schema:Person
106 N96ac150efc924b0f8f7f846025a296bd schema:name dimensions_id
107 schema:value pub.1037498388
108 rdf:type schema:PropertyValue
109 Na25a3993c858473a8b9d0bc5c103da15 rdf:first sg:person.07350620665.82
110 rdf:rest rdf:nil
111 Nc12cbd163c0e4bfa9554c9ccfcd34007 schema:familyName Nicosia
112 schema:givenName Giuseppe
113 rdf:type schema:Person
114 Nc888fd85eb184464baccb80feb99059c rdf:first N8473ce8dc06c47e6a2fe5564e884166e
115 rdf:rest N7ff6757f215f4e05b086195443c13d66
116 Nd5e089abd3334a4a90979025b6672ae3 schema:name Springer Nature - SN SciGraph project
117 rdf:type schema:Organization
118 Ned8d384c8b4e422fb2a36c4c4c93d917 schema:familyName Stibor
119 schema:givenName Thomas
120 rdf:type schema:Person
121 Nf474319f78cf4df8bd7f6b147c643a8b schema:isbn 978-3-642-22370-9
122 978-3-642-22371-6
123 schema:name Artificial Immune Systems
124 rdf:type schema:Book
125 Nf8e14ee543f842d8bb3ab9713f5a40e1 rdf:first sg:person.010420143347.24
126 rdf:rest N3228c0f79f3a473ba2f0e1b9136ed5e4
127 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
128 schema:name Information and Computing Sciences
129 rdf:type schema:DefinedTerm
130 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
131 schema:name Computation Theory and Mathematics
132 rdf:type schema:DefinedTerm
133 sg:person.010420143347.24 schema:affiliation grid-institutes:grid.8158.4
134 schema:familyName Costanza
135 schema:givenName Jole
136 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010420143347.24
137 rdf:type schema:Person
138 sg:person.013504603243.51 schema:affiliation grid-institutes:grid.8158.4
139 schema:familyName Cutello
140 schema:givenName Vincenzo
141 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013504603243.51
142 rdf:type schema:Person
143 sg:person.07350620665.82 schema:affiliation grid-institutes:grid.8158.4
144 schema:familyName Pavone
145 schema:givenName Mario
146 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07350620665.82
147 rdf:type schema:Person
148 grid-institutes:grid.8158.4 schema:alternateName Department of Mathematics and Computer Science, University of Catania, V.le A. Doria 6, 95125, Catania, Italy
149 schema:name Department of Mathematics and Computer Science, University of Catania, V.le A. Doria 6, 95125, Catania, Italy
150 rdf:type schema:Organization
 




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


...