Publication:5321485
From MaRDI portal
zbMath1167.90693MaRDI QIDQ5321485
Publication date: 22 July 2009
68Q25: Analysis of algorithms and problem complexity
68T05: Learning and adaptive systems in artificial intelligence
90C59: Approximation methods and heuristics in mathematical programming
Related Items
A gene-pool based genetic algorithm for TSP, Genetic algorithm for combinatorial path planning: the subtour problem, Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem, Optimizing ontology alignments through a memetic algorithm using both MatchFmeasure and unanimous improvement ratio, Estimation-based metaheuristics for the probabilistic traveling salesman problem, An effective local search for the maximum clique problem, A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem, Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers, Comparison of Tabu/2-opt heuristic and optimal tree search method for assignment problems
Uses Software