A novel grouping harmony search algorithm for the multiple-type access node location problem
In this paper we present a novel grouping harmony search algorithm for the Access Node Location Problem (ANLP) with different types of concentrators. The ANLP is a NP-hard problem where a set of distributed terminals, with distinct rate demands, must be assigned to a variable number of concentrators...
Uloženo v:
| Vydáno v: | Expert systems with applications Ročník 39; číslo 5; s. 5262 - 5270 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.04.2012
|
| Témata: | |
| ISSN: | 0957-4174, 1873-6793 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | In this paper we present a novel grouping harmony search algorithm for the Access Node Location Problem (ANLP) with different types of concentrators. The ANLP is a NP-hard problem where a set of distributed terminals, with distinct rate demands, must be assigned to a variable number of concentrators subject to capacity constraints. We consider the possibility of choosing between different concentrator models is given in order to provide service demand at different cost. The ANLP is relevant in communication networks design, and has been considered before within the design of MPLS networks, for example. The approach we propose to tackle the ANLP problem consists of a hybrid Grouping Harmony Search (GHS) algorithm with a local search method and a technique for repairing unfeasible solutions. Moreover, the presented scheme also includes the adaptation of the GHS to a differential scheme, where each proposed harmony is obtained from the same harmony in the previous iteration. This differential scheme is perfectly adapted to the specifications of the ANLP problem, as it utilizes the grouping concept based on the proximity between nodes, instead of being only based on the grouping concept. This allows for a higher efficiency on the searching process of the algorithm. Extensive Monte Carlo simulations in synthetic instances show that this proposal provides faster convergence rate, less computational complexity and better statistical performance than alternative algorithms for the ANLP, such as grouping genetic algorithms, specially when the size of the scenario increases. We also include practical results for the application of GHS to a real wireless network deployment problem in Bizkaia, northern Spain. |
|---|---|
| AbstractList | In this paper we present a novel grouping harmony search algorithm for the Access Node Location Problem (ANLP) with different types of concentrators. The ANLP is a NP-hard problem where a set of distributed terminals, with distinct rate demands, must be assigned to a variable number of concentrators subject to capacity constraints. We consider the possibility of choosing between different concentrator models is given in order to provide service demand at different cost. The ANLP is relevant in communication networks design, and has been considered before within the design of MPLS networks, for example. The approach we propose to tackle the ANLP problem consists of a hybrid Grouping Harmony Search (GHS) algorithm with a local search method and a technique for repairing unfeasible solutions. Moreover, the presented scheme also includes the adaptation of the GHS to a differential scheme, where each proposed harmony is obtained from the same harmony in the previous iteration. This differential scheme is perfectly adapted to the specifications of the ANLP problem, as it utilizes the grouping concept based on the proximity between nodes, instead of being only based on the grouping concept. This allows for a higher efficiency on the searching process of the algorithm. Extensive Monte Carlo simulations in synthetic instances show that this proposal provides faster convergence rate, less computational complexity and better statistical performance than alternative algorithms for the ANLP, such as grouping genetic algorithms, specially when the size of the scenario increases. We also include practical results for the application of GHS to a real wireless network deployment problem in Bizkaia, northern Spain. |
| Author | Ser, J. Del Landa-Torres, I. Portilla-Figueras, J.A. Gil-Lopez, S. Salcedo-Sanz, S. |
| Author_xml | – sequence: 1 givenname: I. surname: Landa-Torres fullname: Landa-Torres, I. organization: TECNALIA-TELECOM, Zamudio, Bizkaia, Spain – sequence: 2 givenname: S. surname: Gil-Lopez fullname: Gil-Lopez, S. organization: TECNALIA-TELECOM, Zamudio, Bizkaia, Spain – sequence: 3 givenname: S. surname: Salcedo-Sanz fullname: Salcedo-Sanz, S. email: sancho.salcedo@uah.es organization: Department of Signal Theory and Communications, Universidad de Alcalá, 28871 Alcalá, Madrid, Spain – sequence: 4 givenname: J. Del surname: Ser fullname: Ser, J. Del organization: TECNALIA-TELECOM, Zamudio, Bizkaia, Spain – sequence: 5 givenname: J.A. surname: Portilla-Figueras fullname: Portilla-Figueras, J.A. organization: Department of Signal Theory and Communications, Universidad de Alcalá, 28871 Alcalá, Madrid, Spain |
| BookMark | eNqFkEFvEzEQhS1UJNLCH-DkI5cN43jX3pW4VBUUpEq9wA3JcsaziSPverGdovx7HMKphyI9aS7ve6P3rtnVHGdi7L2AtQChPh7WlH_b9QaEWFeBkK_YSvRaNkoP8oqtYOh00wrdvmHXOR8AhAbQK_bzls_xiQLfpXhc_Lzje5umOJ94Jptwz23YxeTLfuJjTLzsiU_HUPwSqCmnhbhFpJxriCMeItri48yXFLeBprfs9WhDpnf_7g378eXz97uvzcPj_be724cGpVKlcYhAo1Zi47qNE71qFfQjba0mLVuStlXbzlmkdhy2qrN6aJ2SpNBhiyA7ecM-XHLr319HysVMPiOFYGeKx2xqVyFA9wP83woCBuj64ZzaX6yYYs6JRoO-_O1XkvWhWs9uZQ7mvL05b2-q6vYV3TxDl-Qnm04vQ58uENWpnjwlk9HTjOR8IizGRf8S_gcd56Ek |
| CitedBy_id | crossref_primary_10_1016_j_jmsy_2014_05_004 crossref_primary_10_1080_0305215X_2013_854350 crossref_primary_10_1155_2016_6972818 crossref_primary_10_1016_j_eij_2015_09_001 crossref_primary_10_3390_s21072458 crossref_primary_10_1016_j_engappai_2013_05_008 crossref_primary_10_3390_app10238392 crossref_primary_10_1016_j_engappai_2012_06_002 crossref_primary_10_1016_j_eswa_2016_02_032 crossref_primary_10_1080_23302674_2016_1193254 crossref_primary_10_1016_j_eswa_2012_03_063 crossref_primary_10_1007_s00500_018_3300_0 crossref_primary_10_1016_j_neucom_2021_12_074 crossref_primary_10_1016_j_asoc_2016_07_031 crossref_primary_10_1007_s00339_013_8032_5 crossref_primary_10_1016_j_eswa_2012_12_043 crossref_primary_10_1016_j_amc_2013_04_053 |
| Cites_doi | 10.1016/j.asoc.2007.10.021 10.1109/TSMCB.2003.817081 10.1016/j.eswa.2006.10.024 10.1177/003754970107600201 10.1007/s00500-008-0312-1 10.1016/S0952-1976(04)00085-5 10.1080/03052150500467430 10.1109/TSMCB.2004.836471 10.1016/S0957-4174(99)00031-7 10.1016/j.comcom.2007.03.005 10.1016/j.comcom.2008.03.019 10.1016/j.eswa.2008.09.020 10.1016/j.comcom.2007.04.018 |
| ContentType | Journal Article |
| Copyright | 2011 Elsevier Ltd |
| Copyright_xml | – notice: 2011 Elsevier Ltd |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.eswa.2011.11.013 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1873-6793 |
| EndPage | 5270 |
| ExternalDocumentID | 10_1016_j_eswa_2011_11_013 S0957417411015430 |
| GroupedDBID | --K --M .DC .~1 0R~ 13V 1B1 1RT 1~. 1~5 29G 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN ABBOA ABFNM ABKBG ABMAC ABMVD ABUCO ABXDB ABYKQ ACDAQ ACGFS ACHRH ACNNM ACNTT ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGJBL AGUBO AGUMN AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALEQD ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC BNSAS CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HAMUX HLZ HVGLF HZ~ IHE J1W JJJVA KOM LG9 LY1 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SDS SES SET SEW SPC SPCBC SSB SSD SSL SST SSV SSZ T5K TN5 WUQ XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABJNI ABUFD ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c366t-dcc0ef7612d52d1864608feba7e734e3a46b5dace4f9b65a794d63e6cdc4c0353 |
| ISICitedReferencesCount | 20 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000301155300061&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0957-4174 |
| IngestDate | Sun Nov 09 14:33:10 EST 2025 Wed Oct 01 14:09:12 EDT 2025 Tue Nov 18 22:31:01 EST 2025 Sat Nov 29 04:44:29 EST 2025 Fri Feb 23 02:26:30 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | Hybrid algorithms Grouping genetic algorithms Grouping-based encoding Access node location problem Harmony search algorithm |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c366t-dcc0ef7612d52d1864608feba7e734e3a46b5dace4f9b65a794d63e6cdc4c0353 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 ObjectType-Article-1 ObjectType-Feature-2 |
| PQID | 1010905895 |
| PQPubID | 23500 |
| PageCount | 9 |
| ParticipantIDs | proquest_miscellaneous_1701107890 proquest_miscellaneous_1010905895 crossref_citationtrail_10_1016_j_eswa_2011_11_013 crossref_primary_10_1016_j_eswa_2011_11_013 elsevier_sciencedirect_doi_10_1016_j_eswa_2011_11_013 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-04-01 |
| PublicationDateYYYYMMDD | 2012-04-01 |
| PublicationDate_xml | – month: 04 year: 2012 text: 2012-04-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Expert systems with applications |
| PublicationYear | 2012 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Salcedo-Sanz, Yao (b0085) 2004; 34 Menon, Gupta (b0075) 2004; 34 Shen, Wang (b0095) 2008; 34 Forsati, Haghighat, Mahdavi (b0040) 2008; 31 James, Vroblefski, Nottingham (b0065) 2007; 30 Geem, Hoon Kim, Loganathan (b0050) 2001; 76 Falkenauer (b0030) 1993; 33 Barcelona, Spain. Agustín-Blas, Salcedo-Sanz, Ortiz-García, Portilla-Figueras, Pérez-Bellido (b0010) 2009; 36 York, UK. (pp. 1–6). Salcedo-Sanz, Portilla-Figueras, Ortiz-García, Pérez-Bellido, Thraves, Fernandez-Anta (b0080) 2008; 8 El-Alfy (b0025) 2007; 30 Gil-Lopez, S., Del Ser, J., & Olabarrieta, I. (2009). A novel heuristic algorithm for multiuser detection in synchronous CDMA wireless sensor networks. In Geem (b0045) 2006; 38 Sandrasegaran, Prag (b0090) 1999; 17 Singh, Baghel (b0100) 2009; 13 Del Ser, J., Matinmikko, M., Gil-Lopez, S., Mustonen, M. (2010). A novel harmony search based spectrum allocation technique for cognitive radio networks. In Gil-Lopez, S., Del Ser, J., & Garcia-Padrones, L. (2009). Harmony search heuristics for quasi-asynchronous CDMA detection with M-PAM signalling. In Abuali, Schönefeld, Wainwright (b0005) 1994 Brown, Vroblefski (b0015) 2004; 17 Falkenauer (b0035) 1994 Krishnamachari, Wicker (b0070) 2003 Salcedo-Sanz (10.1016/j.eswa.2011.11.013_b0085) 2004; 34 Falkenauer (10.1016/j.eswa.2011.11.013_b0030) 1993; 33 Sandrasegaran (10.1016/j.eswa.2011.11.013_b0090) 1999; 17 Geem (10.1016/j.eswa.2011.11.013_b0050) 2001; 76 10.1016/j.eswa.2011.11.013_b0055 Agustín-Blas (10.1016/j.eswa.2011.11.013_b0010) 2009; 36 Geem (10.1016/j.eswa.2011.11.013_b0045) 2006; 38 Singh (10.1016/j.eswa.2011.11.013_b0100) 2009; 13 James (10.1016/j.eswa.2011.11.013_b0065) 2007; 30 El-Alfy (10.1016/j.eswa.2011.11.013_b0025) 2007; 30 10.1016/j.eswa.2011.11.013_b0060 Abuali (10.1016/j.eswa.2011.11.013_b0005) 1994 Krishnamachari (10.1016/j.eswa.2011.11.013_b0070) 2003 Forsati (10.1016/j.eswa.2011.11.013_b0040) 2008; 31 10.1016/j.eswa.2011.11.013_b0020 Menon (10.1016/j.eswa.2011.11.013_b0075) 2004; 34 Shen (10.1016/j.eswa.2011.11.013_b0095) 2008; 34 Falkenauer (10.1016/j.eswa.2011.11.013_b0035) 1994 Salcedo-Sanz (10.1016/j.eswa.2011.11.013_b0080) 2008; 8 Brown (10.1016/j.eswa.2011.11.013_b0015) 2004; 17 |
| References_xml | – year: 1994 ident: b0035 article-title: A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems, Evolutionary Computation – volume: 76 start-page: 60 year: 2001 end-page: 68 ident: b0050 article-title: A new heuristic optimization algorithm: Harmony search publication-title: Simulation – volume: 34 start-page: 900 year: 2008 end-page: 907 ident: b0095 article-title: Broadcast scheduling in wireless sensor networks using fuzzy Hopfield neural network publication-title: Expert Systems with Applications – volume: 8 start-page: 1486 year: 2008 end-page: 1497 ident: b0080 article-title: Optimal switch location in mobile communication networks using hybrid genetic algorithms publication-title: Applied Soft Computing – reference: Del Ser, J., Matinmikko, M., Gil-Lopez, S., Mustonen, M. (2010). A novel harmony search based spectrum allocation technique for cognitive radio networks. In: – volume: 36 start-page: 7234 year: 2009 end-page: 7241 ident: b0010 article-title: A hybrid grouping genetic algorithm for assigning students to preferred laboratory groups publication-title: Expert Systems with Applications – reference: . Barcelona, Spain. – volume: 17 start-page: 145 year: 1999 end-page: 166 ident: b0090 article-title: Planning point-to-multipoint rural radio access networks using expert systems publication-title: Expert Systems with Applications – reference: Gil-Lopez, S., Del Ser, J., & Olabarrieta, I. (2009). A novel heuristic algorithm for multiuser detection in synchronous CDMA wireless sensor networks. In: – volume: 31 start-page: 2505 year: 2008 end-page: 2519 ident: b0040 article-title: Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing publication-title: Computer Communications – volume: 34 start-page: 2343 year: 2004 end-page: 2353 ident: b0085 article-title: A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem publication-title: IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics – volume: 30 start-page: 2010 year: 2007 end-page: 2020 ident: b0025 article-title: Applications of genetic algorithms to optimal multilevel design of MPLS-based networks publication-title: Computer Communications – reference: (pp. 1–6). – volume: 33 start-page: 79 year: 1993 end-page: 102 ident: b0030 article-title: The grouping genetic algorithms – Widening the scope of the GAs publication-title: Belgian Journal of Operations Research, Statistics and Computer Science – volume: 34 start-page: 558 year: 2004 end-page: 565 ident: b0075 article-title: Assigning cells to switches in cellular networks by incorporating a pricing mechanism into simulated annealing publication-title: IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics – reference: . York, UK. – volume: 38 start-page: 259 year: 2006 end-page: 277 ident: b0045 article-title: Optimal cost design of water distribution networks using harmony search publication-title: Engineering Optimization – reference: Gil-Lopez, S., Del Ser, J., & Garcia-Padrones, L. (2009). Harmony search heuristics for quasi-asynchronous CDMA detection with M-PAM signalling. In: – year: 2003 ident: b0070 article-title: Base station location optimization in cellular wireless networks using heuristic search algorithms publication-title: Soft Computing in Communications – volume: 30 start-page: 2180 year: 2007 end-page: 2190 ident: b0065 article-title: A hybrid grouping genetic algorithm for the registration area planning problem publication-title: Computer Communications – start-page: 74 year: 1994 end-page: 81 ident: b0005 article-title: Terminal assignment in a communications network using genetic algorithms publication-title: Proceedings of 22nd Annual ACM Computer Science Conference – volume: 17 start-page: 589 year: 2004 end-page: 598 ident: b0015 article-title: A grouping genetic algorithm for the microcell sectorization problem publication-title: Engineering Applications of Artificial Intelligence – volume: 13 start-page: 95 year: 2009 end-page: 101 ident: b0100 article-title: A new grouping genetic algorithm approach to the multiple traveling salesperson problem publication-title: Soft Computing – year: 2003 ident: 10.1016/j.eswa.2011.11.013_b0070 article-title: Base station location optimization in cellular wireless networks using heuristic search algorithms – volume: 8 start-page: 1486 issue: 4 year: 2008 ident: 10.1016/j.eswa.2011.11.013_b0080 article-title: Optimal switch location in mobile communication networks using hybrid genetic algorithms publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2007.10.021 – volume: 34 start-page: 558 issue: 1 year: 2004 ident: 10.1016/j.eswa.2011.11.013_b0075 article-title: Assigning cells to switches in cellular networks by incorporating a pricing mechanism into simulated annealing publication-title: IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics doi: 10.1109/TSMCB.2003.817081 – volume: 34 start-page: 900 year: 2008 ident: 10.1016/j.eswa.2011.11.013_b0095 article-title: Broadcast scheduling in wireless sensor networks using fuzzy Hopfield neural network publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2006.10.024 – start-page: 74 year: 1994 ident: 10.1016/j.eswa.2011.11.013_b0005 article-title: Terminal assignment in a communications network using genetic algorithms – volume: 76 start-page: 60 issue: 2 year: 2001 ident: 10.1016/j.eswa.2011.11.013_b0050 article-title: A new heuristic optimization algorithm: Harmony search publication-title: Simulation doi: 10.1177/003754970107600201 – ident: 10.1016/j.eswa.2011.11.013_b0020 – volume: 13 start-page: 95 year: 2009 ident: 10.1016/j.eswa.2011.11.013_b0100 article-title: A new grouping genetic algorithm approach to the multiple traveling salesperson problem publication-title: Soft Computing doi: 10.1007/s00500-008-0312-1 – volume: 17 start-page: 589 issue: 6 year: 2004 ident: 10.1016/j.eswa.2011.11.013_b0015 article-title: A grouping genetic algorithm for the microcell sectorization problem publication-title: Engineering Applications of Artificial Intelligence doi: 10.1016/S0952-1976(04)00085-5 – volume: 38 start-page: 259 issue: 3 year: 2006 ident: 10.1016/j.eswa.2011.11.013_b0045 article-title: Optimal cost design of water distribution networks using harmony search publication-title: Engineering Optimization doi: 10.1080/03052150500467430 – ident: 10.1016/j.eswa.2011.11.013_b0060 – year: 1994 ident: 10.1016/j.eswa.2011.11.013_b0035 – volume: 34 start-page: 2343 issue: 6 year: 2004 ident: 10.1016/j.eswa.2011.11.013_b0085 article-title: A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem publication-title: IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics doi: 10.1109/TSMCB.2004.836471 – volume: 17 start-page: 145 issue: 3 year: 1999 ident: 10.1016/j.eswa.2011.11.013_b0090 article-title: Planning point-to-multipoint rural radio access networks using expert systems publication-title: Expert Systems with Applications doi: 10.1016/S0957-4174(99)00031-7 – volume: 30 start-page: 2010 year: 2007 ident: 10.1016/j.eswa.2011.11.013_b0025 article-title: Applications of genetic algorithms to optimal multilevel design of MPLS-based networks publication-title: Computer Communications doi: 10.1016/j.comcom.2007.03.005 – volume: 31 start-page: 2505 issue: 10 year: 2008 ident: 10.1016/j.eswa.2011.11.013_b0040 article-title: Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing publication-title: Computer Communications doi: 10.1016/j.comcom.2008.03.019 – volume: 36 start-page: 7234 year: 2009 ident: 10.1016/j.eswa.2011.11.013_b0010 article-title: A hybrid grouping genetic algorithm for assigning students to preferred laboratory groups publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2008.09.020 – volume: 33 start-page: 79 year: 1993 ident: 10.1016/j.eswa.2011.11.013_b0030 article-title: The grouping genetic algorithms – Widening the scope of the GAs publication-title: Belgian Journal of Operations Research, Statistics and Computer Science – ident: 10.1016/j.eswa.2011.11.013_b0055 – volume: 30 start-page: 2180 issue: 10 year: 2007 ident: 10.1016/j.eswa.2011.11.013_b0065 article-title: A hybrid grouping genetic algorithm for the registration area planning problem publication-title: Computer Communications doi: 10.1016/j.comcom.2007.04.018 |
| SSID | ssj0017007 |
| Score | 2.150875 |
| Snippet | In this paper we present a novel grouping harmony search algorithm for the Access Node Location Problem (ANLP) with different types of concentrators. The ANLP... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 5262 |
| SubjectTerms | Access node location problem Algorithms Computer simulation Concentrators Grouping genetic algorithms Grouping-based encoding Harmony search algorithm Hybrid algorithms Mathematical models Monte Carlo methods Networks Position (location) Searching |
| Title | A novel grouping harmony search algorithm for the multiple-type access node location problem |
| URI | https://dx.doi.org/10.1016/j.eswa.2011.11.013 https://www.proquest.com/docview/1010905895 https://www.proquest.com/docview/1701107890 |
| Volume | 39 |
| WOSCitedRecordID | wos000301155300061&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-6793 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017007 issn: 0957-4174 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWLQcuvBEtDxkJcYmM8nLsHFewBarVgkQq7QEpsh2nbBWS7W669Afww7FjO22KWJUDlygPO4k8Xybj8cx8ALz2KaGcpgTxhEUoLkuhPimcIo5xSXgUkbCkHdkEmc_pYpF-GY1-uVyYbUXqml5cpKv_Kmp1Tglbp87-g7j7m6oTal8JXW2V2NX2RoKfeHWzlZXX5WtoR4AuTq3m-J51cLDqpFkv2-8_-ghDF1SIOn8s6ygU1U0K6ek_XQcQyzsz8OPrIsmtLQXtkuSuLIf3oT7aV4GyjgVk4Kb9sKzQrFkZF_YlGxirhCwa9FUZrcMLBlxH722Qv3VV6JiPPsLF-RwJigNDy-PUr6llZGGGr-hSHFo9Le2hYRj5Q-cb98PpW7n5yUxNVl2W1WS4Dgtszz_nh8ezWZ5NF9mb1RnS3GN6jd4SsdwCeyHBKR2Dvcmn6eKoX40ivkm7d69vk69MnOD1x_7NwLn2q-_sl-w-uGsnHnBiAPMAjGT9ENxzpB7Q6vhH4NsEdviBDj_Q4gca_MAeP1DhByr8wAF-oMEP1PiBDj_Q4ucxOD6cZu8-IkvBgUSUJC0qhPBlSZQZXOCwCGgSJz4tJWdEkiiWEYsTjgsmZFymPMFMafciiWQiChELP8LREzCum1o-BZDzkKUsENTHIqY8oLEoBZFlWoZYBEmxDwI3brmw9ek1TUqVu0DE01yPda7HWk1cczXW-8Dr-6xMdZadrbETR27tS2M35gpKO_u9crLLlfLVK2qsls35RnfwU03MiXe0IdrE1vnmBzdo8wzcufxynoNxuz6XL8BtsW2Xm_VLC8zfxRC2-Q |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+novel+grouping+harmony+search+algorithm+for+the+multiple-type+access+node+location+problem&rft.jtitle=Expert+systems+with+applications&rft.au=Landa-Torres%2C+I&rft.au=Gil-Lopez%2C+S&rft.au=Salcedo-Sanz%2C+S&rft.au=Ser%2C+JDel&rft.date=2012-04-01&rft.issn=0957-4174&rft.volume=39&rft.issue=5&rft.spage=5262&rft.epage=5270&rft_id=info:doi/10.1016%2Fj.eswa.2011.11.013&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0957-4174&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0957-4174&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0957-4174&client=summon |