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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Expert systems with applications Ročník 39; číslo 5; s. 5262 - 5270
Hlavní autori:	Landa-Torres, I., Gil-Lopez, S., Salcedo-Sanz, S., Ser, J. Del, Portilla-Figueras, J.A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.04.2012
Predmet:	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 Hybrid algorithms Grouping genetic algorithms Grouping-based encoding Access node location problem Harmony search algorithm
ISSN:	0957-4174, 1873-6793
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!