Abstract
We propose a hybrid algorithm for finding a set of nondominated solutions of a multi objective optimization problem. In the proposed algorithm, a local search procedure is applied to each solution (i.e., each individual) generated by genetic operations. Our algorithm uses a weighted sum of multiple objectives as a fitness function. The fitness function is utilized when a pair of parent solutions are selected for generating a new solution by crossover and mutation operations. A local search procedure is applied to the new solution to maximize its fitness value. One characteristic feature of our algorithm is to randomly specify weight values whenever a pair of parent solutions are selected. That is, each selection (i.e., the selection of two parent solutions) is performed by a different weight vector. Another characteristic feature of our algorithm is not to examine all neighborhood solutions of a current solution in the local search procedure. Only a small number of neighborhood solutions are examined to prevent the local search procedure from spending almost all available computation time in our algorithm. High performance of our algorithm is demonstrated by applying it to multi objective flowshop scheduling problems.
Keywords
Mathematical optimizationCrossoverLocal search (optimization)Fitness functionComputationGenetic algorithmAlgorithmSelection (genetic algorithm)Tournament selectionMathematicsComputer scienceJob shop schedulingSet (abstract data type)Scheduling (production processes)Artificial intelligenceSchedule
Affiliated Institutions
Related Publications
Performance evaluation of genetic algorithms for flowshop scheduling problems
The aim of this paper is to evaluate the performance of genetic algorithms for the flowshop scheduling problem with an objective of minimizing the makespan. First we examine var...
Genetic Algorithms in Search, Optimization and Machine Learning
David Goldberg's Genetic Algorithms in Search, Optimization and Machine Learning is by far the bestselling introduction to genetic algorithms. Goldberg is one of the preeminent ...
A modified particle swarm optimizer
Evolutionary computation techniques, genetic algorithms, evolutionary strategies and genetic programming are motivated by the evolution of nature. A population of individuals, w...
Handbook of Genetic Algorithms
This book sets out to explain what genetic algorithms are and how they can be used to solve real-world problems. The first objective is tackled by the editor, Lawrence Davis. Th...
Empirical Problems of the Hierarchical Likelihood Ratio Test for Model Selection
Advocates of maximum likelihood (ML) approaches to phylogenetics commonly cite as one of their primary advantages the use of objective statistical criteria for model selection. ...
Publication Info
- Year
- 1998
- Type
- article
- Volume
- 28
- Issue
- 3
- Pages
- 392-403
- Citations
- 1005
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1005
OpenAlex
75
Influential
793
CrossRef
Cite This
Hisao Ishibuchi,
Tadahiko Murata
(1998).
A multi-objective genetic local search algorithm and its application to flowshop scheduling.
IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)
, 28
(3)
, 392-403.
https://doi.org/10.1109/5326.704576
Identifiers
- DOI
- 10.1109/5326.704576