2015
DOI: 10.1007/s40313-015-0174-6
|View full text |Cite
|
Sign up to set email alerts
|

An Adaptive Genetic Algorithm for Production Scheduling on Manufacturing Systems with Simultaneous Use of Machines and AGVs

Abstract: The problem of production scheduling of manufacturing systems involves the system modeling task and the application of a technique to solve it. This kind of scheduling is characterized by the large number of possible solutions, where several researches have been using the genetic algorithms as a search method to solve this problem, since these algorithms have the capacity of globally exploring the search space and to find good solutions quickly. This paper proposes the use of adaptive genetic algorithm to solv… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 18 publications
0
5
0
Order By: Relevance
“…Taking the makespan as the optimization objective, they proposed a two-stage ant colony algorithm to first solve the allocation and path selection problems of an AGV. Sanchesi et al [18] constructed a planning model with the goal of shortening the manufacturing cycle to the maximum extent under the minimum running time and adopted an adaptive genetic algorithm to solve the optimal scheduling scheme. Nageswararao [19] proposed a meta-heuristic gravity search algorithm to solve the scheduling problems of processing equipment and AGVs in a job shop.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Taking the makespan as the optimization objective, they proposed a two-stage ant colony algorithm to first solve the allocation and path selection problems of an AGV. Sanchesi et al [18] constructed a planning model with the goal of shortening the manufacturing cycle to the maximum extent under the minimum running time and adopted an adaptive genetic algorithm to solve the optimal scheduling scheme. Nageswararao [19] proposed a meta-heuristic gravity search algorithm to solve the scheduling problems of processing equipment and AGVs in a job shop.…”
Section: Literature Reviewmentioning
confidence: 99%
“…(1) Nonlinear convergence factor According to Equations ( 15) and (18), A affects the optimization accuracy and convergence speed of the whale. According to Equation ( 16), a has a direct influence on A, and a decreases linearly from 2 to 0, which makes the search speed of the algorithm decline in the later period and is not conducive to the fast convergence of the algorithm.…”
Section: Improved Whale Optimization Algorithm (Iwoa)mentioning
confidence: 99%
“…ON 5,4 [5,4,79,17,103,3], ON 8,2 [3,5112,0,115,6], ON 4,5 [6,1,0,0,0,1], ON 3,2 [6,5, 0,0,0,5], ON 9,2 [6,5,0,0,0,5], ON 1,1 [6,0,119,0, 123,1],…”
Section: Case Studymentioning
confidence: 99%
“…Therefore, it is proposed to have hybrid heuristic (ALS) which uses combined breadth-first algorithmic deepening A* with suboptimal breadth-first branch-and bound can find a quick solution, then which is improved by backtracking. Sanches Sipoli et al 17 developed an adoptive GTA to work out the scheduling of production systems considering the concurrent use of computers and AGVs for minimum MSN. Reddy et al 18 addressed the machines and AGVs concurrent scheduling in a MMFMS by using symbiotic organisms search algorithm (SOSA) for minimization of MSN and it is made known that the results of SOSA are promising.…”
mentioning
confidence: 99%
“…For optimal scheduling, the path conflict problem is solved by swarm intelligence optimization algorithms 5 such as the PSO algorithm [6][7][8][9][10] and genetic algorithm. [11][12][13][14][15][16][17][18] Umar et al 19 proposed a genetic algorithm based on task priority to detect and avoid AGV deadlocks and path conflicts. Tanaka et al 20 proposed a method for assigning tasks by considering the subsequent path planning.…”
Section: Introductionmentioning
confidence: 99%