메뉴 건너뛰기




Volumn 2, Issue , 2004, Pages 1958-1963

Improving the performance of evolutionary algorithms for the multiobjective 0/1 knapsack problem using ε -dominance

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITY CONSTRAINTS; MULTIOBJECTIVE KNAPSACK PROBLEM; PARETO DOMINANCE;

EID: 4344670751     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (6)

References (21)
  • 1
    • 0000843040 scopus 로고
    • An algorithms for large zero-one knapsack problems
    • E. Balas, and E. Zemel, "An algorithms for large zero-one knapsack problems", in Operations Research, Vol 28, pp. 1130-1154, 1980.
    • (1980) Operations Research , vol.28 , pp. 1130-1154
    • Balas, E.1    Zemel, E.2
  • 2
    • 0009625877 scopus 로고
    • Hard knapsack problems
    • V. Chvatal, "Hard knapsack problems", Operations Research, Vol 28, pp. 1402-1411, 1980.
    • (1980) Operations Research , vol.28 , pp. 1402-1411
    • Chvatal, V.1
  • 4
    • 84947926042 scopus 로고    scopus 로고
    • A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA II
    • M. S. et al. Eds, Springer-Verlag, Berlin
    • K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan, "A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA II", in M. S. et al. Eds, Parallel Problem Solving From Nature - PPSN VI, Springer-Verlag, Berlin, 2000, pp. 849 - 858.
    • (2000) Parallel Problem Solving from Nature - PPSN VI , pp. 849-858
    • Deb, K.1    Agrawal, S.2    Pratap, A.3    Meyarivan, T.4
  • 5
    • 0021886787 scopus 로고
    • Efficient algorithms for solving multi-constraint zero-one knapsack problem to optimality
    • B. Gavish, and H. Pirkul, "Efficient algorithms for solving multi-constraint zero-one knapsack problem to optimality", Mathematical Programming Vol. 31, pp. 78-105, 1985.
    • (1985) Mathematical Programming , vol.31 , pp. 78-105
    • Gavish, B.1    Pirkul, H.2
  • 7
    • 4344681934 scopus 로고    scopus 로고
    • How to compare the multiobjective evolutionary algorithms performances?
    • Cluj-Napoca, Romania
    • C. Grosan, "How to compare the multiobjective evolutionary algorithms performances?" in Zilele Academice Clujene, Cluj-Napoca, Romania, 2003.
    • (2003) Zilele Academice Clujene
    • Grosan, C.1
  • 8
    • 0004285796 scopus 로고
    • A reduction algorithm for zero-one single knapsack problems
    • G. P. Ingargiola, and J. F. Korsh, "A reduction algorithm for zero-one single knapsack problems", in Management Science Vol. 20, pp. 460-463, 1975.
    • (1975) Management Science , vol.20 , pp. 460-463
    • Ingargiola, G.P.1    Korsh, J.F.2
  • 9
    • 0036671292 scopus 로고    scopus 로고
    • On the performance of multiple objective local search on the 0/1 knapsack problem - A comparative experiment
    • A. Jaszkiewicz, "On the performance of Multiple Objective Local Search on the 0/1 Knapsack problem - A Comparative Experiment", IEEE Transaction on Evolutionary Computation, Vol 6, pp. 402-412, 2002.
    • (2002) IEEE Transaction on Evolutionary Computation , vol.6 , pp. 402-412
    • Jaszkiewicz, A.1
  • 11
    • 0026930416 scopus 로고
    • A parallel algorithm for the zero-one knapsack problem
    • W. Loots, and T.H.C. Smith, "A parallel algorithm for the zero-one knapsack problem", International Journal Parallel Program, Vol. 21, pp. 313-348, 1992.
    • (1992) International Journal Parallel Program , vol.21 , pp. 313-348
    • Loots, W.1    Smith, T.H.C.2
  • 13
    • 0017492938 scopus 로고
    • An upper bound for the zero-one knapsack problem and a branch and bound algorithm
    • S. Martello, and P. Toth, "An upper bound for the zero-one knapsack problem and a branch and bound algorithm", European Journal of Operational Research, Vol. 1, pp. 169-175, 1977.
    • (1977) European Journal of Operational Research , vol.1 , pp. 169-175
    • Martello, S.1    Toth, P.2
  • 14
    • 0028374732 scopus 로고
    • Solving the 0/1 proportional knapsack problem by sampling
    • M. Penn, D. Hasson, and M. Avriel, "Solving the 0/1 proportional Knapsack problem by sampling", J. Optim. Theory Appl pp. 261-272, 1994.
    • (1994) J. Optim. Theory Appl , pp. 261-272
    • Penn, M.1    Hasson, D.2    Avriel, M.3
  • 15
    • 0016437461 scopus 로고
    • Approximate algorithms for the 0/1 knapsack problem
    • S. Sahni, "Approximate algorithms for the 0/1 knapsack problem", Journal of ACM, Vol. 22, pp. 115-124, 1975.
    • (1975) Journal of ACM , vol.22 , pp. 115-124
    • Sahni, S.1
  • 17
    • 84878545782 scopus 로고    scopus 로고
    • Multiobjective optimization using evolutionary algorithms-a comparative case study
    • A. E. Eiben, T. Back, M. Schoenauer and H. P. Schwefel Eds., Springer, Berlin, Germany
    • E. Zitzler, and L. Thiele, "Multiobjective optimization using evolutionary algorithms-a comparative case study", in Fifth International Conference on Parallel Problem Solving from Nature, A. E. Eiben, T. Back, M. Schoenauer and H. P. Schwefel Eds., Springer, Berlin, Germany, 1998, pp. 292-301.
    • (1998) Fifth International Conference on Parallel Problem Solving from Nature , pp. 292-301
    • Zitzler, E.1    Thiele, L.2
  • 18
    • 0033318858 scopus 로고    scopus 로고
    • Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach
    • E. Zitzler, and L. Thiele, "Multiobjective Evolutionary Algorithms: A comparative case study and the Strength Pareto Approach", IEEE Transaction on Evolutionary Computation, Vol 3, pp. 257-271, 1999.
    • (1999) IEEE Transaction on Evolutionary Computation , vol.3 , pp. 257-271
    • Zitzler, E.1    Thiele, L.2
  • 20
    • 1642474729 scopus 로고    scopus 로고
    • SPEA 2: Improving the strength Pareto evolutionary algorithm
    • Computer Engineering and Networks Laboratory (TIK), Department of Electrical Engineering Swiss federal Institute of Technology (ETH) Zurich
    • E. Zitzler, M. Laumanns and L. Thiele, "SPEA 2: Improving the Strength Pareto Evolutionary Algorithm", TIK Report 103, Computer Engineering and Networks Laboratory (TIK), Department of Electrical Engineering Swiss federal Institute of Technology (ETH) Zurich, 2001.
    • (2001) TIK Report , vol.103
    • Zitzler, E.1    Laumanns, M.2    Thiele, L.3
  • 21
    • 4344604918 scopus 로고    scopus 로고
    • http://www.tik.ee.ethz.ch/zitzler/testdata.html


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.