Litcius/Paper detail

Solving time varying many-objective TSP with dynamic <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e4589" altimg="si56.svg"> <mml:mi>θ</mml:mi> </mml:math> -NSGA-III algorithm

Rashi Gupta, Satyasai Jagannath Nanda

2022Applied Soft Computing30 citationsDOI

Topics & Concepts

AlgorithmTravelling salesman problemSortingBenchmark (surveying)Convergence (economics)Genetic algorithmComputer scienceMathematical optimizationSupport vector machinePopulationKernel (algebra)Evolutionary algorithmMathematicsMachine learningCombinatoricsDemographyEconomic growthGeodesySociologyEconomicsGeographyAdvanced Multi-Objective Optimization AlgorithmsMetaheuristic Optimization Algorithms ResearchVehicle Routing Optimization Methods
Solving time varying many-objective TSP with dynamic <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e4589" altimg="si56.svg"> <mml:mi>θ</mml:mi> </mml:math> -NSGA-III algorithm | Litcius