Multiobjective memetic algorithms for time and space assembly line balancing
View/Open
multiobjetive.pdf (873,8Kb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Document typeArticle
Defense date2012-01-11
Rights accessRestricted access - publisher's policy
Abstract
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 compared in order to determine the most suitable intensification–diversification trade-off for the memetic search process. Once a preliminary study on nine well-known problem instances is accomplished with a very good performance, the proposed memetic algorithms are applied considering real-world data from a Nissan plant in Barcelona (Spain). Outstanding approximations to the pseudo-optimal non-dominated solution set were achieved for this industrial case study.
CitationChica, M. [et al.]. Multiobjective memetic algorithms for time and space assembly line balancing. "Engineering applications of artificial intelligence", 11 Gener 2012, vol. 25, núm. 2, p. 254-273.
ISSN0952-1976
Publisher versionhttp://dx.doi.org/10.1016/j.engappai.2011.05.001
Collections
Files | Description | Size | Format | View |
---|---|---|---|---|
multiobjetive.pdf![]() | 873,8Kb | Restricted access |
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain