Research Article
An Adaptive Large Neighborhood Search Algorithm for the Satellite Data Transmission Scheduling Problem
Algorithm 2
Generate the initial plan
| Input Initial task sequence , available time window | | Output Planning | | For each task in task sequence | | Select the earliest available location in | | If meet the constraints | | Insert task at the current location | | Else If available locations after the earliest location | | Select the top available location in | | Insert the task | | Else go to the next task | | End If | | End For | | Output planning |
|