Multiobjective Interacting Particle Algorithm for Global Optimization

References

• Andersen HC, Diaconis P (2007) Hit-and-run as a unifying device. Journal de la Société Française de Statistique 148:5–28.Google Scholar
• Belisle CJP, Romeijn HE, Smith RL (1993) Hit-and-run algorithms for generating multivariate distributions. Math. Oper. Res. 18: 255–266.Link, Google Scholar
• Chang TJ, Meade N, Beasley JE, Sharaiha YM (2000) Heuristics for cardinality constrained portfolio optimisation. Comput. Oper. Res. 27:1271–1302.Crossref, Google Scholar
• Chipperfield A, Whidborne J, Fleming P (1999) Evolutionary algorithms and simulated annealing for MCDM. Gal T, Stewart T, Hanne T, eds. Multicriteria Decision Making—Advances in MCDM Models, Algorthms, Theory, and Applications (Kluwer Academic Publishers, Boston), 16.1–16.32.Crossref, Google Scholar
• Coello Coello CA, Lamont GB, Van Veldhuisen DA (2007) Evolutionary Algorithms for Solving Multi-Objective Problems (Springer, New York).Google Scholar
• Czyzak P, Jaszkiewicz A (1998) Pareto simulated annealing—A metaheuristic technique for multiple-objective combinatorial optimization. J. Multi-Criteria Decision Anal. 7:34–47.Crossref, Google Scholar
• Deb K (2001) Multi-Objective Optimization Using Evolutionary Algorithms (John Wiley & Sons, Chichester, UK).Google Scholar
• Deb K, Pratap A, Agarwal S, Meyarivan T (2002a) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolutionary Comput. 6:182–197.Crossref, Google Scholar
• Deb K, Thiele L, Laumanns M, Zitzler E (2002b) Scalable multi-objective optimization test problems. Proc. 2002 Congress on Evolutionary Comput. (IEEE, Piscataway, NJ), 825–830.Crossref, Google Scholar
• Del Moral P (2004) Feynman-Kac Formulae: Genealogical and Interacting Particle Systems with Applications (Springer, New York).Crossref, Google Scholar
• Del Moral P, Miclo L (1999) On the convergence and applications of generalized simulated annealing. SIAM J. Control Optim. 37:1222–1250.Crossref, Google Scholar
• Durillo JJ, Nebro AJ (2011) jMetal: A Java framework for multi-objective optimization. Adv. Engrg. Software 42:760–771.Crossref, Google Scholar
• Emmerich M, Beume N, Naujoks B (2005) An emo algorithm using the hypervolume measure as selection criterion. Coello Coello CA, Aguirre AH, Zitzler E, eds. Evolutionary Multi-Criterion Optimization, Lecture Notes in Computer Science, Vol. 3410 (Springer, Berlin, Heidelberg), 62–76.Crossref, Google Scholar
• Kennedy JF, Eberhart RC (1995) Particle swarm optimization. 1995 IEEE Internat. Conf. Neural Networks Proc. (IEEE, Piscataway, NJ), 1942–1948.Crossref, Google Scholar
• Kung HT, Luccio F, Preparata FP (1975) On finding the maxima of a set of vectors. J. Assoc. Comput. Machinery 22:409–476.Crossref, Google Scholar
• Lovász L (1999) Hit-and-run mixes fast. Math. Programming 86:443–461.Crossref, Google Scholar
• Lovász L, Vempala S (2003) Simulated annealing in convex bodies and an o*(n4) volume algorithm. J. Comput. System Sci. 72:392–417.Crossref, Google Scholar
• Lovász L, Vempala S (2006) Hit-and-run from a corner. SIAM J. Comput. 35:985–1005.Crossref, Google Scholar
• Lucic P, Teodorovic D (1999) Simulated annealing for the multi-objective aircrew rostering problem. Transportation Res. Part A: Policy Practice 33:19–45.Crossref, Google Scholar
• Mete HO (2010) Multi-objective optimization of complex systems defined by rules. Doctoral thesis, University of Washington, Seattle.Google Scholar
• Mete HO, Zabinsky ZB (2012) Pattern hit-and-run for sampling efficiently on polytopes. Oper. Res. Lett. 40:6–11.Crossref, Google Scholar
• Mete HO, Shen Y, Zabinsky Z, Kiatsupaibul S, Smith R (2011) Pattern discrete and mixed hit-and-run for global optimization. J. Global Optim. 50:597–627.Crossref, Google Scholar
• Molvalioglu O, Zabinsky ZB, Kohn W (2009) The interacting-particle algorithm with dynamic heating and cooling. J. Global Optim. 43:329–356.Crossref, Google Scholar
• Molvalioglu O, Zabinsky ZB, Kohn W (2010) Meta-control of an interacting-particle algorithm for global optimization. Nonlinear Anal.: Hybrid Systems 4:659–671.Crossref, Google Scholar
• Nam D, Park CH (2000) Multiobjective simulated annealing: A comparative study to evolutionary algorithms. Internat. J. Fuzzy Systems 2:87–97.Google Scholar
• Ray T, Gokarn RP, Sha OP (1995) A global optimization model for ship design. Comput. Industry 26:175–192.Crossref, Google Scholar
• Serafini P (1994) Simulated annealing for multiobjective optimization problems. Tzeng GH, Wang HF, Wen VP, Yu PL, eds. Multiple Criteria Decision Making: Proc. Tenth Internat. Conf.: Expand and Enrich the Domains of Thinking and Application (Springer-Verlag, New York), 283–292.Google Scholar
• Smith KI, Everson RM, Fieldsend JE, Murphy C, Misra R (2008) Dominance-based multiobjective simulated annealing. IEEE Trans. Evolutionary Comput. 12:323–342.Crossref, Google Scholar
• Smith RL (1984) Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Oper. Res. 32:1296–1308.Link, Google Scholar
• Spall JC (2003) Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control (Wiley-Interscience, Hoboken, NJ).Crossref, Google Scholar
• Ulungu EL, Teghem J, Fortemps PH, Tuyttens D (1999) MOSA method: A tool for solving multiobjective combinatorial optimization problems. J. Multicriteria Decision Anal. 8:221–236.Crossref, Google Scholar
• Zabinsky ZB (2003) Stochastic Adaptive Search for Global Optimization (Kluwer Academic Publishers, Boston).Crossref, Google Scholar
• Zabinsky ZB (2010) Random search algorithms. Cochran JJ, ed. Wiley Encyclopedia of Operations Research and Management Science (Wiley-Interscience, Hoboken, NJ).Google Scholar
• Zhang M, Zhao S, Wang X (2009) Multi-objective evolutionary algorithm based on adaptive discrete differential evolution. Proc. 2009 Congress on Evolutionary Comput. (IEEE, Piscataway, NJ), 614–621.Crossref, Google Scholar