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

Full description

Saved in:

Bibliographic Details
Published in:	Expert systems with applications Vol. 39; no. 5; pp. 5262 - 5270
Main Authors:	Landa-Torres, I., Gil-Lopez, S., Salcedo-Sanz, S., Ser, J. Del, Portilla-Figueras, J.A.
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.04.2012
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!