Proteek Chandan Roy
ABSTRACT
Finding the non-dominated sorting of a given set vectors has applications in Pareto based evolutionary multi-objective optimization (EMO), finding convex hull, linear optimization, nearest neighbor, skyline queries in database and many others. Among these, EMOs use this method for survival selection. The worst case complexity of this problem is found to be O(NlogM-1N) when the number of objectives M is constant and the size of solutions N is varying. But this bound becomes too large when M depends on N. In this paper we are proposing a new algorithm with worst case complexity O(MNlogN+MN2), however, with reduced running time in many objective cases. This algorithm can make use of the faster implementation of sorting algorithms. It removes unnecessary comparisons among the solutions which improves the running time. The proposed algorithm is compared with four other competing algorithms on three different datasets. Experimental results show that our approach, namely, best order sort (BOS) is computationally more efficient than all other compared algorithms with respect to running time.
- S. Adra and P. Fleming. Diversity management in evolutionary many-objective optimization. Evolutionary Computation, IEEE Transactions on, 15(2):183--195, April 2011. Google Scholar
Digital Library
- J. L. Bentley. Multidimensional divide-and-conquer. Commun. ACM, 23(4):214--229, Apr. 1980. Google ScholarDigital Library
- J. L. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson. On the average number of maxima in a set of vectors and applications. J. ACM, 25(4):536--543, Oct. 1978. Google ScholarDigital Library
- M. Buzdalov and A. Shalyto. A provably asymptotically fast version of the generalized Jensen algorithm for non-dominated sorting. In T. Bartz-Beielstein, J. Branke, B. Filipic, and J. Smith, editors, Parallel Problem Solving from Nature - PPSN XIII, volume 8672 of Lecture Notes in Computer Science, pages 528--537. Springer International Publishing, 2014.Google Scholar
- C. A. Coello Coello and M. Lechuga. MOPSO: a proposal for multiple objective particle swarm optimization. In Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on, volume 2, pages 1051--1056, 2002. Google ScholarDigital Library
- K. Deb and H. Jain. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraints. Evolutionary Computation, IEEE Transactions on, 18(4):577--601, Aug 2014.Google Scholar
- K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: Nsga-II. Evolutionary Computation, IEEE Transactions on, 6(2):182--197, Apr 2002. Google ScholarDigital Library
- K. Deb, L. Thiele, M. Laumanns, and E. Zitzler. Scalable multi-objective optimization test problems. In Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on, volume 1, pages 825--830, May 2002.Google ScholarCross Ref
- K. Deb and S. Tiwari. Omni-optimizer: A procedure for single and multi-objective optimization. In Proceedings of the Third International Conference on Evolutionary Multi-Criterion Optimization, EMO'05, pages 47--61, Berlin, Heidelberg, 2005. Springer-Verlag. Google ScholarDigital Library
- H. Fang, Q. Wang, Y.-C. Tu, and M. F. Horstemeyer. An efficient non-dominated sorting method for evolutionary algorithms. Evol. Comput., 16(3):355--384, Sept. 2008. Google ScholarDigital Library
- F.-A. Fortin, S. Grenier, and M. Parizeau. Generalizing the improved run-time complexity algorithm for non-dominated sorting. In Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, GECCO '13, pages 615--622, New York, NY, USA, 2013. ACM. Google ScholarDigital Library
- P. Godfrey, R. Shipley, and J. Gryz. Maximal vector computation in large data sets. In Proceedings of the 31st International Conference on Very Large Data Bases, VLDB '05, pages 229--240. VLDB Endowment, 2005. Google ScholarDigital Library
- S. Gupta and G. Tan. A scalable parallel implementation of evolutionary algorithms for multi-objective optimization on gpus. In Evolutionary Computation (CEC), 2015 IEEE Congress on, pages 1567--1574, May 2015.Google ScholarCross Ref
- J. Horn, N. Nafpliotis, and D. Goldberg. A niched Pareto genetic algorithm for multiobjective optimization. In Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on, pages 82--87 vol.1, Jun 1994.Google ScholarCross Ref
- S. Huband, P. Hingston, L. Barone, and L. While. A review of multiobjective test problems and a scalable test problem toolkit. Evolutionary Computation, IEEE Transactions on, 10(5):477--506, Oct 2006. Google ScholarDigital Library
- M. Jensen. Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms. Evolutionary Computation, IEEE Transactions on, 7(5):503--515, Oct 2003. Google ScholarDigital Library
- J. Knowles and D. Corne. The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation. In Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on, volume 1, page 105 Vol. 1, 1999.Google ScholarCross Ref
- H. T. Kung, F. Luccio, and F. P. Preparata. On finding the maxima of a set of vectors. J. ACM, 22(4):469--476, Oct. 1975. Google ScholarDigital Library
- K. McClymont and E. Keedwell. Deductive sort and climbing sort: New methods for non-dominated sorting. Evol. Comput., 20(1):1--26, Mar. 2012. Google ScholarDigital Library
- L. Monier. Combinatorial solutions of multidimensional divide-and-conquer recurrences. J. Algorithms, 1(1):60--74, 1980.Google ScholarCross Ref
- T. Murata and H. Ishibuchi. MOGA: multi-objective genetic algorithms. In Evolutionary Computation, 1995., IEEE International Conference on, volume 1, pages 289--294, Nov 1995.Google ScholarCross Ref
- P. Roy, M. Islam, K. Murase, and X. Yao. Evolutionary path control strategy for solving many-objective optimization problem. Cybernetics, IEEE Transactions on, 45(4):702--715, April 2015.Google Scholar
- N. Srinivas and K. Deb. Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput., 2(3):221--248, Sept. 1994. Google ScholarDigital Library
- S. Tang, Z. Cai, and J. Zheng. A fast method of constructing the non-dominated set: Arena's principle. In Proceedings of the 2008 Fourth International Conference on Natural Computation - Volume 01, ICNC '08, pages 391--395, Washington, DC, USA, 2008. IEEE Computer Society. Google ScholarDigital Library
- H. Wang and X. Yao. Corner sort for pareto-based many-objective optimization. Cybernetics, IEEE Transactions on, 44(1):92--102, Jan 2014.Google Scholar
- M. A. Yukish. Algorithms to Identify Pareto Points in Multi-dimensional Data Sets. PhD thesis, Pennsylvania State University, 2004. AAI3148694. Google ScholarDigital Library
- X. Zhang, Y. Tian, R. Cheng, and Y. Jin. An efficient approach to nondominated sorting for evolutionary multiobjective optimization. Evolutionary Computation, IEEE Transactions on, 19(2):201--213, April 2015.Google Scholar
- E. Zitzler, M. Laumanns, and L. Thiele. SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization. In K. Giannakoglou et al., editors, Evolutionary Methods for Design, Optimisation and Control with Application to Industrial Problems (EUROGEN 2001), pages 95--100. International Center for Numerical Methods in Engineering (CIMNE), 2002.Google Scholar
Index Terms
- Best Order Sort: A New Algorithm to Non-dominated Sorting for Evolutionary Multi-objective Optimization
Recommendations
Deductive sort and climbing sort: New methods for non-dominated sorting
In recent years an increasing number of real-world many-dimensional optimisation problems have been identified across the spectrum of research fields. Many popular evolutionary algorithms use non-dominance as a measure for selecting solutions for future ...
Using Dominated Solutions at Edges to the Diversity and the Uniformity of Non-dominated Solution Distributions in NSGA-II
AbstractThis paper proposes a method for improving the diversity of the Pareto front and the uniformity of non-dominated solution distributions in a fast elitist non-dominated sorting genetic algorithm (NSGA-II), which is an evolutionary multi-objective ...
A comprehensive survey on NSGA-II for multi-objective optimization and applications
AbstractIn the last two decades, the fast and elitist non-dominated sorting genetic algorithm (NSGA-II) has attracted extensive research interests, and it is still one of the hottest research methods to deal with multi-objective optimization problems. ...
Comments