Evolution of hyperheuristics for the biobjective 0/1 knapsack problem by multiobjective genetic programming

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 1227-1234

  Kumar, Rajeev ^a   Banka, Krishna K ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

0 1 knapsack problem; Combinatorial optimization; Genetic algorithm; Genetic programming; Heuristics; Multiobjective optimization; Optimization methods; Pareto front

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; GENETIC ALGORITHMS; GENETIC PROGRAMMING; HEURISTIC METHODS; INTEGER PROGRAMMING; OPTIMIZATION; PARETO PRINCIPLE; POLYNOMIAL APPROXIMATION;

0-1 KNAPSACK PROBLEM; 0/1 KNAPSACK PROBLEMS; APPROXIMATE SOLUTIONS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMBINATORIAL PROBLEMS; GENETIC PROGRAMMING SYSTEMS; GP SYSTEMS; HEURISTICS; HYPERHEURISTICS; MULTIOBJECTIVE; MULTIOBJECTIVE GENETIC PROGRAMMINGS; NP-HARD; OPTIMIZATION METHODS; PARETO FRONT; PARETO FRONTS; PARETO OPTIMAL SOLUTIONS; POLYNOMIAL TIMES;

MULTIOBJECTIVE OPTIMIZATION;

EID: 57349098204     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. V. Barichard and J.-K. Hao. Genetic tabu search for the multi-objective knapsack problem. Journal of Tsinghua Science and Technology, 8(1):8-13, 2003.
2. th International Conference on Parallel Problem Solving from Nature (PPSN 2006), LNCS 4193, pages 860-869, Reykjavik , Iceland, September 2006. Springer Berlin / Heidelberg.
3. E. K. Burke, M. Hyde, G. Kendall, and J. Woodward. Automatic heuristic generation with genetic programming: Evolving a jack-of-all-trades or a master of one. In Genetic and Evolutionary Computation Conference (GECCO-2007), pages 1559-1565, London, UK, July 2007.
4. C. Chekuri and S. Khanna. A PTAS for the multiple knapsack problem. In Proc. of 11th Annual ACM-SIAM symposium on Discrete Algorithms, pages 213-222, 2000.
5. P. Chu and J. Beasley. A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics, 4(1):63-86, June 1998.
6. K. Deb. Multiobjective Optimization Using Evolutionary Algorithms. Chichester, UK: Wiley, 2001.
7. th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL'02), volume 1, pages 13-20, November 2002, Nanyang Technical University, Singapore.
8. T. Erlebach, H. Kellerer, and U. Pferschy. Approximating multiobjective knapsack problems. Management Science, 48:1603-1612, 2002.
9. th International Conference of Genetic Algorithms, pages 416-423. Morgan Kaufmann, 1993.
10. A. Frieze and M. Clarke. Approximation algorithms for m-dimensional 0-1 knapsack problem: Worst case and probabilistic analysis. European Journal, Operations Research, 15:100-109, 1984.
11. X. Gandibleux and A. Freville. Tabu search based procedure for solving the 0-1 multi-objective knapsack problem: The two objectives case. Journal of Heuristics, 6(3):361-383, August 2000.
12. F. S. Hanafi. The multidimensional 0-1 knapsack problem-bounds and computational aspects. Annals of Operations Research, 139(1): 195-227, October 2005.
13. F. Hembecker, H. S. Lopes, and W. G. Jr. Particle swarm optimization for the multidimensional knapsack problem. Lecture Notes in Computer Science, 4431:358-365, 2007.
14. O. H. Ibarra and C. E. Kim. Fast approximation algorithms for the knapsack and sum of subset problem. Journal of ACM, 22:463-468, 1984.
15. 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:402-412, 2002.
16. J. Knowles and D. Corne. M-PAES: A memetic algorithm for multiobjective optimization. In Proceedings of the 2000 Congress on Evolutionary Computation CEC00, pages 325-332, California, USA, 6-9 2000. IEEE Press.
17. J. Knowles and D. Corne. On metrics for comparing nondominated sets. In Congress on Evolutionary Computation (CEC'2002), volume 1, pages 711-716, Piscataway, New Jersey, May 2002. IEEE Press.
18. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
19. R. Kumar and N. Banerjee. Running time analysis of a multiobjective evolutionary algorithm on simple and hard problems. In Proceedings of Foundations of Genetic Algorithms(FOGA-05), volume 3469 of LNCS, pages 112-131. Springer, 2005.
20. R. Kumar and N. Banerjee. Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem. Theoretical Computer Science, 358(1):104-120, July 2006.
21. 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, July 2002.
22. R. Kumar, P. K. Singh, A. P. Singhal, and A. Bhartia. Evolutionary and heuristic algorithms for 0-1 knapsack problem. In A. Tiwari et al., editors, Applications of Soft Computing, volume 36 of Advances in Soft Computing, pages 331-340. Springer, 2006.
23. E. L. Lawler. Fast approximation algorithms for knapsack problems. Mathematics of Operations Research, 4(4):339-356, November 1979.
24. M. J. Magazine and O. Oguz. A fully polynomial approximation algorithm for the 0-1 knapsack problem. European Journal of Operational Research, 8(3):270-273, November 1981.
25. G. Raidl. An improved genetic algorithm for the multiconstrained 0-1 knapsack problem. In Proc. IEEE Conference on Evolutionary Computation., pages 207-211, 1998.
26. S.Goddard. Dynamic programming for 0-1 knapsack problem. http://www.ese.unl.edu/~goddard/Courses/CSCE310J/Lectures/Lecture8- DynamicProgramming.pdf.
27. 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.