Advertisement

Memetic Computing

, Volume 3, Issue 1, pp 15–24 | Cite as

A new diversity induction mechanism for a multi-objective ant colony algorithm to solve a real-world time and space assembly line balancing problem

  • Manuel Chica
  • Oscar Cordón
  • Sergio Damas
  • Joaquín Bautista
Special Issue - Regular Research Paper

Abstract

Time and space assembly line balancing considers realistic multi-objective versions of the classical assembly line balancing industrial problems. It involves the joint optimisation of conflicting criteria such as the cycle time, the number of stations, and/or the area of these stations. The different problems included in this area also inherit the precedence constraints and the cycle time limitations from assembly line balancing problems. The presence of these hard constraints and their multi-criteria nature make these problems very hard to solve. Multi-objective constructive metaheuristics (in particular, multi-objective ant colony optimisation) have demonstrated to be suitable approaches to solve time and space assembly line balancing problems. The aim of this contribution is to present a new mechanism to induce diversity in an existing multi-objective ant colony optimisation algorithm for the 1/3 variant of the time and space assembly line balancing problem. This variant is quite realistic in the automative industry as it involves the joint minimisation of the number and the area of the stations given a fixed cycle time limit. The performance of our proposal is validated considering ten real-like problem instances. Moreover, the diversity induction mechanism is also tested on a real-world instance from the Nissan plant in Barcelona (Spain).

Keywords

Time and space assembly line balancing problem Ant colony optimisation Multi-objective optimisation Automotive industry 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barán B, Schaerer M (2003) A multiobjective ant colony system for vehicle routing problem with time windows. In: 21st IASTED international conference, Innsbruck, Germany, pp 97–102Google Scholar
  2. 2.
    Bautista J, Pereira J (2007) Ant algorithms for a time and space constrained assembly line balancing problem. Eur J Oper Res 177: 2016–2032zbMATHCrossRefGoogle Scholar
  3. 3.
    Baybars I (1986) A survey of exact algorithms for the simple assembly line balancing problem. Manage Sci 32(8): 909–932zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Chankong V, Haimes YY (1983) Multiobjective decision making theory and methodology. North-Holland, AmsterdamzbMATHGoogle Scholar
  5. 5.
    Chica M, Cordón O, Damas S, Bautista J (2009) Multi-objective, constructive heuristics for the 1/3 variant of the time and space assembly line balancing problem: ACO and randomised greedy. Technical Report AFE-09-01, European Centre for Soft Computing, Asturias, Spain. (submitted to Information Sciences)Google Scholar
  6. 6.
    Chica M, Cordón O, Damas S, Bautista J, Pereira JA (2008) Multiobjective ant colony optimization algorithm for the 1/3 variant of the time and space assembly line balancing problem. In: 12th International conference on processing and management of uncertainty in knowledge-based systems (IPMU), Málaga Spain, pp 1454–1461 JuneGoogle Scholar
  7. 7.
    Chica M, Cordón O, Damas S, Bautista J, Pereira J (2009) On using heuristic information in a multi-objective ACO algorithm for the time and space assembly line balancing problem. In: Middendorf M, Engelbrecht AP (eds) Applied swarm intelligence. Series in studies in computational intelligence, Springer (In press)Google Scholar
  8. 8.
    Coello CA, Lamont GB, Van Veldhuizen DA (2007) Evolutionary algorithms for solving multi-objective problems (2nd edn). Springer, BerlinzbMATHGoogle Scholar
  9. 9.
    Dorigo M, Gambardella L (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1): 53–66CrossRefGoogle Scholar
  10. 10.
    Dorigo M, Stützle T (2004) Ant colony optimization. MIT Press, CambridgezbMATHCrossRefGoogle Scholar
  11. 11.
    García Martínez C, Cordón O, Herrera F (2007) A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP. Eur J Oper Res 180: 116–148zbMATHCrossRefGoogle Scholar
  12. 12.
    Glover, F, Kochenberger, GA (eds) (2003) Handbook of metaheuristics. Kluwer Academic, DordrechtzbMATHGoogle Scholar
  13. 13.
    Middendorf M, Reischle F, Schmeck H (2002) Multi colony ant algorithms. J Heuristics 8(3): 305–320zbMATHCrossRefGoogle Scholar
  14. 14.
    Scholl A (1999) Balancing and sequencing of assembly lines (2nd edn). Physica-Verlag, HeidelbergGoogle Scholar
  15. 15.
    Scholl A, Becker C (2006) State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur J Oper Res 168(3): 666–693zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Zitzler E, Thiele L, Laumanns M, Fonseca CM, Grunert da Fonseca V (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2): 117–132CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  • Manuel Chica
    • 1
  • Oscar Cordón
    • 1
  • Sergio Damas
    • 1
  • Joaquín Bautista
    • 2
  1. 1.European Centre for Soft ComputingMieresSpain
  2. 2.Nissan Chair, Universitat Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations