Task sequences for each AGV when using greedy algorithm in the front end of IPSO(+B).

Task sequences for each AGV when using greedy algorithm in the front end of IPSO(+B).

<p>Task sequences for each AGV when using greedy algorithm in the front end of IPSO(+B).</p>

محفوظ في:
التفاصيل البيبلوغرافية
المؤلف الرئيسي: Yazhen Zhu (3595430) (author)
مؤلفون آخرون: Qing Song (77132) (author), Meng Li (79487) (author)
منشور في: 2025
الموضوعات:
Ecology
Space Science
Biological Sciences not elsewhere classified
Mathematical Sciences not elsewhere classified
Information Systems not elsewhere classified
xlink "> research
material delivery tasks
low agv utilization
extensive simulation experiments
enhancing agv utilization
population genetic algorithm
task allocation algorithms
guide multiple agvs
real factory environment
task allocation
factory environments
proposed algorithm
subsequently enhanced
slightly higher
significantly lower
running time
overall performance
load distances
key topic
intelligent manufacturing
conducted based
balance fairness
also optimizing
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
كن أول من يترك تعليقا!
يجب تسجيل دخولك أولا

مواد مشابهة