Table 1.
General schematic for reading data.
Fig 1.
Example of one-point crossover.
Fig 2.
An example of repairing offsprings out of one-point crossover.
Fig 3.
Example of shift mutation operator.
Table 2.
Encoding of a sample particle.
Table 3.
AGV travel time among L/U point and machines for example 1.
Fig 4.
Flowchart of hybrid GA-PSO.
Table 4.
AGV travel time among L/U point and machines for example 2.
Table 5.
The processing time of every operation on the machines for example 1.
Table 6.
The processing time of every operation on the machines for example 2.
Fig 5.
Gantt chart of a random sequence of the example using the six AGVs before optimization.
Table 7.
Test results of optimization algorithms (The first two best result of each) for both examples.
Fig 6.
Performance of the different algorithms a. Example 1, b. Example 2.
Fig 7.
Gantt chart of the schedule of the example 1 after optimization by GA-PSO that employs three AGVs.
Fig 8.
Gantt chart of the schedule of the example 2 after optimization by GA-PSO that employs five AGVs.
Fig 9.
AGVs specification before and after optimization by PSO, GA, GA-PSO for the example 1.
Fig 10.
Simulation of the sample by Flexsim software.