dc.contributor
Universitat Politècnica de Catalunya. Departament d'Organització d'Empreses
dc.contributor
Universitat Politècnica de Catalunya. OPE - Organització de la Producció i d'Empresa (aspectes tècnics, jurídics i econòmics en Producció)
dc.contributor.author
Chica Serrano, Manuel
dc.contributor.author
Cordón García, Oscar
dc.contributor.author
Bautista Valhondo, Joaquín
dc.contributor.author
Damas Arroyo, Sergio
dc.date.issued
2011-04-11
dc.identifier
Chica, M., Cordón, O., Bautista, J., Damas, S. A multiobjective memetic ant colony optimization algorithm for the 1/3 variant of the time and space assembly line balancing problem. A: "2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS 2011) Proceedings". Los Alamitos (California): IEEE Computer Society Conference Publishing Services (CPS), 2011, p. 16-22.
dc.identifier
978-1-61284-332-2
dc.identifier
https://hdl.handle.net/2117/90833
dc.description.abstract
We present some results attained with two variants of the bounded dynamic programming algorithm to solve the Fm|block|Cmax problem using as experimental data the wellknown Taillard instances. We have improved the best-known solutions for four of the Taillard’s instances
dc.description.abstract
Postprint (published version)
dc.format
application/pdf
dc.publisher
IEEE Computer Society Conference Publishing Services (CPS)
dc.relation
http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5937060
dc.rights
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.rights
Restricted access - publisher's policy
dc.subject
Àrees temàtiques de la UPC::Economia i organització d'empreses
dc.subject
Time and space assembly line balancing considers realistic multiobjective versions of the classical assembly line balancing industrial problems
dc.subject
involving the joint optimization of conflicting criteria such as the cycle time
dc.subject
the number of stations
dc.subject
and/or the area of these stations. The aim of this contribution is to present a new multiobjective memetic algorithm based on ant colony optimization for the 1/3 variant of this family of industrial problems. This variant involves the joint minimisation of the number and the area of the stations
dc.subject
given a fixed cycle time limit. The good behaviour of the proposal is shown in nine problem instances
dc.subject
Programació heurística
dc.title
A multiobjective memetic ant colony optimization algorithm for the 1/3 variant of the time and space assembly line balancing problem
dc.type
Part of book or chapter of book
