The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
MOEA/D-ACO: A Multiobjective Evolutionary Algorithm Using Decomposition and AntColony
Abstract
Combining ant colony optimization (ACO) and the multiobjective evolutionary algorithm (EA) based on decomposition (MOEA/D), this paper proposes a multiobjective EA, i.e., MOEA/D-ACO. Following other MOEA/D-like algorithms, MOEA/D-ACO decomposes a multiobjective optimization problem into a number of single-objective optimization problems. Each ant (i.e., agent) is responsible for solving one subproblem. All the ants are divided into a few groups, and each ant has several neighboring ants. An ant group maintains a pheromone matrix, and an individual ant has a heuristic information matrix. During the search, each ant also records the best solution found so far for its subproblem. To construct a new solution, an ant combines information from its group's pheromone matrix, its own heuristic information matrix, and its current solution. An ant checks the new solutions constructed by itself and its neighbors, and updates its current solution if it has found a better one in terms of its own objective. Extensive experiments have been conducted in this paper to study and compare MOEA/D-ACO with other algorithms on two sets of test problems. On the multiobjective 0-1 knapsack problem,MOEA/D-ACO outperforms the MOEA/D with conventional genetic operators and local search on all the nine test instances. We also demonstrate that the heuristic information matrices in MOEA/D-ACO are crucial to the good performance of MOEA/D-ACO for the knapsack problem. On the biobjective traveling salesman problem, MOEA/D-ACO performs much better than the BicriterionAnt on all the 12 test instances. We also evaluate the effects of grouping, neighborhood, and the location information of current solutions on the performance of MOEA/D-ACO. The work in this paper shows that reactive search optimization scheme, i.e., the "learning while optimizing" principle, is effective in improving multiobjective optimization 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
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069
Self-citationMultiobjective 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
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
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
Nonlinear Multiobjective Optimization
Miettinen, K. (1998) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-5563-6 · Cited by 4,710
Nonlinear Multiobjective Optimization
Mardle, S., & Miettinen, K. M. (2000) · The Journal of the Operational Research Society · doi:10.2307/254267 · Cited by 3,049
Hoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
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
(2005) · Springer eBooks · doi:10.1007/3-540-27659-9 · Cited by 2,370
(2017) · Encyclopedia of Machine Learning and Data Mining · doi:10.1007/978-1-4899-7687-1_100317 · Cited by 2,127
(2004) · Lecture Notes in Computer Science · doi:10.1007/b99492 · Cited by 1,511
Ranjith Kumar, A., & Ranjith Kumar, R. (2011) · Cited by 1,225
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
A Genetic Algorithm for the Multidimensional Knapsack Problem
Chu, P. C., & Beasley, J. E. (1998) · Journal of Heuristics · doi:10.1023/a:1009642405419 · Cited by 828
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
Self-citationBattiti, R., & Tecchiolli, G. (1994) · ORSA Journal on Computing · doi:10.1287/ijoc.6.2.126 · Cited by 801
Self-citationA new rank based version of the Ant System. A computational study.
Bullnheimer, B., Hartl, R. F., & Strauß, C. (1997) · ePubWU Institutional Repository (Wirtschaftsuniversität Wien) · doi:10.57938/2eb99227-a596-4eb4-bb7d-367b53dee89d · Cited by 793
Jaszkiewicz, A. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.802873 · Cited by 474
Recent Advances in Memetic Algorithms
Hart, W. E., Smith, J. E., & Krasnogor, N. (2005) · Springer eBooks · doi:10.1007/3-540-32363-5 · Cited by 446
Pareto Ant Colony Optimization: A Metaheuristic Approach to Multiobjective Portfolio Selection
Doerner, K., Gutjahr, W. J., Hartl, R. F., Strauss, C., & Stummer, C. (2004) · Annals of Operations Research · doi:10.1023/b:anor.0000039513.99038.c6 · Cited by 446
García-Martínez, C., Cordón, O., & Herrera, F. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.03.041 · Cited by 300
Multiobjective Evolutionary Algorithms and Applications
(2005) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-132-6 · Cited by 292
Reactive Search and Intelligent Optimization
Battiti, R., Brunato, M., & Mascia, F. (2008) · Operations research, computer science. Interface series · doi:10.1007/978-0-387-09624-7 · Cited by 279
Self-citationAutomatic algorithm configuration based on local search
Hutter, F., Hoos, H. H., & Stützle, T. (2007) · Cited by 240
Multiple single objective pareto sampling
Hughes, E. J. (2004) · The 2003 Congress on Evolutionary Computation, 2003. CEC '03. · doi:10.1109/cec.2003.1299427 · Cited by 234
An Evolutionary Algorithm With Guided Mutation for the Maximum Clique Problem
Zhang, Q., Sun, J., & Tsang, E. P. K. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.840835 · Cited by 229
Self-citationAnt Colony Optimization for Multi-Objective Optimization Problems
Alaya, I., Solnon, C., & Ghedira, K. (2007) · 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007) · doi:10.1109/ictai.2007.108 · Cited by 223
Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem
Mei, Y., Tang, K., & Yao, X. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2051446 · Cited by 216
A Hybrid Framework for Evolutionary Multi-Objective Optimization
Sindhya, K., Miettinen, K., & Deb, K. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2204403 · Cited by 210
Multiple objective ant colony optimisation
Angus, D., & Woodward, C. (2009) · Swarm Intelligence · doi:10.1007/s11721-008-0022-4 · Cited by 176
Evolutionary many-objective optimization by NSGA-II and MOEA/D with large populations
Ishibuchi, H., Sakane, Y., Tsukamoto, N., & Nojima, Y. (2009) · 2009 IEEE International Conference on Systems, Man and Cybernetics · doi:10.1109/icsmc.2009.5346628 · Cited by 169
Adapting Weighted Aggregation for Multiobjective Evolution Strategies
Jin, Y., Okabe, T., & Sendho, B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44719-9_7 · Cited by 155
Memetic Algorithms for Multiobjective Optimization: Issues, Methods and Prospects
Knowles, J. D., & Corne, D. (2006) · Springer eBooks · doi:10.1007/3-540-32363-5_14 · Cited by 152
Simultaneous use of different scalarizing functions in MOEA/D
Ishibuchi, H., Sakane, Y., Tsukamoto, N., & Nojima, Y. (2010) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1830483.1830577 · Cited by 135
Battiti, R., & Passerini, A. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2058118 · Cited by 135
Self-citationIshibuchi, H., Sakane, Y., Tsukamoto, N., & Nojima, Y. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01020-0_35 · Cited by 129
Shim, V. A., Tan, K. C., & Cheong, C. Y. (2012) · IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) · doi:10.1109/tsmcc.2012.2188285 · Cited by 119
Giagkiozis, I., Purshouse, R. C., & Fleming, P. J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37140-0_33 · Cited by 71
The impact of design choices of multiobjective antcolony optimization algorithms on performance
López‐Ibáñez, M., & Stützle, T. (2010) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1830483.1830494 · Cited by 38
Pal, S., Das, S., Basak, A., & Suganthan, P. N. (2010) · Progress In Electromagnetics Research B · doi:10.2528/pierb10033107 · Cited by 27
Cited by
A New Dominance Relation-Based Evolutionary Algorithm for Many-Objective Optimization
Yuan, Y., Xu, H., Wang, B., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2420112 · Cited by 752
A Survey of Multiobjective Evolutionary Algorithms based on Decomposition
Trivedi, A., Srinivasan, D., Sanyal, K., & Ghosh, A. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2608507 · Cited by 549
IGD Indicator-Based Evolutionary Algorithm for Many-Objective Optimization Problems
Sun, Y., Yen, G. G., & Yi, Z. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2791283 · Cited by 519
Deep Reinforcement Learning for Multiobjective Optimization
Li, K., Zhang, T., & Wang, R. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2977661 · Cited by 424
Cheikhrouhou, O., & Khoufi, I. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2021.100369 · Cited by 290
Metadata
- Authors
- Ke, L., Zhang, Q., & Battiti, R.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2013-12
- Volume
- 43
- Issue
- 6
- Pages
- 1845-1859
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2073478661
- Cited by
- 306
- References
- 44
- FWCI
- 26.20
- 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.