
Evolutionary Computation in Scheduling
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
This book provides insight into the use of evolutionary computations (EC) in real-world scheduling, showing readers how to choose a specific evolutionary computation and how to validate the results using metrics and statistics. It offers a spectrum of real-world optimization problems, including applications of EC in industry and service organizations such as healthcare scheduling, aircraft industry, school timetabling, manufacturing systems, and transportation scheduling in the supply chain. It also features problems with different degrees of complexity, practical requirements, user constraints, and MOEC solution approaches.
Evolutionary Computation in Scheduling starts with a chapter on scientometric analysis to analyze scientific literature in evolutionary computation in scheduling. It then examines the role and impacts of ant colony optimization (ACO) in job shop scheduling problems, before presenting the application of the ACO algorithm in healthcare scheduling. Other chapters explore task scheduling in heterogeneous computing systems and truck scheduling using swarm intelligence, application of sub-population scheduling algorithm in multi-population evolutionary dynamic optimization, task scheduling in cloud environments, scheduling of robotic disassembly in remanufacturing using the bees algorithm, and more. This book:
* Provides a representative sampling of real-world problems currently being tackled by practitioners
* Examines a variety of single-, multi-, and many-objective problems that have been solved using evolutionary computations, including evolutionary algorithms and swarm intelligence
* Consists of four main parts: Introduction to Scheduling Problems, Computational Issues in Scheduling Problems, Evolutionary Computation, and Evolutionary Computations for Scheduling Problems
Evolutionary Computation in Scheduling is ideal for engineers in industries, research scholars, advanced undergraduates and graduate students, and faculty teaching and conducting research in Operations Research and Industrial Engineering.
More details
Other editions
Additional editions


Persons
AMIR H. GANDOMI, PHD, is Professor of Data Science at University of Technology Sydney, Australia.
ALI EMROUZNEJAD, PHD, is Professor and Chair of Business Analytics at Aston University, UK.
MO M. JAMSHIDI, PHD, is Lutcher Brown Endowed Chair and Professor of Electrical and Computer Engineering at the University of Texas at San Antonio, USA.
KALYANMOY DEB, PHD, is Koenig Endowed Chair and Professor of Electrical and Computer Engineering at Michigan State University, USA.
IMAN RAHIMI, PHD, is a member of the Young Researchers and Elite Club, Isfahan (Khorasgan) Branch at Islamic Azad University, Iran.
Content
List of Contributors vii
Editors' Biographies xi
Preface xv
Acknowledgments xvii
1 Evolutionary Computation in Scheduling: A Scientometric Analysis 1
Amir H. Gandomi, Ali Emrouznejad, and Iman Rahimi
2 Role and Impacts of Ant Colony Optimization in Job Shop Scheduling Problems: A Detailed Analysis 11
P. Deepalakshmi and K. Shankar
3 Advanced Ant Colony Optimization in Healthcare Scheduling 37
Reza Behmanesh, Iman Rahimi, Mostafa Zandieh, and Amir H. Gandomi
4 Task Scheduling in Heterogeneous Computing Systems Using Swarm Intelligence 73
S. Sarathambekai and K. Umamaheswari
5 Computationally Efficient Scheduling Schemes for Multiple Antenna Systems Using Evolutionary Algorithms and Swarm Optimization 105
Prabina Pattanayak and Preetam Kumar
6 An Efficient Modified Red Deer Algorithm to Solve a Truck Scheduling Problem Considering Time Windows and Deadline for Trucks' Departure 137
Amir Mohammad Fathollahi-Fard, Abbas Ahmadi, and Mohsen S. Sajadieh
7 Application of Sub-Population Scheduling Algorithm in Multi-Population Evolutionary Dynamic Optimization 169
Javidan Kazemi Kordestani and Mohammad Reza Meybodi
8 Task Scheduling in Cloud Environments: A Survey of Population-Based Evolutionary Algorithms 213
Fahimeh Ramezani, Mohsen Naderpour, Javid Taheri, Jack Romanous, and Albert Y. Zomaya
9 Scheduling of Robotic Disassembly in Remanufacturing Using Bees Algorithms 257
Jiayi Liu, Wenjun Xu, Zude Zhou, and Duc Truong Pham
10 A Modified Fireworks Algorithm to Solve the Heat and Power Generation Scheduling Problem in Power System Studies 299
Mohammad Sadegh Javadi, Ali Esmaeel Nezhad, Seyed-Ehsan Razavi, Abdollah Ahmadi, and João P.S. Catalão
Index 327
1
Evolutionary Computation in Scheduling: A Scientometric Analysis
Amir H. Gandomi1, Ali Emrouznejad2, and Iman Rahimi3
1 Faculty of Engineering and IT, University of Technology Sydney, Ultimo, Australia
2 Aston Business School, Aston University, Birmingham, UK
3 Young Researchers and Elite Club, Isfahan (Khorasgan) Branch, Islamic Azad University, Isfahan, Iran
1.1 Introduction
Evolutionary computation (EC) is known as a powerful tool for global optimization-inspired nature. Technically, EC is also known as a family of population-based algorithms which could be addressed as metaheuristic or stochastic optimization approaches. The term "stochastic" is used because of the nature of these algorithms, such that a primary set of potential solutions (initial population) is produced and updated, iteratively. Another generation is made by eliminating the less desired solutions stochastically. Increasing the fitness function of the algorithm resulted from evolving the population. A metaheuristic term refers to the fact that these algorithms are defined as higher-level procedures or heuristics considered to discover, produce, or choose a heuristic which is an adequately good solution for an optimization problem [1, 2]. Applications of metaheuristics can be found in the literature, largely [3-9]. Swarm intelligence algorithms are also a family of EC, based on a population of simple agents which are interacting with each other in an environment. The inspiration for these algorithms often comes from nature, while these algorithms behave stochastically and the agents possess a high level of intelligence as a colony. The most common used algorithms reported in literature are: particle swarm optimization, ant colony optimization, the Bees algorithm, and the artificial fish swarm algorithm [10-15].
Scheduling and planning problems are generally complex, large-scale, challenging issues, and involve several constraints [16-19]. To find a real solution, most real-world problems must be formulated as discrete or mixed-variable optimization problems [16, 20]. Moreover, finding efficient and lower-cost procedures for frequent use of the system is crucially important. Although several solutions are suggested to solve the problems mentioned above, there is still a severe need for more cost-effective methods. As a result of their complexity, real-world scheduling problems are challenging to solve using derivative-based and local optimization algorithms. A possible solution to cope with this limitation is to use global optimization algorithms, such as EC techniques [21]. Lately, EC and its branches have been used to solve large, complex real-world problems which cannot be solved using classical methods [22-24]. Another critical problem is that several aspects can be considered to optimize systems simultaneously, such as time, cost, quality, risk, and efficiency. Therefore, several objectives should usually be considered for optimizing a real-world scheduling problem.
This is while there are usually conflicts between the considered objectives, such as cost-quality, cost-efficiency, and quality-cost-time. In this case, the multi-objective optimization concept offers key advantages over the traditional mathematical algorithms. In particular, evolutionary multi-objective computations (EMC) is known as a reliable way to handle these problems in the industrial domain [22,25-27].
With the advent of computation intelligence, there is renewed interest in solving scheduling problems using evolutionary computational techniques. The spectrum of real-world optimization problems dealt with the application of EC in industry and service organizations, such as healthcare scheduling, aircraft industry, school timetabling, manufacturing systems, and transportation scheduling in the supply chain. This chapter gives a general analysis of many of the current developments in the growing field of evolutionary scheduling using scientometrics and charts.
1.2 Analysis
1.2.1 Data Collection
For this scientific literature review, we use a scientometric mapping technique to find the most common keywords used among research articles. First, we searched for the topics "evolutionary scheduling," "metaheuristic scheduling," and "swarm intelligence scheduling" in the SCOPUS database between 2000 and the present. We identified 1107 scientific articles. Figure 1.1 presents the distribution of papers from 2000 (articles in the area of the multi-objective vs. total number of documents).
Most of the analysis in this part has been carried out by VOSviewer, which is known as a powerful tool for scientometric analysis [28-30]).
Figure 1.1 Number of documents on "Evolutionary Computation in Scheduling" (multi-objective in total).
1.3 Scientometric Analysis
1.3.1 Keywords Analysis
Figure 1.2 shows a cognitive map where the node size is comparable with a number of documents in the specified scientific discipline. Links among disciplines are presented by a line whose thickness is proportional to the extent to which two subjects are employed in one paper.
Top keywords and the number of occurrences found in the analysis are presented in Table 1.1.
1.3.2 An Analysis on Countries/Organizations
Figure 1.3 presents an organization ranking indicating the top 10 organizations which have the most contribution in the field. As is observed from Figure 1.3, the Huazhong University of Science and Technology is the most active organization in this area with 107 published documents, the Ministry of Education China and Tsinghua University are in second and third places, respectively.
Figure 1.4 illustrates the ranking of countries by number of documents. As shown, China, with almost 1100 published articles, possesses the first rank, followed by India, United States, Iran, respectively.
Figure 1.2 Cognitive map (keyword analysis considering co-occurrences).
Table 1.1 Top 10 keywords.
No. Keyword Occurrences 1 Scheduling 1185 2 Optimization 840 3 Evolutionary algorithms 698 4 Scheduling algorithms 345 5 Genetic algorithms 335 6 Algorithms 321 7 Particle swarm optimization 256 8 Problem solving 248 9 Heuristic algorithms 224 10 Job shop scheduling 2081.3.3 Co-Author Analysis
In Figure 1.5, the analysis of co-authors and networks shows the robust and fruitful connections among collaborating scholars. The links across the networks show channels of knowledge, and networks which highlight the scientific communities engaged in research on the EC in scheduling.
Figure 1.3 Top 10 organizations ranking by number of documents.
Figure 1.4 Ranking of countries by number of documents.
Figure 1.5 The scientific community (co-author) working on EC in scheduling.
Figure 1.6 Bibliographic coupling (title).
1.3.4 Journal Network Analysis
Figures 1.6 and 1.7 show bibliographic coupling and a density map of the active sources (journals) of EC in scheduling, respectively. Figure 1.6 shows the journals aggregated by network visualization. For Figure 1.6, a bibliographic coupling analysis for sources has been used. Considering a minimum number of one document of a source, a total of 585 sources have been found. The most frequent active journals are Applied Soft Computing, Computers and Industrial Engineering, International Journal of Advanced Manufacturing Technology, European Journal of Operational Research, and International Journal of Production Research. The colors/shadings in Figure 1.6 represent clusters, indicating five clusters for all the items.
In Figure 1.7, the color/shading of each node in the map is related to the density of the nodes at the point. The shading ranges from high density of journals (Applied Soft Computing) to low density (e.g. Neurocomputing).
1.3.5 Co-Citation Analysis
Figure 1.8 displays the co-citation analysis of cited authors (first author only) who have a minimum of one citation for each author, resulting in 28 203 authors with strength co-citation links. In Figure 1.8, the full...
System requirements
File format: ePUB
Copy protection: Adobe-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Install the free reader Adobe Digital Editions prior to download (see eBook Help).
- Tablet/smartphone (Android; iOS): Install the free app Adobe Digital Editions or the app PocketBook before downloading (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (not Kindle).
The file format ePub works well for novels and non-fiction books – i.e., „flowing” text without complex layout. On an e-reader or smartphone, line and page breaks automatically adjust to fit the small displays.
This eBook uses Adobe-DRM, a „hard” copy protection. If the necessary requirements are not met, unfortunately you will not be able to open the eBook. You will therefore need to prepare your reading hardware before downloading.
Please note: We strongly recommend that you authorise using your personal Adobe ID after installation of any reading software.
For more information, see our ebook Help page.