Research Article
AGV Scheduling Optimization for Medical Waste Sorting System
Algorithm 2
Variable neighborhood search (VNS).
| Input: // represents the current iteration number, represents the maximum iteration number, is the optimal solution, and is current solution | (1) | //generate the initial solution; | (2) | ; | (3) | While (iteration < G) | (4) | ; | (5) | Shaking(); | (6) | Variable neighborhood descent(); | (7) | If ()Then | (8) | ; | (9) | ; | (10) | End if | (11) | ; | (12) | End while | | Output: best found solution. |
|