Evidence map›Paper›PMID 42645317›Full record

ArticleBiomimetics (Basel, Switzerland)2026

A Q-Learning-Based Hyper-Heuristic Genetic Algorithm for Optimizing Human-Robot Collaborative Assembly Lines.

Seçil Kulaç

Abstract read
In one paragraph

Article in Biomimetics (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

1 author.

Seçil KulaçQuality Coordination Office, Bursa Technical University, 16350 Bursa, Türkiye.ORCID 0000-0003-3432-0099

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Human-robot collaborative assembly line balancing and scheduling constitutes an NP-hard combinatorial optimization problem involving the simultaneous optimization of task assignment, resource allocation, processing mode selection, station-level scheduling, and ergonomic constraints. This study proposes a Q-learning-based hyper-heuristic genetic algorithm (QLHH-GA) to solve the cost-oriented ergonomic mixed-model human-robot collaborative assembly line balancing and scheduling problem. The proposed approach integrates bio-inspired evolutionary mechanisms of population variation and selection with adaptive, Q-learning-guided low-level heuristic selection. The Q-learning layer uses performance feedback to adapt the search strategy to different solution states while maintaining solution feasibility. A mixed-integer linear programming (MILP) model is also developed to minimize the total operating cost, including station opening, labor, robot operation, and energy consumption costs, while enforcing station-level energy expenditure (EE) limits. Computational experiments conducted using benchmark instances of varying sizes and a literature-based industrial case study demonstrate that QLHH-GA produces solutions comparable to those obtained by the MILP model on small-scale instances and maintains strong solution quality on larger instances, for which exact optimization becomes computationally prohibitive. These findings demonstrate the scalability and effectiveness of reinforcement-learning-guided hyper-heuristic search for designing cost-efficient and ergonomically constrained human-robot collaborative assembly lines.

Indexed as

assembly line balancing and schedulingbio-inspired optimizationenergy expendituregenetic algorithmhuman–robot collaborationhyper-heuristicQ-learning

Identifiers

PMID42645317
PMCPMC13511051

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.