Pareto front approximation with adaptive weighted sum method in multiobjective simulation optimization

Proceedings - Winter Simulation Conference

Volumn , Issue , 2009, Pages 623-633

  Ryu, Jong Hyun ^a   Kim, Sujin ^b   Wan, Hong ^a  

^a SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE WEIGHTED SUM METHOD; EXPLICIT FORM; METAMODELING; MULTI OBJECTIVE; NUMERICAL RESULTS; OBJECTIVE FUNCTIONS; PARETO FRONT; SIMULATION OPTIMIZATION; SINGLE OBJECTIVE; SINGLE OBJECTIVE OPTIMIZATION; TRUST REGION ALGORITHMS; WEIGHTED SUM METHOD;

ALGORITHMS; ITERATIVE METHODS; PARETO PRINCIPLE;

MULTIOBJECTIVE OPTIMIZATION;

EID: 77951600786     PISSN: 08917736     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WSC.2009.5429562     Document Type: Conference Paper

References (16)

1. Abraham, A., L. C. Jain, and R. Goldberg. 2005. Evolutionary multiobjective optimization: theoretical advances and applications. London: Springer-Verlag.
2. Audet, C., and J. Dennis. 2007, Jan. Mesh adaptive direct search algorithms for constrained optimization. SIAM Journal on Optimization 17:188-217. (Pubitemid 46279500)
3. Audet, C., G. Savard, and W. Zghal. 2008, Jan. Multiobjective optimization through a series of single-objective formulations. SIAM Journal on Optimization 19 (1): 188-210.
4. Cohon, J. L. 1978. Multiobjective programming and planning. New York: Academic Press.
5. Conn, A. R., N. I. M. Gould, and P. L. Toint. 2000, Jan. Trust-region methods. Philadelphia: Society for Industrial and Applied Mathmatics and Mathematical Programming Society.
6. Das, I., and J. Dennis. 1998. Normal-boundary intersection: A new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM Journal on Optimization 8:631-657. (Pubitemid 128120657)
7. Deb, K. 1999, Jan. Multi-objective genetic algorithms: Problem difficulties and construction of test problems. Evolutionary Computation 7:205-230.
8. Deb, K., A. Pratap, S. Agarwal, and T. Meyarivan. 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transaction on Evolutionary Computation 6 (2): 182-197. (Pubitemid 34555372)
9. Markowitz, H. 1991. Portfolio selection: efficient diversification of investments. Malden, Massachusetts: Blackwell.
10. Myers, R. H., and D. C. Montgomery. 2002. Response surface methodology: Process and product optimization using designed experiments. the second ed. New Jersey: Wiley.
11. Nocedal, J., and S. J. Wright. 1999. Numerical optimization. New York: Springer.
12. Shan, S., and G. G. Wang. 2005, Jan. An efficient pareto set identification approach for multiobjective optimization on black-box functions. Journal of Mechanical Design 127 (5): 866.
13. Tappeta, R., J. Renaud, and J. Rodríguez. 2002, Jan. An interactive multiobjective optimization design strategy for decision based multidisciplinary design. Engineering Optimization 34 (5): 523-544.
14. Veldhuizen, D. V., and G. Lamont. 1998. Multiobjective evolutionary algorithm research: A history and analysis. Technical Report TR-98-103, Department of Electrical and Computer Engineering, Graduate School of Engineering, Air Force Institute of Technology, Writhe-Patterson AFB, OH.
15. Wilson, B., D. Cappelleri, T. Simpson, and M. Frecker. 2001, Jan. Efficient pareto frontier exploration using surrogate approximations. Optimization and Engineering 2:31-50.
16. Zadeh, L. 1963. Optimality and non-scalar-valued performance criteria. IEEE Transaction on Automatic Control 8:59-60.