The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling
Abstract
This paper shows how the performance of evolutionary multiobjective optimization (EMO) algorithms can be improved by hybridization with local search. The main positive effect of the hybridization is the improvement in the convergence speed to the Pareto front. On the other hand, the main negative effect is the increase in the computation time per generation. Thus, the number of generations is decreased when the available computation time is limited. As a result, the global search ability of EMO algorithms is not fully utilized. These positive and negative effects are examined by computational experiments on multiobjective permutation flowshop scheduling problems. Results of our computational experiments clearly show the importance of striking a balance between genetic search and local search. In this paper, we first modify our former multiobjective genetic local search (MOGLS) algorithm by choosing only good individuals as initial solutions for local search and assigning an appropriate local search direction to each initial solution. Next, we demonstrate the importance of striking a balance between genetic search and local search through computational experiments. Then we compare the modified MOGLS with recently developed EMO algorithms: the strength Pareto evolutionary algorithm and revised nondominated sorting genetic algorithm. Finally, we demonstrate that a local search can be easily combined with those EMO algorithms for designing multiobjective memetic algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 14,918
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
Evolutionary Algorithms for Solving Multi-Objective Problems
(2007) · Genetic and Evolutionary Computation Series · doi:10.1007/978-0-387-36797-2 · Cited by 5,686
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
Schaffer, J. D. (1985) · international conference on Genetic algorithms · Cited by 3,326
Evolutionary Algorithms for Solving Multi-Objective Problems
Coello Coello, C. A., Van Veldhuizen, D. A., & Lamont, G. B. (2002) · Genetic Algorithms and Evolutionary Computation · doi:10.1007/978-1-4757-5184-0 · Cited by 2,663
A niched Pareto genetic algorithm for multiobjective optimization
Horn, J., Nafpliotis, N., & Goldberg, D. E. (2002) · Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence · doi:10.1109/icec.1994.350037 · Cited by 2,433
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Knowles, J. D., & Corne, D. W. (2000) · Evolutionary Computation · doi:10.1162/106365600568167 · Cited by 2,286
Cited by
Multi-objective optimization using genetic algorithms: A tutorial
Konak, A., Coit, D. W., & Smith, A. E. (2006) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2005.11.018 · Cited by 3,440
Symbiotic Organisms Search: A new metaheuristic optimization algorithm
Cheng, M.-Y., & Prayogo, D. (2014) · Computers & Structures · doi:10.1016/j.compstruc.2014.03.007 · Cited by 1,575
Exploration and exploitation in evolutionary algorithms: A survey
Črepinšek, M., Liu, S.-H., & Mernik, M. (2013) · ACM Computing Surveys · doi:10.1145/2480741.2480752 · Cited by 1,298
Backtracking Search Optimization Algorithm for numerical optimization problems
Civicioglu, P. (2013) · Applied Mathematics and Computation · doi:10.1016/j.amc.2013.02.017 · Cited by 1,018
A Hybrid of Genetic Algorithm and Particle Swarm Optimization for Recurrent Network Design
Juang, C.-F. (2004) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2003.818557 · Cited by 964
Evolutionary many-objective optimization: A short review
Ishibuchi, H., Tsukamoto, N., & Nojima, Y. (2008) · 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) · doi:10.1109/cec.2008.4631121 · Cited by 914
Self-citationA Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA
Bandyopadhyay, S., Saha, S., Maulik, U., & Deb, K. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.900837 · Cited by 852
RM-MEDA: A Regularity Model-Based Multiobjective Estimation of Distribution Algorithm
Zhang, Q., Zhou, A., & Jin, Y. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.894202 · Cited by 827
Expensive Multiobjective Optimization by MOEA/D With Gaussian Process Model
Zhang, Q., Liu, W., Tsang, E., & Virginas, B. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2033671 · Cited by 746
Memetic algorithms and memetic computing optimization: A literature review
Neri, F., & Cotta, C. (2012) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.11.003 · Cited by 680
The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances
Zhang, Q., Liu, W., & Li, H. (2009) · 2009 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2009.4982949 · Cited by 624
Accelerating Differential Evolution Using an Adaptive Local Search
Noman, N., & Iba, H. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.895272 · Cited by 610
Classification of adaptive memetic algorithms: a comparative study
Ong, Y.-S., Lim, M.-H., Zhu, N., & Wong, K.-W. (2006) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2005.856143 · Cited by 514
A Multi-Facet Survey on Memetic Computation
Chen, X., Ong, Y.-S., Lim, M.-H., & Tan, K. C. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2132725 · Cited by 512
An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling
Liu, B., Wang, L., & Jin, Y.-H. (2007) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2006.883272 · Cited by 480
Tay, J. C., & Ho, N. B. (2008) · Computers & Industrial Engineering · doi:10.1016/j.cie.2007.08.008 · Cited by 471
Ensemble of Constraint Handling Techniques
Mallipeddi, R., & Suganthan, P. N. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2033582 · Cited by 467
Wrapper–Filter Feature Selection Algorithm Using a Memetic Framework
Zhu, Z., Ong, Y.-S., & Dash, M. (2007) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2006.883267 · Cited by 443
Memetic Computation—Past, Present & Future [Research Frontier
Ong, Y.-S., Lim, M., & Chen, X. (2010) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2010.936309 · Cited by 419
Localized Weighted Sum Method for Many-Objective Optimization
Wang, R., Zhou, Z., Ishibuchi, H., Liao, T., & Zhang, T. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2611642 · Cited by 362
Self-citationQuality Evaluation of Solution Sets in Multiobjective Optimisation: A Survey
Li, M., & Yao, X. (2020) · ACM Computing Surveys · doi:10.1145/3300148 · Cited by 342
Fog Computing for Energy-Aware Load Balancing and Scheduling in Smart Factory
Wan, J., Chen, B., Wang, S., Xia, M., Li, D., & Liu, C. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2818932 · Cited by 322
A novel nature-inspired algorithm for optimization: Virus colony search
Li, M. D., Zhao, H., Weng, X. W., & Han, T. (2016) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2015.11.004 · Cited by 300
Behavior of Multiobjective Evolutionary Algorithms on Many-Objective Knapsack Problems
Ishibuchi, H., Akedo, N., & Nojima, Y. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2315442 · Cited by 288
Self-citationDecomposition-Based Algorithms Using Pareto Adaptive Scalarizing Methods
Wang, R., Zhang, Q., & Zhang, T. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2521175 · Cited by 283
Methods for multi-objective optimization: An analysis
Giagkiozis, I., & Fleming, P. J. (2015) · Information Sciences · doi:10.1016/j.ins.2014.08.071 · Cited by 275
Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms
Yuan, Y., & Xu, H. (2015) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2013.2274517 · Cited by 270
Abdel-Basset, M., Manogaran, G., El-Shahat, D., & Mirjalili, S. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2018.03.020 · Cited by 262
Retracted
Metadata
- Authors
- Ishibuchi, H., Yoshida, T., & Murata, T.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2003-04
- Volume
- 7
- Issue
- 2
- Pages
- 204-223
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2122510010
- Cited by
- 773
- References
- 34
- FWCI
- 85.59
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.