Show simple item record

dc.contributor.authorRodríguez, Francisco J.
dc.contributor.authorBlum, Christian
dc.contributor.authorLozano, Manuel
dc.contributor.authorGarcía Martínez, Carlos
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2012-08-28T10:04:07Z
dc.date.created2012
dc.date.issued2012
dc.identifier.citationRodríguez, F. [et al.]. Iterated greedy algorithms for the maximal covering location problem. "Lecture notes in computer science", 2012, vol. 7245, p. 172-181.
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/2117/16393
dc.description.abstractThe problem of allocating a set of facilities in order to maximise the sum of the demands of the covered clients is known as the maximal covering location problem. In this work we tackle this problem by means of iterated greedy algorithms. These algorithms iteratively refine a solution by partial destruction and reconstruction, using a greedy constructive procedure. Iterated greedy algorithms have been applied successfully to solve a considerable number of problems. With the aim of providing additional results and insights along this line of research, this paper proposes two new iterated greedy algorithms that incorporate two innovative components: a population of solutions optimised in parallel by the iterated greedy algorithm, and an improvement procedure that explores a large neighbourhood by means of an exact solver. The benefits of the proposal in comparison to a recently proposed decomposition heuristic and a standalone exact solver are experimentally shown.
dc.format.extent10 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Sistemes experts
dc.subject.lcshIterated greedy algorithm
dc.subject.lcshLarge neighbourhood search
dc.subject.otherMaximal covering location problem
dc.titleIterated greedy algorithms for the maximal covering location problem
dc.typeArticle
dc.subject.lemacAlgorismes -- Informàtica
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.identifier.doi10.1007/978-3-642-29124-1_15
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://rd.springer.com/chapter/10.1007/978-3-642-29124-1_15
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac10363564
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
local.citation.authorRodríguez, F.; Blum, C.; Lozano, M.; García, C.
local.citation.publicationNameLecture notes in computer science
local.citation.volume7245
local.citation.startingPage172
local.citation.endingPage181


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder