A new approach for solving 0/1 knapsack problem

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn 4, Issue , 2006, Pages 3138-3143

  Lee, Chou Yuan ^b   Lee, Zne Jung ^a,c   Su, Shun Feng ^a,d  

^a IEEE   (Taiwan)

^b LAN YANG INSTITUTE OF TECHNOLOGY   (Taiwan)

^c HUAFAN UNIVERSITY   (Taiwan)

^d NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONSTRAINT THEORY; MATHEMATICAL MODELS; OPTIMIZATION;

KNAPSACK PROBLEM; REMARKABLE PERFORMANCE;

PROBLEM SOLVING;

EID: 34548128848     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2006.384598     Document Type: Conference Paper

References (24)

1. Jaszakiewicz, A. "On the Performance of Multiple Objective Genetic Local Search on the 0/1 Knapsack Problem-A Comparative Experiment," IEEE Trans. On Evolutionary Computation, vol. 6, pp 402-412, 2002.
2. Balas. E., Zemel, E. "Solving large zero-one knapsack problems," Operation Research, vol. 28, pp 1130-1154 1980.
3. M. Dorigo, and G. D. Caro, "Ant colony optimization: A new meta-heuristic," Proceedings of the 1999 congress on evolutionary computation, vol. 2, pp. 1470-1477, 1999.
4. V. Maniezzo, and A. Colorni, "The ant system applied to the quadratic assignment problem," IEEE Transactions on knowledge and data engineering, vol. 11, 769-778, 1999.
5. Dorigo L. M., maniezzo V., and Colorni A., "The Ant System: Optimization by a Colony of Cooperating Agents," IEEE Transactions on System, Man, and Cybernetics-part B, Vol. 26, no. 1, pp. 29-41, 1996.
6. Dorigo, M., Gambardella, L.M., "Ant Colony System: A Cooperative Leming Approach to the Traveling Salesman Problem," IEEE Transactions on Evolutionary Computation, Vol. 1, no. 1, pp. 53-66, 1997.
7. W. K. Lai and G. G. Coghill, "Channel assignment through evolutionary optimization," IEEE Trans. vehicular technology, vol. 45, pp. 91-96, 1998.
8. Bohachevsky, I. O., M. E. Johnson, and M. L. Stein, "Generalized simulated annealing for function optimization," Technometric, vol. 28, pp 209-217, 1986.
9. Vreville, A., Plateau, G., "Heuristics and reduction methods for multiple constraints 0-1 linear programming problems," European J. of Operational Research, vol. 24, pp 206-215, 1986.
10. Jaszkiewicz, A., "Comparison of Local Search-based Metaheuristics on the Multiple Objective Knapsack Problem," Foundations of Computing and Decision Sciences, vol. 26, pp. 99-120, 2001.
11. Dckker, A. and E. H. L. Aarts, "global optimization and simulated annealing," Mathematical Programming 50, pp. 367-393, 1991.
12. Aho, A. V., Hopcroft, J. E., Ullman, J. D., Data Structures and Algorithms. Reading, Mass., Addison-Wesley Publishing Company, 1983.
13. Senyu, S., Toyoda, Y. "An approach to linear programming with 0-1 variables. Management Science 15, B196-B207, 1968
14. Shin, W., "A branch and bound method for the multiconstraint zero-one knapsack problem." J. Opl. Res. Soc. 30, 369-378, 1979
15. Gavish, B., Pirkul, H., "Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality," Maht. Programming 31, 78-105, 1985.
16. Freville, A., Patcau, G., "Heuristics and reduction methods for multiple constraints 0-1 linear programming problems," European J. of Operational Research 24, 206-215, 1986.
17. Garcy, M., Johnson, D., Computers and Intractability: A guide to the Theory of NP-Completeness., San Francisco, Freeman 1979.
18. T. Stutzle and H. Hoos, "MAX-MIN ant system and local search for the Traveling Salesman Problems," IEEE international conference on evolutionary computation, pp. 299-314, 1997.
19. T. Stutzle and M. Dorigo, Ant colony optimization, MIT Press, 2004
20. L. Wang and K. Smith, "On chaotic simulated annealing," IEEE Trans, Neural Netw., vol. 9, no. 4, pp. 716-718, Jun. 1998.
21. Dorigo, M., Gambardella, L.M., "Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem," IEEE Transactions on Evolutionary Computation, Vol. 1, no. 1, pp. 53-66, 1997.
22. S. Sahni, "Approximate algorithms for the 0-1 kanpsack problem," J. ACM, Vol. 22, pp. 115-224, 1975.
23. Bonabcau, E., Dorigro, M., and Theraulaz, G., "Inspiration for optimization from social insect behaviour," Nature, vol. 406, pp 39-42, 6 July 2000.
24. Pirkul, H.,"A Heuristic solution procedure for the Multiconstraint Zero-One Knapsack Problem," Naval Research Logistics, Vol. 34, pp. 161-172, 1985.