MOEA/D with uniform design for the multiobjective 0/1 knapsack problem

Proceedings - 2011 7th International Conference on Computational Intelligence and Security, CIS 2011

Volumn , Issue , 2011, Pages 96-100

  Tan, Yan Yan ^a   Jiao, Yong Chang ^a   Wang, Xin Kuan ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

Decomposition; Knapsack problem; Multiobjective evolutionary algorithm; Uniform design

Indexed keywords

0/1 KNAPSACK PROBLEMS; COEFFICIENT VECTOR; KNAPSACK PROBLEMS; MULTI OBJECTIVE; MULTIOBJECTIVE EVOLUTIONARY ALGORITHM; NP COMPLETE; NSGA-II; REAL-WORLD PROBLEM; REGION OF INTEREST; SCALAR OPTIMIZATION; SUB-PROBLEMS; UNIFORM DESIGN; UNIFORM DESIGN METHOD;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DECOMPOSITION; DESIGN; INTEGER PROGRAMMING;

COMBINATORIAL OPTIMIZATION;

EID: 84863061633     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIS.2011.29     Document Type: Conference Paper

References (15)

1. A. Jaszkiewicz, Comparison of local search-based meta-heuristics on the multiple-objective knapsack problem, Foundations of Computing and Decision Sciences, 26(1):99-120, 2001.
2. E. Zitzler and L. Thiele, Multiple objective evolutionary algorithms: a comparative case study and the strength Pareto approach, IEEE Transactions on Evolutionary Computation, 3(4):257-271, 1999.
3. J. D. Knowles and D. W. Corne, A comparison of diverse approaches to memetic multi-objective combinatorial optimization, Proceedings of the 2000 genetic and evolutionary computation conference workshop program. Las Vegas, Nevada, 103-108, 2000.
4. A. Jaszkiewicz, Genetic local search for multiple objective combinatorial optimization, Technical Report RA-014/98, Institute of Computing Science, Poznan University of Technology, 1998.
5. E. L. Ulungu, J. Teghem, P. Fortemps and D. Tuyttens, MOSA method: a tool for solving multiobjective combinatorial optimization problems, Journal of Multi-Criteria Decision Analysis, 8:221-236, 1999.
6. A. Jaszkiewicz, On the performance of multiple objective genetic local search on the 0/1 knapsack problemła comparative experiment, IEEE Transactions on Evolutionary Computation, 6(4):402-412, 2002.
7. E. Zitzler, M. Laumanns and L. Thiele, SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization, Proc. Evolutionary Methods for Design Optimization and Control with Applications to Industrial Problems, Athens, Greece, 95-100, 2001.
8. Q. Zhang and H. Li, MOEA/D: A multi-objective evolutionary algorithm based on decomposition, IEEE Trans. Evol. Comput., 11(6):712-731, 2007.
9. H. Li and Q. Zhang, Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II, IEEE Trans. Evol. Comput., 12(2):284-302, 2009.
10. P. C. Chang, S. H. Chen, Q. Zhang and J. L. Lin, MOEA/D for flowshop scheduling problems, Proc. of Congress on Evolutionary Computation (CEC'08), Hong Kong, China, 1433-1438, 2008.
11. Q. Zhang, W. Liu, E. Tsang and B. Virginas, Expensive multiobjectiveoptimization by MOEA/D with gaussian process model, Technical Report CES-489, the School of Computer Science and Electronic Engineering, University of Essex, Tech. Rep., 2009.
12. H. Ishibuchi, Y. Sakane, N. Tsukamoto and Y. Nojima, Adaptation of scalarizing functions in MOEA/D: An adaptive scalarizing functionbased multiobjective evolutionary algorithm, Proc. of the 5th International Conference devoted to Evolutionary Multi-Criterion Optimization (EMO'09), Nantes, France, 438-452, 2009.
13. K. Miettinen, Nonlinear Multiobjective Optimization. Boston: Kluwer Academic, 1999.
14. K. T. Fang and D. K. J. Lin, Uniform designs and their application in industry, Handbook of Statistics, 22:131-170, 2003.
15. Khoi Nguyen Le, BSc, MRes, A study of evolutionary multiobjective algorithms and their application to knapsack and nurse scheduling problems. PhD thesis, University of Nottingham, 2011.