The DOI matches its Crossref record.
Co-evolutionary particle swarm optimization algorithm for two-sided robotic assembly line balancing problem
Open accessAbstract
Industries utilize two-sided assembly lines for producing large-sized volume products such as cars and trucks. By employing robots, industries achieve a high level of automation in the assembly process. Robots help to replace human labor and execute tasks efficiently at each workstation in the assembly line. From the literature, it is concluded that not much work has been conducted on two two-sided robotic assembly line balancing problems. This article addresses the two-sided robotic assembly line balancing problem with the objective of minimizing the cycle time. A mixed-integer programming model of the proposed problem is developed which is solved by the CPLEX solver for small-sized problems. Due to the problems in non-polynomial--hard nature, a co-evolutionary particle swarm optimization algorithm is developed to solve it. The co-evolutionary particle swarm optimization utilizes local search on the global best individual to enhance intensification, modification of global best to emphasize exploration, and restart mechanism to escape from local optima. The performances of the proposed co-evolutionary particle swarm optimization are evaluated on the modified seven well-known two-sided assembly line balancing problems available in the literature. The proposed algorithm is compared with five other well-known metaheuristics, and computational and statistical results demonstrate that the proposed co-evolutionary particle swarm optimization outperforms most of the other metaheuristics for majority of the problems considered in the study.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Le Hoang, A., & Fehling, E. (2017) · Construction and Building Materials · doi:10.1016/j.conbuildmat.2017.07.130 · Cited by 339
A Survey on Cooperative Co-Evolutionary Algorithms
Ma, X., Li, X., Zhang, Q., Tang, K., Liang, Z., Xie, W., & Zhu, Z. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2868770 · Cited by 336
Li, X., Zhu, Z.-C., Rui, G.-C., Cheng, D., Shen, G., & Tang, Y. (2018) · Symmetry · doi:10.3390/sym10050155 · Cited by 30
Di Clemente, A., Maiole, F., Bornia, I., & Zullo, L. (2021) · Journal of Experimental Biology · doi:10.1242/jeb.242644 · Cited by 23
Metadata
- Authors
- Li, Z., Janardhanan, M. N., Tang, Q., & Nielsen, P.
- Venue
- Advances in Mechanical Engineering
- Publisher
- SAGE Publications
- Published
- 2016-09
- Volume
- 8
- Issue
- 9
- ISSN
- 1687-8132 (ISSN-L)
- 1687-8140
- OpenAlex
- W2521704238
- Cited by
- 236
- References
- 0
- FWCI
- 50.78
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Co-evolutionary particle swarm optimization algorithm for two-sided robotic assembly line balancing problem. https://app.cochat.ai/papers/10.1177/1687814016667907
- The paper
- Li, Z., Janardhanan, M. N., Tang, Q., & Nielsen, P. (2016). Co-evolutionary particle swarm optimization algorithm for two-sided robotic assembly line balancing problem. Advances in Mechanical Engineering. https://doi.org/10.1177/1687814016667907
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.