grafkevin/multiobjective_route_optimisation
This code optimises a three-objective traveling salesman problem (TSP). Three different multi-objective evolutionary algorithms (MOEAs) are used to solve this problem. The applied MOEAs are NSGA-II, MOEA/D, and IBEA which are taken from the Platypus framework..
Jupyter Notebook