Call for Paper - November 2023 Edition
IJCA solicits original research papers for the November 2023 Edition. Last date of manuscript submission is October 20, 2023. Read More

Post Pareto Analysis in Multi-objective Optimization

Print
PDF
 
Download Full Text
IJCA Proceedings on National Conference on Innovative Paradigms in Engineering & Technology 2013
© 2013 by IJCA Journal
NCIPET2013 - Number 4
Year of Publication: 2013
Authors:
P. M. Chaudhari
R. V. Dharaskar
V. M. Thakare

P M Chaudhari, R V Dharaskar and V M Thakare. Article: Post Pareto Analysis in Multi-objective Optimization. IJCA Proceedings on National Conference on Innovative Paradigms in Engineering & Technology 2013 NCIPET 2013(4):15-18, December 2013. Full text available. BibTeX

@article{key:article,
	author = {P. M. Chaudhari and R. V. Dharaskar and V. M. Thakare},
	title = {Article: Post Pareto Analysis in Multi-objective Optimization},
	journal = {IJCA Proceedings on National Conference on Innovative Paradigms in Engineering & Technology 2013},
	year = {2013},
	volume = {NCIPET 2013},
	number = {4},
	pages = {15-18},
	month = {December},
	note = {Full text available}
}

Abstract

The proposed methodology is based on efficient clustering technique for facilitating the decision-maker in the analysis of the solutions of multi-objective problems . Choosing a solution for system implementation from the Pareto-optimal set can be a difficult task, generally because Pareto-optimal sets can be extremely large or even contain an infinite number of solutions. The proposed technique provides the decision-maker a smaller set of optimal tradeoffs.

References

  • Hirotaka Nakayama, Multi-objective Optimization and its Engineering Applications, Proc. of third China-Japan-Korea Joint Symposium on Optimization of Structural and Mechanical System, pp. 13-26 (2004)
  • Zitzler, E. and Thiele, L. (1999), Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation, 3, p. 257–271.
  • Kaufman L. and Rousseeuw P. J. (1990). Finding groups in data. An introduction to Cluster Analysis. Wiley-Interscience.
  • Kalyanmoy Deb and Shamik Chaudhuri. I-MODE: An Interactive Multi-Objective Optimization and Decision-Making using Evolutionary Methods. KanGAL Report Number 2007003.
  • A. Rakhlin. Stability of clustering methods. NIPS Workshop"Theoretical Foundations of Clustering", December 2005.
  • Guha, S. , R. Rastogi & K. Shim. CURE: An Efficient Clustering Algorithm for Large Databases. In Proc. Of ACM SIGMOD Intl. Conf. on Management of Data, pp. 73-82, 1998.
  • Deb, K. , Agarwal, S. , Pratap, A. and Meyarivan, T. (2000a). A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II. KanGAL Report Number 200001, Indian Institute of Technology. Kanpur, India.
  • Davidson, I. , Ravi, S. S. : Clustering with constraints: Feasibility issues and the k-means algorithm. In: Proceedings of the 2005 SIAM International Conference on Data Mining. (2005)
  • Kaufman, L. and P. J. Rousseeuw, 1990. Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York.
  • Karypis G. , Han E. -H. and Kumar V. (1999) Chameleon: A hierarchical clustering algorithm using dynamic modeling. IEEE Computer, 32(8) pp68-75.
  • P. S. Bradley, U. Fayyad, and C. Reina, "Scaling Clustering Algorithms to Large Databases", To appear,Proc. 4th International Conf. on Knowledge Discovery and Data Mining (KDD-98). AAAI Press, Aug. 1998.
  • Rousseeuw P. J. (1987): Silhouettes: A graphical aid to the interpretation and validation of cluster analysis. Journal of computational and applied mathematics, 20, 53- 65.
  • Rousseeuw P. , Trauwaert E. an d Kaufman L. (1989): Some silhouette-based graphics for clustering interpretation. Belgian Journal of Operations Research, Statistics and Computer Science, 29(3).
  • Pradyumn Kumar Shukla and Kalyanmoy Deb. On Finding Multiple Pareto-Optimal Solutions Using Classical and Evolutionary Generating Methods. KanGAL Report Number 2005006
  • A tabu method to find the Pareto solutions of multiobjectiveoptimal design problems in electromagnetics Ho, S. L. ; Shiyou Yang; Guangzheng Ni; Wong, H. C. Magnetics, IEEE Transactions on Volume 38, Issue 2, Mar 2002 Page(s):1013 – 1016 Digital Object Identifier 10. 1109/20. 996260
  • Venkat V. , Jacobson S. and Stori J. (2004). A post-Optimality Analysis Algorithm for Multi-Objective Optimization. Computational Optimization and Applications, 28, 357- 372. [17 ] Chankong, V. and Haimes, Y. (1983). Multiobjective decision making theory and methodology. New York:North-Holland.
  • Jasper A. Vrugt and Bruce A. Robinson. (2007). Improved evolutionary optimization from genetically adaptive multimethod search. Proc Natl Acad Sci U S A. 2007 January 16; 104(3): 708–711.
  • Jose Maria A. Pangilinan, and Gerrit K. Janssens. Evolutionary Algorithms for the Multiobjective Shortest Path Problem. World Academy of Science, Engineering and Technology 25 2007
  • Kalyanmoy Deb. Advances in evolutionary computing: theory and applications Pages: 263 - 292 Year of Publication: 2003 ISBN:3-540-43330-9
  • A. F. Gomez-Skarmeta, M. Delgado, M. A. Vila. About the use of fuzzy clustering techniques for fuzzy model identification. Fuzzy Sets and Systems, 1999, 106(2):179-188.
  • P. M. Chaudhari, R. V. Dharaskar , V. M. Thakare (2010): " Computing the most significant solution from pareto front obtained in multi objective algorithms. ", (IJACSA) International Journal of Advanced Computer Science and Applications,Vol. 1, No. 4, October 2010:63-68