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

Banner header
61.690 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • EOLI - Enginyeria d'Organització i Logística Industrial
  • Articles de revista
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • EOLI - Enginyeria d'Organització i Logística Industrial
  • Articles de revista
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

An efficient discrete artificial bee colony algorithm for the blocking flow shop problem with total flowtime minimization

Thumbnail
View/Open
An efficient discrete ADBC algorithm for the blocking flow shop problem with total flow time minimization_accepted.pdf (308,6Kb)
 
10.1016/j.eswa.2015.03.026
 
  View Usage Statistics
  LA Referencia / Recolecta stats
Cita com:
hdl:2117/28350

Show full item record
Ribas Vila, ImmaculadaMés informacióMés informacióMés informació
Companys Pascual, RamónMés informació
Tort-Martorell Llabrés, XavierMés informacióMés informacióMés informació
Document typeArticle
Defense date2015-09-01
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
This paper presents a high performing Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with flow time criterion. To develop the proposed algorithm, we considered four strategies for the food source phase and two strategies for each of the three remaining phases (employed bees, onlookers and scouts). One of the strategies tested in the food source phase and one implemented in the employed bees phase are new. Both have been proved to be very effective for the problem at hand. The initialization scheme named HPF2(¿, µ) in particular, which is used to construct the initial food sources, is shown in the computational evaluation to be one of the main procedures that allow the DABC_RCT to obtain good solutions for this problem. To find the best configuration of the algorithm, we used design of experiments (DOE). This technique has been used extensively in the literature to calibrate the parameters of the algorithms but not to select its configuration. Comparing it with other algorithms proposed for this problem in the literature demonstrates the effectiveness and superiority of the DABC_RCT
CitationRibas, I.; Companys , R.; Tort-Martorell, J. An efficient discrete artificial bee colony algorithm for the blocking flow shop problem with total flowtime minimization. "Expert systems with applications", 01 Setembre 2015, vol. 42, núm. 15-16, p. 6155-6167. 
URIhttp://hdl.handle.net/2117/28350
DOI10.1016/j.eswa.2015.03.026
ISSN0957-4174
Publisher versionhttp://www.sciencedirect.com/science/article/pii/S0957417415002201
Collections
  • EOLI - Enginyeria d'Organització i Logística Industrial - Articles de revista [126]
  • Departament d'Organització d'Empreses - Articles de revista [804]
  • ADBD - Anàlisi de Dades Complexes per a les Decisions Empresarials - Articles de revista [112]
  • Departament d'Estadística i Investigació Operativa - Articles de revista [684]
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
An efficient di ... minimization_accepted.pdf308,6KbPDFView/Open

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
  • Privacy Settings
  • Inici de la pàgina