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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Expert systems with applications Jg. 39; H. 5; S. 5262 - 5270
Hauptverfasser:	Landa-Torres, I., Gil-Lopez, S., Salcedo-Sanz, S., Ser, J. Del, Portilla-Figueras, J.A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.04.2012
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!