LIBRARIES
 

UAI DIGITAL REPOSITORY

Bibliotecas Universidad Adolfo Ibáñez

Digitally preserving the academic heritage generated from the Universidad Adolfo Ibáñez

  • Inicio
  • Buscar
  • Documento
View Item 
  •   Home
  • Académica
  • Investigación
  • View Item
  •   Home
  • Académica
  • Investigación
  • View Item

Pedro Ibáñez Ojeda Fund

Documents created from his political, academic and business work.

View more

Scientific and academic production

Magazine articles, books, patents, curatorships, among others.

View more

Thesis

Thesis and degree works.

View more

Jorge Edwards Fund

Books, awards, photographs and letters donated by the writer to the university.

View more

Institutional and Patrimonial Documents

Minutes, speeches, working documents, photographs, memories, newsletters.

View more
JavaScript is disabled for your browser. Some features of this site may not work without it.
Thumbnail
Share
Metadata
Show full item record

A binary cuckoo search big data algorithm applied to large-scale crew scheduling problems.

Content Type
  • Artículo Scopus
 Faculty
  • Facultad de Ingeniería y Ciencias
 Investigador(a) UAI
  • Altimiras, Francisco
 DOI
  • 10.1155/2018/8395193
 Revista
  • Complexity
 Año registro UAI
  • 2018
Abstract
The progress of metaheuristic techniques, big data, and the Internet of things generates opportunities to performance improvements in complex industrial systems. This article explores the application of Big Data techniques in the implementation of metaheuristic algorithms with the purpose of applying it to decision-making in industrial processes. This exploration intends to evaluate the quality of the results and convergence times of the algorithm under different conditions in the number of solutions and the processing capacity. Under what conditions can we obtain acceptable results in an adequate number of iterations? In this article, we propose a cuckoo search binary algorithm using the MapReduce programming paradigm implemented in the Apache Spark tool. The algorithm is applied to different instances of the crew scheduling problem. The experiments show that the conditions for obtaining suitable results and iterations are specific to each problem and are not always satisfactory.

Browse

All of DSpace
Communities & CollectionsBy Issue DateAuthorsTitlesSubjectsType
This Collection
By Issue DateAuthorsTitlesSubjectsType

My Account

Login
  • FAQ's
  • Admin
  • FAQ's
  • language
    • Español
    • Inglés
    • Portugués
  • Contact Us
  •  
  •  
  •  
Submit Document
Pensar con LibertadUniversidad Acreditada
 

 

       

Go to Website

UAI LIBRARIES


Services
Information Resources
Investigation


Acceder