A new grouping genetic algorithm for the Multiple Knapsack Problem

2008 IEEE Congress on Evolutionary Computation, CEC 2008

Volumn , Issue , 2008, Pages 2225-2232

  Fukunaga, Alex S ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINS; BOOLEAN FUNCTIONS; GENETIC ALGORITHMS; INTEGER PROGRAMMING;

CANDIDATE SOLUTIONS; GROUPING GENETIC ALGORITHMS; MULTIPLE KNAPSACK PROBLEMS; NEW ALGORITHMS;

EVOLUTIONARY ALGORITHMS;

EID: 55749092759     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2008.4631094     Document Type: Conference Paper

References (16)

1. G. Raidl, "The multiple container packing problem: A genetic algorithm approach with weighted codings," ACM SIGAPP Applied Computing Review, pp. 22-31, 1999.
2. S. Martello and P. Toth, Knapsack problems: algorithms and computer implementations. John Wiley & Sons, 1990.
3. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems. Springer-Verlag, 2004.
4. J. Kalagnanam, A. Davenport, and H. Lee, "Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand," Electronic Commerce Research, vol. 1, pp. 221-238, 2001.
5. M. Labbé, G. Laporte, and S. Martello, "Upper bounds and algorithms for the maximum cardinality bin packing problem," European Journal of Operational Research, vol. 149, pp. 490-498, 2003.
6. S. Eilon and N. Christofides, "The loading problem," Management Science, vol. 17, no. 5, pp. 259-268, 1971.
7. E. Falkenauer, "A new representation and operators for genetic algorithms applied to grouping problems," Evolutionary Computation, vol. 2, no. 2, pp. 123-144, 1994.
8. _, "A hybrid grouping genetic algorithm for bin packing," Journal of Heuristics, vol. 2, pp. 5-30, 1996.
9. E. Coffman, M. Garey, and D. Johnson, "Approximation algorithms for bin packing: A survey," in Approximation Algorithms for NP-Hard Problems, D. Hochbaum, Ed. PWS Publishing, 1996.
10. S. Martello and P. Toth, "Heuristic algorithms for the multiple knapsack problem," Computing, vol. 27, pp. 93-112, 1981.
11. D. Pisinger, "An exact algorithm for large multiple knapsack problems," European Journal of Operational Research, vol. 114, pp. 528-541, 1999.
12. G. Raidl and G. Kodydek, "Genetic algorithms for the multiple container packing problem," in Proc. 5th International Conf. on Parallel Problem Solving from Nature V, Amsterdamm, The Netherlands, ser. Lecture Notes in Computer Science 1498, 1998, pp. 875-884.
13. C. Reeves, "Hybrid genetic algorithms for bin-packing and related problems," Annals of Operations Research, vol. 63, pp. 371-396, 1996.
14. A. Fukunaga and R. Korf, "Bin-completion algorithms for multicontainer packing, knapsack, and covering problems," Journal of Artificial Intelligence Research, vol. 28, pp. 393-4129, 2007.
15. D. Whitley, "The genitor algorithm and selection pressure: Why rankbased allocation of reproductive trials is best," in Proc. International Conf. on Genetic Algorithms (ICGA), 1989, pp. 116-121.
16. D. Mitchell, B. Selman, and H. Levesque, "Hard and easy distributions of SAT problems," in Proceedings of AAAI, 1992, pp. 459-65.