2023
DOI: 10.1007/s00521-023-08358-7
|View full text |Cite|
|
Sign up to set email alerts
|

An enhanced multi-operator differential evolution algorithm for tackling knapsack optimization problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 104 publications
0
1
0
Order By: Relevance
“…Task allocation is not simply to randomly assign binding task points to two robots, but to comprehensively consider process factors and overall efficiency, and allocate these tasks evenly and reasonably to two robots, to maximize the utilization of existing dual robot system resources. Therefore, the binding task point Assignment problem can be transformed into a Knapsack problem to solve (Sallam et al , 2023). Consider two binding robots as backpacks, and the binding task points as items to be assigned.…”
Section: Task Allocation For Dual Robot Operationsmentioning
confidence: 99%
“…Task allocation is not simply to randomly assign binding task points to two robots, but to comprehensively consider process factors and overall efficiency, and allocate these tasks evenly and reasonably to two robots, to maximize the utilization of existing dual robot system resources. Therefore, the binding task point Assignment problem can be transformed into a Knapsack problem to solve (Sallam et al , 2023). Consider two binding robots as backpacks, and the binding task points as items to be assigned.…”
Section: Task Allocation For Dual Robot Operationsmentioning
confidence: 99%