Ant colony optimization for the single model U-type assembly line balancing problem

International Journal of Production Economics

Volumn 120, Issue 2, 2009, Pages 287-300

  Sabuncuoglu, Ihsan ^a   Erel, Erdal ^a   Alp, Arda ^b  

^a BILKENT UNIVERSITY   (Turkey)

^b EPFL   (Switzerland)

Author keywords

Ant colony optimization; General assignments problem; Metaheuristic; U type assembly line balancing problem

Indexed keywords

ANT COLONY ALGORITHMS; ANT COLONY OPTIMIZATION; ASSEMBLY LINE; ASSEMBLY LINE BALANCING PROBLEMS; BEST-KNOWN ALGORITHMS; EXPERIMENTAL STUDIES; GENERAL ASSIGNMENTS PROBLEM; METAHEURISTIC; PERFORMANCE MEASURE; PRECEDENCE CONSTRAINTS; PRODUCTION LINE; U-TYPE ASSEMBLY LINE; U-TYPE ASSEMBLY LINE BALANCING PROBLEM;

ASSEMBLY; ASSEMBLY MACHINES; HEURISTIC METHODS; OPTIMIZATION;

ALGORITHMS;

EID: 67651163455     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2008.11.017     Document Type: Article

References (62)

1. Aase G.R., Schniederjahn M.J., and Olson J.R. U-OPT: an analysis of exact U-shaped line balancing procedures. International Journal of Production Research 41 (2003) 4185-4210
2. Aase G.R., Olson J.R., and Schniederjahn M.J. U-shaped assembly line layouts and their impact on labor productivity: an experimental study. European Journal of Operational Research 156 (2004) 698-711
3. Alp, A., 2004. Ant colony optimization for the single model U-type assembly line balancing problem. Unpublished MS Thesis, Department of Industrial Engineering, Bilkent University.
4. Bautista, J., Pereira, J., 2002. Ant algorithms for assembly line balancing. In: Lecture Notes in Computer Science, vol. 2463, pp. 65-75.
5. Bautista J., and Pereira J. Ant algorithms for a time and space constrained assembly line balancing problem. European Journal of Operational Research 177 (2007) 2016-2032
6. Besten M., Stützle T., and Dorigo M. Ant colony optimization for the total weighted tardiness problem. In: Schoenauer M., Deb K., Rudolph G., Yao X., Lutton E., Merelo J.J., and Schwefel H.P. (Eds). Parallel Problem Solving from Nature: Sixth International Conference. Lecture Notes in Computer Science vol. 1917 (2000), Springer, Berlin 611-620 (also available as Technical Report IRIDIA/99-16. Université Libre de Bruxelles, Belgium)
7. Besten, M.L., Stützle, T., Dorigo, M., 2000. An ant colony optimization application to the single machine total weighted tardiness problem. In: Dorigo, M., Middendorf, M., Stützle, T. (Eds.), Abstract Proceedings of ANTS'2000: From Ant Colonies to Artificial Ants: Second International Workshop on Ant Algorithms, Brussels, Belgium, pp. 39-42.
8. Blum, C., Sampels, M., 2002. Ant colony optimization for fop shop scheduling: a case study on different pheromone representations. In: Proceedings of 2002 Congress on Evolutionary Computation (CEC '02), vol. 2. IEEE Computer Society Press, pp. 1558-1563.
9. Botee H.M., and Bonabeau E. Evolving ant colony optimization. Advance Complex Systems 1 (1998) 149-159
10. Boysen N., and Fliedner M. A versatile algorithm for assembly line balancing. European Journal of Operational Research 184 (2008) 39-56
11. Bullnheimer B., Hartl R.F., and Strauss C. A new rank-based version of the ant system: a computational study. Central European Journal for Operations Research and Economics 7 1 (1999) 25-38
12. Chiang W.C., and Urban T.L. The stochastic U-line balancing problem: a heuristic procedure. European Journal of Operational Research 175 (2006) 1767-1781
13. Colorni A., Dorigo M., and Maniezzo V. An investigation of some properties of an ant algorithm. In: Manner R., and Manderick B. (Eds). Proceedings of the Parallel Problem Solving from Nature Conference (PPSN 92), Brussels, Belgium (1992), Elsevier, Amsterdam 509-520
14. Colorni, A., Dorigo, M., Maniezzo, V., 1991. Distributed optimization by ant colonies. In: Proceedings of ECAL91-European Conference on Artificial Life, Paris, France. Elsevier, Amsterdam, pp. 134-142.
15. Dorigo M., and Blum C. Ant colony optimization theory: a survey. Theoretical Computer Science 344 2-3 (2005) 243-278
16. Dorigo M., and Gambardella L.M. A study of some properties of Ant-Q. In: Voigt H.M., Ebeling W., Rechenberg I., and Schwefel H.S. (Eds). Proceedings of PPSN IV-Fourth International Conference on Parallel Problem Solving From Nature (1996), Springer, Berlin 656-665
17. Dorigo M., and Gambardella L.M. Ant colony system: a cooperative learning approach to the travelling salesman problem. IEEE Transactions on Evolutionary Computation 1 1 (1997) 53-66
18. Dorigo M., and Gambardella L.M. Ant colonies for the traveling salesman problem. BioSystems 43 (1997) 73-81
19. Dorigo, M., Maniezzo, V., Colorni, A., 1991a. Ant system: an autocatalytic optimizing process. Technical Report 91-016 Revised, Dipartmentio di Eletronica e Informazione, Politecnico di Mileno, Italy.
20. Dorigo, M., Maniezzo, V., Colorni, A., 1991b. Positive feedback as a search strategy. Technical Report 91-016, Dipartmentio di Eletronica, Politecnico di Mileno, Italy.
21. Dorigo M., Maniezzo V., and Colorni A. The ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B 26 1 (1996) 1-13
22. Dorigo, M., Socha, K., 2007. An introduction to ant colony optimization. In: Gonzalez, T.F. (Ed.), Handbook Approximation Algorithms and Metaheuristics. Chapman and Hall/CRC Press.
23. Dorigo, M., Stützle, T., 2000. The ant colony optimization metaheuristic: algorithms, applications, and advances. Technical Report, IRIDIA/2000-32, IRIDIA, University Libre de Bruxelles, Belgium.
24. Dorigo M., and Stützle T. Ant Colony Optimization (2004), MIT Press, Cambridge, MA
25. Erel E., Sabuncuoglu I., and Aksu B.A. Balancing of U-type assembly systems using simulated annealing. International Journal of Production Research 39 (2001) 3003-3015
26. Fenet, S., Hassas, S., 2000. A.N.T.: a distributed problem-solving framework based on mobile agents. In: Lasker, G.E., Dospisil, J., Kendall, E., Kendall, (Eds.), Advances in Mobile Agents Systems Research, vol. 1. Theory and Practice, MAA'2000, International Institute for Advanced Studies in Systems Research and Cybernetics, pp. 39-44.
27. Gagné, C., Gravel, M., Price, W.L., 2001. A look-ahead addition to the ant colony optimization algorithm and its application to an industrial scheduling problem. In: Proceedings of 4th Metaheuristics International Conference (MIC'2001), Porto, Portugal, pp. 79-84.
28. Gajpal Y., and Rajendran C. An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops. International Journal of Production Economics 101 (2006) 259-272
29. Gambardella L.M., and Dorigo M. Ant-Q: a reinforcement learning approach to the travelling salesman problem. In: Prieditis A., and Russell S. (Eds). Proceedings of 12th International Conference on Machine Learning (ML-95) (1995), Morgan Kaufmann, Palo Alto, CA 252-260
30. Guerriero F., and Miltenburg J. The stochastic U-line balancing problem. Naval Research Logistics 50 (2003) 31-57
31. Hertz A., and Widmer M. Guidelines for the use of meta-heuristics in combinatorial optimization. European Journal of Operational Research 151 (2003) 247-252
32. Hoffmann T.R. Assembly line balancing-a set of challenging problems. International Journal of Production Research 28 (1990) 1807-1815
33. Hoffmann T.R. EUREKA: a hybrid system for assembly line balancing. Management Science 38 (1992) 39-42
34. Holland J.F. Adaptation in Natural and Artificial Systems (1975), MIT Press, Cambridge, MA
35. Johnson D.S., Aragon C.R., McGeoch L.A., and Schevon C. Optimization by simulated annealing: an experimental evaluation; Part I, graph partitioning. Operations Research 37 (1989) 865-892
36. Johnson D.S., Aragon C.R., McGeoch L.A., and Schevon C. Optimization by simulated annealing: an experimental evaluation. Part II: graph coloring and number partitioning. Operations Research 39 (1991) 378-406
37. Kara Y., Ozcan U., and Peker A. Balancing and sequencing mixed-model just-in-time U-lines with multiple objectives. Applied Mathematics and Computation 184 (2007) 566-588
38. Kim Y.K., Kim S.J., and Kim J.Y. Balancing and sequencing mixed-model U-lines with a co-evolutionary algorithm. Production Planning & Control 11 8 (2000) 754-764
39. Krishnaiyer, K., Cheraghi, S.H., 2002. Ant algorithms: review and future applications. In: Proceedings of IERC'02, Industrial Engineering Research Conference, Orlando, FL, USA.
40. Lin B.M.T., Lu C.Y., Shyu S.J., and Tsai C.Y. Development of new features of ant colony optimization for flowshop scheduling. International Journal of Production Economics 112 (2008) 742-755
41. Maniezzo V., and Carbonaro A. Ant colony optimization: an overview. In: Ribeiro C. (Ed). Essays and Surveys in Metaheuristics (2001), Kluwer Academic Press, Dordrecht 21-44
42. McMullen P.R., and Tarasewich P. Using ant techniques to solve the assembly line balancing problem. IIE Transactions 35 (2003) 605-617
43. Middendorf, M., Reischle, F., Schmeck, H., 2002. Multi colony ant algorithms. Journal of Heuristics, 305-320.
44. Miltenburg, G.J., Sparling, D., 1995. Optimal solution algorithms for the U-line balancing problem. Working Paper, McMaster University, Hamilton, Ontario, Canada.
45. Miltenburg G.J., and Wijngaard J. The U-line line balancing problem. Management Science 40 10 (1994) 1378-1388
46. Miltenburg J. Balancing U-lines in a multiple U-line facility. European Journal of Operational Research 109 (1998) 1-23
47. Miltenburg J. One-piece flow manufacturing on U-shaped production lines: a tutorial. IIE Transactions 33 (2001) 303-321
48. Miltenburg J. The effect of breakdowns on U-shaped production lines. International Journal of Production Research 38 (2000) 353-364
49. Montgomery, J., Randall, M., 2002. Alternative pheromone applications for ant colony optimization, Technical Report TR02-07, School of Information Technology, Bond University, Australia.
50. Nakade K., and Ohno K. An optimal worker allocation problem for a U-shaped production line. International Journal of Production Economics 60 1 (1999) 353-358
51. Nakade K., and Ohno K. Separate and carousel type allocations of workers in a U-shaped production line. European Journal of Operational Research 145 (2003) 403-424
52. Nourie F.J., and Venta E.R. Finding optimal line balances with OptPack. Operations Research Letter 10 (1991) 165-171
53. Scholl, A., 1993. Data of assembly line balancing problems. Schriften zur Quantitativen Betriebswirtschaftslehre 16/93, TU Darmstadt.
54. Scholl A., and Klein R. ULINO: optimally balancing U-shaped JIT assembly lines. International Journal of Production Research 37 4 (1999) 721-736
55. Sparling D. Balancing just-in-time production units: the N U-line balancing problem. Information Systems and Operational Research 36 4 (1998) 215-237
56. Sparling D., and Miltenburg J. The mixed-model U-line balancing problem. International Journal of Production Research 36 2 (1998) 485-501
57. Stützle, T., 1998. An ant approach to the flow shop problem. In: Proceedings of the Sixth European Congress on Intelligent Techniques and Soft Computing (EU-FIT'98), Verlag Mainz, Aachen, 3, pp. 1560-1564.
58. Stützle T., and Dorigo M. ACO algorithms for the travelling salesman problem. In: Miettinen K., Makela M., Neittaanmaki P., and Periaux J. (Eds). Evolutionary Algorithms in Engineering and Computer Science: Recent Advances in Genetic Algorithms, Evolution Strategies, Evolutionary Programming, Genetic Programming and Industrial Applications (1999), Wiley, New York 163-183
59. T'kindt V., Monmarché N., Tercinet F., and Laügt D. An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. European Journal of Operational Research 142 (2002) 250-257
60. Talbot F.B., Patterson J.H., and Gehrlein W.V. A comparative evaluation of heuristic line balancing techniques. Management Science 32 (1986) 430-454
61. Urban T.L. Optimal balancing of U-shaped assembly lines. Management Science 44 (1998) 738-741
62. Urban T.L., and Chiang W.C. An optimal piecewise-linear program for the U-line balancing problem with stochastic task times. European Journal of Operational Research 168 (2006) 771-782