A Binary Cuckoo Search Big Data Algorithm Applied to Large-Scale Crew Scheduling Problems
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 applyin...
        Saved in:
      
    
          | Published in | Complexity (New York, N.Y.) Vol. 2018; no. 2018; pp. 1 - 15 | 
|---|---|
| Main Authors | , , , , | 
| Format | Journal Article | 
| Language | English | 
| Published | 
        Cairo, Egypt
          Hindawi Publishing Corporation
    
        01.01.2018
     Hindawi John Wiley & Sons, Inc Wiley  | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 1076-2787 1099-0526 1099-0526  | 
| DOI | 10.1155/2018/8395193 | 
Cover
| Summary: | 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. | 
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14  | 
| ISSN: | 1076-2787 1099-0526 1099-0526  | 
| DOI: | 10.1155/2018/8395193 |