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
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
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
Schaffer, J. D. (1985) · international conference on Genetic algorithms · Cited by 2,654
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
Brucker, P. (2004) · Springer eBooks · doi:10.1007/978-3-540-24804-0 · Cited by 2,064
GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION
Fonseca, C. M., & Fleming, P. J. (1993) · Cited by 2,056
A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques
Coello Coello, C. A. (1999) · Knowledge and Information Systems · doi:10.1007/bf03325101 · Cited by 1,367
Knowles, J., & Corne, D. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.781913 · Cited by 1,278
(2000) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(00)90183-4 · Cited by 1,263
Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art
Veldhuizen, D. A. V., & Lamont, G. B. (2000) · Evolutionary Computation · doi:10.1162/106365600568158 · Cited by 1,201
A multi-objective genetic local search algorithm and its application to flowshop scheduling
Ishibuchi, H., & Murata, T. (1998) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/5326.704576 · Cited by 1,019
Self-citationSome efficient heuristic methods for the flow shop sequencing problem
Taillard, É. D. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90090-x · Cited by 869
Czyzżak, P., & Jaszkiewicz, A. (1998) · Journal of Multi‐Criteria Decision Analysis · doi:10.1002/(sici)1099-1360(199801)7:1<34::aid-mcda161>3.0.co;2-6 · Cited by 793
Simulated annealing for permutation flow-shop scheduling
Osman, I., & Potts, C. (1989) · Omega · doi:10.1016/0305-0483(89)90059-5 · Cited by 614
On metrics for comparing nondominated sets
Knowles, J., & Corne, D. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1007013 · Cited by 560
Genetic local search for multi-objective combinatorial optimization
Jaszkiewicz, A. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(01)00104-7 · Cited by 548
Memetic algorithms: a short introduction
Moscato, P. (1999) · McGraw-Hill Ltd., UK eBooks · Cited by 455
MOSA method: a tool for solving multiobjective combinatorial optimization problems
Ulungu, E. L., Teghem, J., Fortemps, P. H., & Tuyttens, D. (1999) · Journal of Multi-Criteria Decision Analysis · doi:10.1002/(sici)1099-1360(199907)8:4<221::aid-mcda247>3.0.co;2-o · Cited by 385
M-PAES: a memetic algorithm for multiobjective optimization
Knowles, J. D., & Corne, D. W. (2002) · Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) · doi:10.1109/cec.2000.870313 · Cited by 359
Adaptive Global Optimization with Local Search
Hart, W. E. (1994) · Cited by 296
Evolutionary algorithms and gradient search: similarities and differences
Salomon, R. (1998) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.728207 · Cited by 278
Multiobjective Scheduling by Genetic Algorithms
Bagchi, T. P. (1999) · Springer eBooks · doi:10.1007/978-1-4615-5237-6 · Cited by 266
Genetic local search for the TSP: new results
Merz, P., & Freisleben, B. (2002) · IEEE International Conference on Evolutionary Computation (ICEC) · doi:10.1109/icec.1997.592288 · Cited by 236
A Hybrid Multi-objective Evolutionary Approach to Engineering Shape Design
Deb, K., & Goel, T. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44719-9_27 · Cited by 165
Comparison of local search-based metaheuristics on the multiple objective knapsack problem
Jaszkiewicz, A. (2001) · Foundations of Computing and Decision Sciences · Cited by 56
Alignment of protein structures with a memetic evolutionary algorithm
Carr, B., Hart, W. E., Krasnogor, N., Hirst, J. D., Burke, E., & Smith, J. E. (2002) · UWE Research Repository (UWE Bristol) · Cited by 41
Multiple Objective Metaheuristic Algorithms For Combinatorial Optimization
Jaszkiewicz, A., & Redakcyjnego, P. K. (2001) · Cited by 40
Watson, J., Rana, S., Whitley, L. D., & Howe, A. E. (1999) · Journal of Scheduling · doi:10.1002/(sici)1099-1425(199903/04)2:2<79::aid-jos19>3.0.co;2-h · Cited by 34
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
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.