I1 Implementation of random solution initialisation
Implementation of random solution initialisation
Hello, dear friend, you can consult us at any time if you have any questions, add WeChat: THEend8_
Project Marking Rubric
Implementation Component
Code Description Marks
I1 Implementation of random solution initialisation.
(SDSSTPInstance.java).
5
I2 Implementation of an Objective Function which adheres to the
problem description.
10
I3 Implementation of seven low-level heuristics:
A Adjacent Swap mutation 3
B 2-Opt Swap mutation 3
C Reinsertion mutation 3
D Davis’s Hill Climbing 5
E Next Descent Hill Climbing 5
F Ordered Crossover 8
G Cycle Crossover 8
I4 Use of delta/incremental evaluation for mutation and local
search heuristics (A, B, C, D, E).
2 per
heuristic
(total 10)
I5 Implementation of an instance reader/loader. 10
I6 Appropriate use of the Solution and SolutionRepresentation
classes including implementation of deep cloning.
5
I7 Implementation of your own hyper-heuristic for solving the
SDSSTP problem.
10
Online Demonstration of Project
Code Description Marks
D1 Demonstration of their code running a given hyper-heuristic. 5
D2 Explanation of how one of your low-level heuristics works. 5
D3 Explanation of your hyper-heuristic. 5