Evolutionary and heuristic algorithms for multiobjective 0-1 knapsack problem

Advances in Soft Computing

Volumn 36, Issue , 2006, Pages 331-340

  Kumar, Rajeev ^a,b   Singh, P K ^a   Singhal, A P ^a   Bhartia, Atul ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84860407922     PISSN: 16153871     EISSN: 18600794     Source Type: Book Series    
DOI: 10.1007/978-3-540-36266-1_32     Document Type: Conference Paper

References (21)

1. I. Asho. Interactive Knapsacks: Theory and Applications. Ph.D. Thesis, Tech Report No.:A-2002-13, Department of Computer and Information Sciences, University of Tampere, 2002.
2. C. A. C. Coello, D. A. Van Veldhuizen, and G. B. Lamont. Evolutionary Algorithms for Solving Multiojective Problems. Boston, MA: Kluwer, 2002.
3. K. Deb. Multiobjective Optimization Using Evolutionary Algorithms. Chichester, UK: Wiley, 2001.
4. K. Deb and S. Jain. Running Performance Metrics for Evolutionary Multiobjective Optimization. In Proc. 4th Asia-Pacific Conf. Simulated Evoluation and Learning (SEAL 02), pages 13-20, Singapore, Nov 2002.
5. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan. A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Trans. Evolutionary Computation, 6(2):182-197, April 2002. (Pubitemid 34555372)
6. T. Erlebach, H. Kellerer, and U. Pferschy. Approximating Multiobjective Knapsack Problems. Management Science, 48(12):1603-1612, 2002.
7. M. P.Hansen and A. Jaszkiewicz. Evaluating the Quality of Approximations to the Nondominated Set. Tech. Rep. IMM-REP-1998-7, Tech. Univ. Denmark, March 1998.
8. O.H. Ibarra and C. E. Kim. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problem. J. ACM, 22:463-468, 1984.
9. H. Ishibuchi and K. Narukawa. Comparison of for Evolutionary Multiobjective Optimization with Reference Solution-Based Single-Objective Approach. In Proc. Genetic and Evolutionary Computations Conference (GECCO 05), pages 787-794, ACM, June 2005. (Pubitemid 43226376)
10. A. Jaszkiewicz. On the Performance of Multiobjective Genetic Local Search on the 0-1 Knapsack Problem - A Comparative Experiment. IEEE Transactions on Evolutionary Computation, 6(4):402-412, August 2002. (Pubitemid 35032741)
11. J. D. Knowles and D. W. Corne. M-PAES: A Memetic Algorithm for Multiobjective Optimization. In Proc. IEEE Conference on Evolutionary Computation, pages 325-322, Las Vegas, Nevada, USA, July 2000.
12. J. D. Knowles and D. W. Come. On Metrics for Comparing Nondominated Sets. In Proc. Congress Evolutionary Computation (CEC '02), volume I, pages 711-716, Piscataway, NJ, May 2002. IEEE.
13. R. Kumar and Nlanjan Banerjee. Running Time Analysis of a Multiobjective Evolutionary Algorithm on Simple and Hard Problems. In Proc. Foundations of Genetic Algorithms (FOGA-05), LNCS 3469, pages 112-131, 2005. (Pubitemid 41313310)
14. R. Kumar and P. I. Rockett. Assessing the Convergence of Rank-based Multiobjective Genetic Algorithms. In Proc. 2nd IEE/IEEE Int. Con! Genetic Algorithms in Engineering Systems: Innovations and Applications (Galesia 97), volume 1446, pages 19-23. lEE, London, UK, Sep. 1997.
15. R. Kumar and P.I. Rockett. Improved Sampling of the Pareto-front in Multiobjective Genetic Optimization by Steady-State Evolution: A Pareto Converging Genetic Algorithm. Evolutionary Computation, 10(3):283-314, 2002.
16. G. Raidl. An Improved Genetic Algorithm for the Multiconstrained 0-1 Knapsack Problem. In Proc. IEEE Conference on Evolutionary Computation, pages 207-211, May 1998.
17. J. R. Schott. Fault Tolerant Design Using Single and Multicriteria Genetic Algorithms. Masters Thesis, Department of Aeronautics and Astronautics, MIT, Massachusetts, 1995.
18. D. A. van Veldhuizen. Multiobjective Evolutionary Algorithms: Classifications, Analysis, and New Innovations. Ph.D. Thesis, Technical Report No. AFIT/DSIENG/99-01, Air Force Institute of Technology, Dayton, OH, 1999.
19. Web. Dynamic Programming for 0-1 Knapsack Problem. [http://www.cse.uta. edu/holder/couses/cse2320/lectures/115/node12.html].
20. E. Zitzler, M. Laumanns, , and L. Thiele. SPEA2: Improving the Strength Pareto Evolutionary Algorithm. In Proc. Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems (EUROGEN), Sep. 2001.
21. E. Zitzler and L. Thiele. Multiobjective Evolutionary Algorithms: a Comparative Case Study and the Strength Pareto Approach. IEEE Trans. Evolutionary Computation, 3:257-271, 1999. (Pubitemid 30544879)