Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

57.066 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Articles de revista
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Articles de revista
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Variable neighbourhood search for the variable sized bin packing problem

Thumbnail
View/Open
Variable neighbourhood....pdf (255,9Kb) (Restricted access)   Request copy 

Què és aquest botó?

Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:

  • Disposem del correu electrònic de l'autor
  • El document té una mida inferior a 20 Mb
  • Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Share:
 
 
10.1016/j.cor.2011.07.003
 
  View Usage Statistics
Cita com:
hdl:2117/13560

Show full item record
Hemmelmayr, Vera C.
Schmid, Verena
Blum, Christian
Document typeArticle
Defense date2012-05
Rights accessRestricted access - publisher's policy
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
Abstract
The variable sized bin packing problem is a generalisation of the one-dimensional bin packing problem. Given is a set of weighted items, which must be packed into a minimum-cost set of bins of variable sizes and costs. This problem has practical applications, for example, in packing, transportation planning, and cutting. In this work we propose a variable neighbourhood search metaheuristic for tackling the variable sized bin packing problem. The presented algorithm can be seen as a hybrid metaheuristic, because it makes use of lower bounding techniques and dynamic programming in various algorithmic components. An extensive experimentation on a diverse set of problem instances shows that the proposed algorithm is very competitive with current state-of-the-art approaches.
CitationHemmelmayr, V.; Schmid, V.; Blum, C. Variable neighbourhood search for the variable sized bin packing problem. "Computers & operations research", Maig 2012, vol. 39, núm. 5, p. 1097-1108. 
URIhttp://hdl.handle.net/2117/13560
DOI10.1016/j.cor.2011.07.003
ISSN0305-0548
Publisher versionhttp://www.sciencedirect.com/science/article/pii/S0305054811001961
Collections
  • Departament de Ciències de la Computació - Articles de revista [909]
  • ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals - Articles de revista [245]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
Variable neighbourhood....pdfBlocked255,9KbPDFRestricted access

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Inici de la pàgina