Interactive preferences in multiobjective ant colony optimisation for assembly line balancing
نویسندگان
چکیده
In this contribution, we propose an interactive multicriteria optimisation framework for the time and space assembly line balancing problem. The framework allows decision maker interaction by means of reference points to obtain the most interesting non-dominated solutions. The principal components of the framework are the g-dominance preference scheme and a state-of-the-art memetic multiobjective ant colony optimisation approach. In addition, the framework includes a novel adaptive multi-colony mechanism to be able to handle the preferences in an interactive way. Results show how the multiobjective framework can interactively obtain the most useful solutions with higher convergence than previous a priori methods. The experimentation alsomakes use of original data of theNissan Pathfinder engine and practical bounds to define industrially feasible solutions in a set of scenarios. By solving the problem in these scenarios, we show the search guidance advantages of Communicated by V. Loia. This work has been supported by Ministerio de Economía y Competitividad under project SOCOVIFI2 (TIN2012-38525-C02-01 and TIN2012-38525-C02-02), and under PROTHIUS-III: DPI2010-16759, both including EDRF funding. M. Chica (B) · Ó. Cordón · S. Damas European Centre for Soft Computing, Mieres, Spain e-mail: [email protected] S. Damas e-mail: [email protected] Ó. Cordón DECSAI and CITIC-UGR, University of Granada, Granada, Spain e-mail: [email protected] J. Bautista Universitat Politècnica de Catalunya, Barcelona, Spain e-mail: [email protected] using an interactive multiobjective ant colony optimisation method.
منابع مشابه
Adding diversity to two multiobjective constructive metaheuristics for time and space assembly line balancing
We present a new mechanism to introduce diversity into two multiobjective approaches based on ant colony optimisation and randomised greedy algorithms to solve a more realistic extension of a classical industrial problem: time and space assembly line balancing. Promising results are shown after applying the designed constructive metaheuristics to ten real-like problem instances.
متن کاملIncluding different kinds of preferences in a multi-objective ant algorithm for time and space assembly line balancing on different Nissan scenarios
Most of the decision support systems for balancing industrial assembly lines are designed to report a huge number of possible line configurations, according to several criteria. In this contribution, we tackle a more realistic variant of the classical assembly line problem formulation, time and space assembly line balancing. Our goal is to study the influence of incorporating user preferences b...
متن کاملBalancing Parallel Two-Sided Assembly Lines with Ant Colony Optimisation Algorithm
Assembly lines are one of the most frequently used flow oriented production systems in industry. Although only a few researchers have studied them, two-sided assembly lines are usually utilised to produce high-volume large-sized products such as trucks and buses. In this study, more than one two-sided assembly line constructed in parallel are balanced simultaneously using a newly developed ant ...
متن کاملMultiobjective memetic algorithms for time and space assembly line balancing
This paper presents three proposals of multiobjective memetic algorithms to solve a more realistic extension of a classical industrial problem: time and space assembly line balancing. These three proposals are, respectively, based on evolutionary computation, ant colony optimisation, and greedy randomised search procedure. Different variants of these memetic algorithms have been developed and c...
متن کاملMultiobjective constructive heuristics for the 1/3 variant of the time and space assembly line balancing problem: ACO and random greedy search
In this work we present two new multiobjective proposals based on ant colony optimisation and random greedy search algorithms to solve a more realistic extension of a classical industrial problem: time and space assembly line balancing. Some variants of these algorithms have been compared in order to find out the impact of different design configurations and the use of heuristic information. Go...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Soft Comput.
دوره 19 شماره
صفحات -
تاریخ انتشار 2015