Calculating complete and exact pareto front for multiobjective optimization: A new deterministic approach for discrete problems

IEEE Transactions on Cybernetics

Volumn 43, Issue 3, 2013, Pages 1088-1101

  Hu, Xiao Bing ^a,b   Wang, Ming ^a   Di Paolo, Ezequiel ^c,d  

^a BEIJING NORMAL UNIVERSITY   (China)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

^d UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

Multiobjective optimization; Pareto front; Ripple spreading algorithm; Route optimization

Indexed keywords

DETERMINISTIC APPROACH; DETERMINISTIC METHODS; GENERAL METHODOLOGIES; MULTI-OBJECTIVE OPTIMIZATION PROBLEM; OBJECTIVE FUNCTIONS; OPTIMIZATION ALGORITHMS; PARETO FRONT; ROUTE OPTIMIZATION;

ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION;

PARETO PRINCIPLE;

ALGORITHM; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; DECISION SUPPORT SYSTEM; GAME; PROCEDURES; SIGNAL PROCESSING; ARTICLE; METHODOLOGY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DECISION SUPPORT TECHNIQUES; GAME THEORY; PATTERN RECOGNITION, AUTOMATED; SIGNAL PROCESSING, COMPUTER-ASSISTED;

EID: 84890426388     PISSN: 21682267     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2012.2223756     Document Type: Article

References (34)

1. N. Barr, Economics of the Welfare State. New York: Oxford Univ. Press, 2004.
2. R. E. Steuer, Multiple Criteria Optimization: Theory, Computations, and Application. Hoboken, NJ: Wiley, 1986.
3. Y. Sawaragi, H. Nakayama, and T. Tanino, Theory of Multiobjective Optimization (Vol. 176 of Mathematics in Science and Engineering). Orlando, FL: Academic, 1985.
4. L. Raamesh and G. V. Uma, "Data mining based optimization of test cases to enhance reliability of the testing," in Advances in Computing and Information Technology, D. W. Wyld, M. Wozniak, N. Chaki, N. Meghanathan, and D. Nagamalai, Eds. New York: Springer-Verlag, 2011, pp. 89-98.
5. I. Das and J. E. Dennis, "Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems," SIAM J. Optim., vol. 8, no. 3, pp. 631-657, Aug. 1998.
6. I. Das and J. Dennis, "Normal-Boundary Intersection: An Alternate Method for Generating Pareto Optimal Points in Multicriteria Optimization Problems," NASA Langley Res. Centr., Hampton, VA, NASA Contractor Rep. 201616, ICASE Rep. 96-62, 1996.
7. A. Messac, A. Ismail-Yahaya, and C. A. Mattson, "The normalized normal constraint method for generating the Pareto front," Struct. Multidiscipl. Optim., vol. 25, no. 2, pp. 86-98, Jul. 2003.
8. A. Messac and C. A. Mattson, "Normal constraint method with guarantee of even representation of complete Pareto front," AIAA J., vol. 42, no. 10, pp. 2101-2111, Oct. 2004.
9. T. Erfani and S. V. Utyuzhnikov, "Directed search domain: A method for even generation of Pareto front in multiobjective optimization," Eng. Optim., vol. 43, no. 5, pp. 467-484, May 2011.
10. A. Konak, D. W. Coit, and A. E. Smith, "Multi-objective optimization using genetic algorithms: A tutorial," Reliab. Eng. Syst. Safety, vol. 91, no. 9, pp. 992-1007, Sep. 2006.
11. M. Delgado, M. P. Cuellar, and M. C. Pegalajar, "Multiobjective hybrid optimization and training of recurrent neural networks," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 38, no. 2, pp. 381-403, Apr. 2008.
12. D. F. Jones, S. K. Mirrazavi, and M. Tamiz, "Multiobjective metaheuristics: An overview of the current state-of-the-art," Eur. J. Oper. Res., vol. 137, no. 1, pp. 1-9, Feb. 2002.
13. N. Srinivas and K. Deb, "Multiobjective optimization using nondominated sorting in genetic algorithms," Evol. Comput., vol. 2, no. 3, pp. 221-248, 1994.
14. K. Deb, "A fast and elitist multiobjective genetic algorithm: NSGA-II," IEEE Trans. Evol. Comput., vol. 6, no. 2, pp. 182-197, Apr. 2002.
15. W. F. Leong and G. G. Yen, "PSO-based multiobjective optimization with dynamic population size and adaptive local archives," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 38, no. 5, pp. 1270-1293, Oct. 2008.
16. J. D. Knowles and D. W. Corne, "Approximating the nondominated front using the Pareto archived evolution strategy," Evol. Comput., vol. 8, no. 2, pp. 149-172, Jun. 2000.
17. S. Bandyopadhyay, S. K. Pal, and B. Aruna, "Multiobjective GAs, quantitative indices, and pattern classification," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 34, no. 5, pp. 2088-2099, Oct. 2004.
18. X. J. Lei and Z. K. Shi, "Overview of multi-objective optimization methods," J. Syst. Eng. Electron., vol. 15, no. 2, pp. 142-146, Jun. 2004.
19. K. Deb, Multi-Objective Optimization Using Evolutionary Algorithms. New York: Wiley, 2001.
20. D. A. Van Veldhuizen and G. B. Lamont, "Multiobjective evolutionary algorithms: Analyzing the state-of-the-art," Evol. Comput., vol. 8, no. 2, pp. 125-147, Jun. 2000.
21. X. F. Zou, Y. Chen, M. Z. Liu, and L. S. Kang, "A new evolutionary algorithm for solving many-objective optimization problems," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 38, no. 5, pp. 1402-1412, Oct. 2008.
22. E. Zitzler, K. Deb, and L. Thiele, "Comparison of multiobjective evolutionary algorithms: Empirical results," Evol. Comput., vol. 8, no. 2, pp. 173-195, Jun. 2000.
23. J. Figueira, S. Greco, and M. Ehrgottc, Multiple Criteria Decision Analysis: State of the Art Surveys. New York: Springer-Verlag, 2005.
24. D. Craft, T. Halabi, H. Shih, and T. Bortfeld, "Approximating convex Pareto surfaces in multiobjective radiotherapy planning," Med. Phys., vol. 33, no. 9, pp. 3399-3407, Sep. 2006.
25. J. Y. Yen, "Finding the k shortest loopless paths in a network," Manage. Sci., vol. 17, no. 11, pp. 712-716, Jul. 1971.
26. D. Eppstein, "Finding the k shortest paths," SIAM J. Optim., vol. 28, no. 2, pp. 652-673, Apr. 1998.
27. H. Aljazzar and S. Leue, "K* : A heuristic search algorithm for finding the k shortest paths," Artif. Intell., vol. 175, no. 18, pp. 2129-2154, Dec. 2011.
28. S. L. C. Pun-Cheng, "An interactive Web-based public transport enquiry system with real-time optimal route computation," IEEE Trans. Intell. Transp. Syst., vol. 13, no. 2, pp. 983-988, Jun. 2012.
29. X. B. Hu, M. Wang, M. S. Leeson, E. L. Hines, and E. Di Paolo, "A ripple-spreading algorithm for route optimization," in Proc. IEEE SSCI, Singapore, Apr. 15-19, 2013.
30. S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, 3rd ed. Englewood Cliffs, NJ: Prentice-Hall, 2010.
31. E. W. Dijkstra, "A note on two problems in connexion with graph," Numer. Math., vol. 1, no. 1, pp. 269-271, Dec. 1959.
32. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Section 24.3: Dijkstra's algorithm," in Introduction to Algorithms, 2nd ed. Cambridge, MA: MIT Press, 2001, pp. 595-601.
33. M. Sniedovich, "Section 15.5: Dijkstra's algorithm," in Dynamic Programming: Foundations and Principles. New York: Taylor & Francis, 2010, pp. 441-448.
34. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, no. 6684, pp. 440-442, Jun. 1998.