A multiobjective ant colony-based optimization algorithm for the bin packing problem with load balancing

2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010

Volumn , Issue , 2010, Pages

  Lara, Oscar D ^a   Labrador, Miguel A ^a  

^a University of South Florida   (United States)

Author keywords

Ant colony optimization; bin packing problem; load balancing; multiobjective optimization

Indexed keywords

ANT-COLONY OPTIMIZATION; BIN PACKING PROBLEM; LOAD-BALANCING; LOCAL SEARCH METHOD; MAX-MIN ANT SYSTEM; MULTI OBJECTIVE; OBJECTIVE FUNCTIONS; OPTIMAL SOLUTIONS; OPTIMIZATION ALGORITHMS; PARETO DOMINANCE; PROBABILISTIC DECISIONS; UPDATING APPROACHES;

APPROXIMATION ALGORITHMS; ARTIFICIAL INTELLIGENCE; BINS; EVOLUTIONARY ALGORITHMS; PARALLEL ARCHITECTURES;

MULTIOBJECTIVE OPTIMIZATION;

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

References (17)

1. C. Boutevin, M. Gourgand, and S. Norre. Bin Packing Extensions for Solving an Industrial Line Balancing Problem. Assembly and Task Planning, pages 115-121, 2003.
2. K. Doerner, R. Hartl, F. Reimann, and M. Compet. Ants for Problem Solving - The Case of Full Truckload Transportation. Central European Journal for Operations Research and Economics, 11(2):115-141, 2003.
3. K.F. Doerner, W.J. Gutjahr, R.F. Hartl, C. Strauss, and C. Stummer. Pareto Ant Colony Optimization in Multiobjective Project Portfolio Selection with ILP Preprocessing. European Journal of Operational Research, 171(3):830-841, 2006.
4. M. Dorigo and T. Sttzle. Ant Colony Optimization. The MIT Press, 2001.
5. Gyrgy Dsa. The Tight Bound of First Fit Decreasing Bin-Packing Algorithm is FFD(I) = 11/9OPT(I) + 6/9. Department of Mathematics, University of Pannonia, Hungary, 2007.
6. F. Ducatelle. Ant Colony Optimisation for Bin Packing and Cutting Stock Problems. Master of Science Thesis, University of Edinburgh, 2001.
7. E. Falkenauer and A. Delchambre. A Genetic Algorithm for Bin Packing and Line Balancing. IEEE International Conference on Robotics and Automation, 2:1186-1192, 1992. (Pubitemid 23595076)
8. M. Garey and D. Johnson. Computers and Inctractability: A Guide to the Theory of NP-completeness. 1979.
9. S. Goss, S. Aron, J. Deneubourg, and J. M. Pasteels. The Self-organized Exploratory Pattern of the Argentine Ant. Naturwissenschaften, 76:579-581, 1989. (Pubitemid 20073252)
10. S. Iredi, Merkle D., and M. Middendorf. Bi-criterion Optimization with Multi Colony Ant Algorithms. volume 1993, pages 359-372, 2001.
11. R. Karp. Reducibility Among Combinatorial Problems. Complexity of Computer Computations, pages 85-103, 1972.
12. O. Lara, M. Maradei, and C. Ardila. Analysis and Comparison of Evolutionary Strategies for Hybrid Ant Colony Algorithms to Solve Multiobjective Multicast Network Problems. Bachelor's thesis for the degree of Systems Engineer. Universidad del Norte, Colombia, 2007.
13. J. Levine and F. Ducatelle. Ant Colony Optimization and Local Search for Bin Packing and Cutting Stock Problems. Journal of the Operational Research Society, 55:705-716, 2004.
14. K.H. Liang, X. Yao, C. Newton, and D. Hoffman. A New Evolutionary Approach to Cutting Stock Problems with and without Contiguity. Computers and Operations Research, 29:1641-1659, 2001.
15. D.S. Liu, K.C. Tan, C.K. Goh, and W.K. Ho. On Solving Multiobjective Bin Packing Problems Using Particle Swarm Optimization. Evolutionary Computation, pages 2095-2102, 2006.
16. V. Tkindt, N. Monmarch, F. Tercinet, and D. Lagt. An Ant Colony Optimization Algorithm to Solve a 2-machine Bicriteria Flowshop Scheduling Problem. European Journal of Operational Research, 142(2):250-257, 2002. (Pubitemid 34803131)
17. Z. Zhang, W. Cheng, L. Tang, and Cheng Y. Improved Ant Colony Optimization for One-Dimensional Bin Packing Problem with Precedence Constraints. Natural Computation, 4:539-543, 2007.