Research Article
Mathematical Model and Algorithm for the Reefer Mechanic Scheduling Problem at Seaports
Step 1: Initialize: | Step 1.1 Initialize three individuals by LPT, EDD and KPM heuristics; | Step 1.2 Generate the rest in a random way; | Step 2: Evaluate each solution and record the best one; | While Stop condition is met, output the best result, otherwise Do | Step 3: Perform DE-based search: | Step 3.1: Mutation Create a mutant population ; | Step 3.2: Crossover Recombine mutant population and target population | to produce a new trial population ; | Step 3.3: Selection Update population by one-to-one greedy selection; | Step 4: Perform local search on the current best: | Step 4.1: Execute Strategy 1; | Step 4.2: Update the best individual; | Step 4.3: Execute Strategy 2; | Step 4.4: Update the best individual; | End |
|