2010
DOI: 10.1016/j.rcim.2010.05.004
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid approach for dynamic routing planning in an automated assembly shop

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…Such fast reconfiguration capabilities do not exist today and unless the malfunctioning robotic unit is replaced on site, the installation of a replacement robot, together with its programming can take a number of days or even weeks. Finally, there is a significant requirement for a scheduling and rescheduling logic in order to assign operations to the mobile robots in the shop floor [33][34][35]. The introduction of such an algorithm is the main focus of the current paper.…”
Section: Mobile Robotsmentioning
confidence: 99%
“…Such fast reconfiguration capabilities do not exist today and unless the malfunctioning robotic unit is replaced on site, the installation of a replacement robot, together with its programming can take a number of days or even weeks. Finally, there is a significant requirement for a scheduling and rescheduling logic in order to assign operations to the mobile robots in the shop floor [33][34][35]. The introduction of such an algorithm is the main focus of the current paper.…”
Section: Mobile Robotsmentioning
confidence: 99%
“…The final layout determines the space requirements needed for the assigned plant. This interactive approach is valid for this kind of fixed-position assembly system, when considering the layout of a dynamic job-shop assembly environment then a heuristic based solution could be more appropriated [28].…”
Section: Define Fal Layoutmentioning
confidence: 99%
“…It is highly recommended that every mean value X i is included in the interval [a i ,e i ] for the inputs of all the evaluated alternatives, for a better differentiation between them. e t = N cyc 0 · t cyc obj (27) a t = 40%e t (28) e c = cos t MAX (29) a c = 30%e t (30)…”
Section: Timementioning
confidence: 99%
“…Mutation is used in evolutionary algorithms in order to maintain the genetic diversity from one generation to the next [50]. It occurs during evolution according to the probability P mut ¼c/length of individual, where c is a user-defined constant that takes values within (0, 1) and the length of individual is static based on the length of the nodes of the alternative solutions.…”
Section: Tabu Search (Ts)mentioning
confidence: 99%