The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA
Abstract
This paper describes a simulated annealing based multiobjective optimization algorithm that incorporates the concept of archive in order to provide a set of tradeoff solutions for the problem under consideration. To determine the acceptance probability of a new solution vis-a-vis the current solution, an elaborate procedure is followed that takes into account the domination status of the new solution with the current solution, as well as those in the archive. A measure of the amount of domination between two solutions is also used for this purpose. A complexity analysis of the proposed algorithm is provided. An extensive comparative study of the proposed algorithm with two other existing and well-known multiobjective evolutionary algorithms (MOEAs) demonstrate the effectiveness of the former with respect to five existing performance measures, and several test problems of varying degrees of difficulty. In particular, the proposed algorithm is found to be significantly superior for many objective test problems (e.g., 4, 5, 10, and 15 objective problems), while recent studies have indicated that the Pareto ranking-based MOEAs perform poorly for such problems. In a part of the investigation, comparison of the real-coded version of the proposed algorithm is conducted with a very recent multiobjective simulated annealing algorithm, where the performance of the former is found to be generally superior to that of the latter.
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
Self-citationOptimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 14,918
Self-citationAlgorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
Self-citationEvolutionary 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
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
Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems
Deb, K. (1999) · Evolutionary Computation · doi:10.1162/evco.1999.7.3.205 · Cited by 1,451
Self-citationDas, I., & Dennis, J. E. (1997) · Structural Optimization · doi:10.1007/bf01197559 · Cited by 1,208
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
Multiobjective optimization using evolutionary algorithms
Sbalzarini, I. F., Mullery, S., & Koumoutsakosyz, P. (2000) · Cited by 920
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
Ishibuchi, H., Yoshida, T., & Murata, T. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810752 · Cited by 773
An evolutionary algorithm for multiobjective optimization: the strength Pareto approach
Zitzler, E., & Thiele, L. (1998) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-004288833 · Cited by 689
A survey of simulated annealing as a tool for single and multiobjective optimization
Suman, B., & Kumar, P. (2006) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2602068 · Cited by 611
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
Evolutionary many-objective optimisation: Many once or one many?
Hughes, E. J. (2005) · 2005 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2005.1554688 · Cited by 360
Multiobjective Genetic Clustering for Pixel Classification in Remote Sensing Imagery
Bandyopadhyay, S., Maulik, U., & Mukhopadhyay, A. (2007) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2007.892604 · Cited by 289
Self-citationMultiobjective GAs, Quantitative Indices, and Pattern Classification
Bandyopadhyay, S., Pal, S. K., & Aruna, B. (2004) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2004.834438 · Cited by 209
Self-citationPATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY.
Toussaint, G. T. (1980) · Unknown conference · Cited by 183
Multiobjective simulated annealing: a comparative study to evolutionary algorithms
Nam, D., & Park, C.-G. (2000) · International Journal of Fuzzy Systems · Cited by 133
CLUSTERING USING SIMULATED ANNEALING WITH PROBABILISTIC REDISTRIBUTION
Bandyopadhyay, S., Maulik, U., & Pakhira, M. K. (2001) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001401000927 · Cited by 78
Self-citationComparison of local search-based metaheuristics on the multiple objective knapsack problem
Jaszkiewicz, A. (2001) · Foundations of Computing and Decision Sciences · Cited by 56
Study of self-stopping PDMOSA and performance measure in multiobjective optimization
Suman, B. (2005) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2004.12.002 · Cited by 52
Cited by
Multiobjective evolutionary algorithms: A survey of the state of the art
Zhou, A., Qu, B.-Y., Li, H., Zhao, S.-Z., Suganthan, P. N., & Zhang, Q. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.03.001 · Cited by 2,255
Deb, K., & Deb, K. (2014) · Search Methodologies · doi:10.1007/978-1-4614-6940-7_15 · Cited by 1,248
Self-citationReview: Multi-objective optimization methods and application in energy saving
Cui, Y., Geng, Z., Zhu, Q., & Han, Y. (2017) · Energy · doi:10.1016/j.energy.2017.02.174 · Cited by 685
A survey on nature inspired metaheuristic algorithms for partitional clustering
Nanda, S. J., & Panda, G. (2014) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2013.11.003 · Cited by 574
Gong, M., Cai, Q., Chen, X., & Ma, L. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2260862 · Cited by 394
Metadata
- Authors
- Bandyopadhyay, S., Saha, S., Maulik, U., & Deb, K.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2008-06
- Volume
- 12
- Issue
- 3
- Pages
- 269-283
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2104492856
- Cited by
- 852
- References
- 27
- FWCI
- 55.74
- 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.