A Multi-Objective Cuckoo Search Algorithm Based on the Record Matrix for a Mixed-Model Assembly Line Car-Sequencing Problem

In the car-sequencing problem of mixed-model assembly lines, a series of cars with different model types will be put into the assembly line in a certain order considering a variety of goals and constraints. In this paper, a multi-objective cuckoo search algorithm based on the record matrix is propos...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2020, Vol.8, p.76453-76470
Main Authors: Wang, Hui, Sheng, Buyun, Lu, Qibing, Luo, Ruiping, Fu, Gaocai
Format: Article
Language:English
Subjects:
Algorithms
Assembly lines
Automobiles
Car-sequencing problem
Heuristic algorithms
mixed-model assembly line
multi-objective cuckoo search algorithm
Multiple objective analysis
Optimization
Production
record matrix
Search algorithms
Search methods
Search problems
Sequences
Sequential analysis
Workstations
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the car-sequencing problem of mixed-model assembly lines, a series of cars with different model types will be put into the assembly line in a certain order considering a variety of goals and constraints. In this paper, a multi-objective cuckoo search algorithm based on the record matrix is proposed to solve this problem. In this algorithm, the factors, including the variation of parts usage rates, variation of workstation workload, idle time, overload time, and model switching cost are considered. The record matrix proposed in this paper is utilized to record the characteristic information of the optimal solutions and historical solutions. Meanwhile, two search strategies based on the record matrix are proposed to enhance the ability of local search and global search in the algorithm. The proposed algorithm is verified by a real case. The results show that the proposed model and algorithm have good results, and they have the potential to address other similar problems.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2020.2989627