A multi-objective car sequencing problem on two-sided assembly lines
Parames Chutima () and
Additional contact information
Parames Chutima: Chulalongkorn University
Sathaporn Olarnviwatchai: Chulalongkorn University
Journal of Intelligent Manufacturing, 2018, vol. 29, issue 7, No 13, 1617-1636
Abstract The car sequencing problem consists of sequencing a given set of cars to be produced in each day. This paper presents an application of the extended coincident algorithm (COIN-E), which is an instance of the estimation of distribution algorithms, to a multi-objective car sequencing problem on a more realistic platform, i.e. two-sided assembly lines. Three conflicting objectives are optimised simultaneously in a Pareto sense including minimise the number of paint colour changes, minimise the total number of ratio constraint violations and minimise the utility work. The performances of COIN-E are compared with COIN (its original version), NSGA II, DPSO and BBO. The results reveal that COIN-E is superior to the other contestant algorithms in both solution quality and diversity.
Keywords: Car sequencing problem; Two-sided assembly line; Pareto optimum (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
http://link.springer.com/10.1007/s10845-016-1201-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:joinma:v:29:y:2018:i:7:d:10.1007_s10845-016-1201-6
Ordering information: This journal article can be ordered from
Access Statistics for this article
Journal of Intelligent Manufacturing is currently edited by Andrew Kusiak
More articles in Journal of Intelligent Manufacturing from Springer
Bibliographic data for series maintained by Sonal Shukla ().