English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/164840
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: Which one works better when?

AuthorsLizarraga, Evelia; Blesa, Maria J.; Blum, Christian
Issue Date20-Apr-2017
PublisherSpringer
Citation17th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2017; LNCS 10197: 60- 74 (2017)
AbstractBoth, Construct, Merge, Solve and Adapt (CMSA) and Large Neighborhood Search (LNS), are hybrid algorithms that are based on iteratively solving sub-instances of the original problem instances, if possible, to optimality. This is done by reducing the search space of the tackled problem instance in algorithm-specific ways which differ from one technique to the other. In this paper we provide first experimental evidence for the intuition that, conditioned by the way in which the search space is reduced, LNS should generally work better than CMSA in the context of problems in which solutions are rather large, and the opposite is the case for problems in which solutions are rather small. The size of a solution is hereby measured by the number of components of which the solution is composed, in comparison to the total number of solution components. Experiments are conducted in the context of the multi-dimensional knapsack problem. © Springer International Publishing AG 2017.
URIhttp://hdl.handle.net/10261/164840
Identifiersdoi: 10.1007/978-3-319-55453-2_5
issn: 03029743
isbn: 978-331955452-5
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.