Incorporating Preferences to a Multi-objective Ant Colony Algorithm for Time and Space Assembly Line Balancing
We present an extension of a multi-objective algorithm based on Ant Colony Optimisation to solve a more realistic variant of a classical industrial problem: Time and Space Assembly Line Balancing. We study the influence of incorporating some domain knowledge by guiding the search process of the algorithm with preferences-based dominance. Our approach is compared with other techniques, and every algorithm tackles a real-world instance from a Nissan plant. We prove that the embedded expert knowledge is even more justified in a real-world problem.
KeywordsDomain Knowledge Pareto Front Optimal Pareto Front Assembly Line Balance Assembly Line Balance Problem
Unable to display preview. Download preview PDF.
- 2.Scholl, A.: Balancing and Sequencing of Assembly Lines, 2nd edn. Physica-Verlag, Heidelberg (1999)Google Scholar
- 3.Chica, M., Cordón, O., Damas, S., Bautista, J., Pereira, J.: 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-08-01, European Centre for Soft Computing, Asturias (Spain) (2008)Google Scholar
- 4.Barán, B., Schaerer, M.: A multiobjective ant colony system for vehicle routing problem with time windows. In: 21st IASTED Conf., Germany, pp. 97–102 (2003)Google Scholar