Journal ArticleDOI
A genetic algorithm for flowshop sequencing
TLDR
A Genetic Algorithm is developed for finding (approximately) the minimum makespan of the n-job, m-machine permutation flowshop sequencing problem and the performance of the algorithm is compared with that of a naive Neighbourhood Search technique and with a proven Simulated Annealing algorithm.About:
This article is published in Computers & Operations Research.The article was published on 1995-01-01. It has received 849 citations till now. The article focuses on the topics: Job shop scheduling & Simulated annealing.read more
Citations
More filters
Journal ArticleDOI
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Rubén Ruiz,Thomas Stützle +1 more
TL;DR: This work presents a new iterated greedy algorithm that applies two phases iteratively, named destruction, were some jobs are eliminated from the incumbent solution, and construction, where the eliminated jobs are reinserted into the sequence using the well known NEH construction heuristic.
Journal ArticleDOI
Metaheuristics: A bibliography
Ibrahim H. Osman,Gilbert Laporte +1 more
TL;DR: This bibliography provides a classification of a comprehensive list of 1380 references on the theory and application of metaheuristics that have had widespread successes in attacking a variety of difficult combinatorial optimization problems that arise in many practical areas.
Journal ArticleDOI
Many-Objective Evolutionary Algorithms: A Survey
TL;DR: A survey of MaOEAs is reported and seven classes of many-objective evolutionary algorithms proposed are categorized into seven classes: relaxed dominance based, diversity-based, aggregation- based, indicator-Based, reference set based, preference-based and dimensionality reduction approaches.
Proceedings Article
Genetic CNN
Lingxi Xie,Alan L. Yuille +1 more
TL;DR: Zhang et al. as mentioned in this paper proposed an encoding method to represent each network structure in a fixed-length binary string, which is initialized by generating a set of randomized individuals and defined standard genetic operations, e.g., selection, mutation and crossover, to generate competitive individuals and eliminate weak ones.
Journal ArticleDOI
A comprehensive review and evaluation of permutation flowshop heuristics
Rubén Ruiz,Concepción Maroto +1 more
TL;DR: This work presents a comparison of 25 methods, ranging from the classical Johnson's algorithm or dispatching rules to the most recent metaheuristics, including tabu search, simulated annealing, genetic algorithms, iterated local search and hybrid techniques, for the well-known permutation flowshop problem with the makespan criterion.
References
More filters
Book
Genetic algorithms in search, optimization, and machine learning
TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Genetic algorithms in search, optimization and machine learning
TL;DR: This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.