Research Article
AGV Scheduling Optimization for Medical Waste Sorting System
Algorithm 1
Variable neighborhood descent (VND).
| Input: // is the optimal solution and is the current solution, and is used to record the neighborhood structure | (1) | | (2) | While(true) | (3) | Switch() | (4) | case 1: | (5) | FindBestNeighborhood_one() | (6) | If ()then// is the fitness of solution , calculated by DP. | (7) | ; | (8) | ; | (9) | End if | (10) | Break; | (11) | case 2: | (12) | FindBestNeighborhood_two() | (13) | If ()then | (14) | ; | (15) | ; | (16) | End if | (17) | break; | (18) | default; | (19) | return; | (20) | ; | (21) | End while |
|