Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem

Evolutionary Computation - United States
doi 10.1162/evco_a_00199
Full Text
Abstract

Available in full text

Date
Authors
Publisher

MIT Press - Journals

Related search

A Model of Human Performance on the Traveling Salesperson Problem

Memory and Cognition
ArtsNeuropsychologyCognitive PsychologyHumanitiesPhysiological PsychologyMedicineExperimental
2000English

Variable Neighborhood Search Heuristics for a Test Assembly Design Problem

Expert Systems with Applications
EngineeringComputer Science ApplicationsArtificial Intelligence
2015English

Simple Constructive, Insertion, and Improvement Heuristics Based on the Girding Polygon for the Euclidean Traveling Salesman Problem

Algorithms
MathematicsComputational MathematicsNumerical AnalysisTheoretical Computer ScienceComputational Theory
2019English

A Tabu Search Approximation for Finding the Shortest Distance Using Traveling Salesman Problem

IOSR Journal of Mathematics
2016English

Probability Gains Expected for Renewal Process Models

Earth, Planets and Space
SpacePlanetary ScienceGeology
2004English

How Randomized Search Heuristics Find Maximum Cliques in Planar Graphs

2006English

New Heuristics for the Maximum Diversity Problem

Journal of Heuristics
ControlInformation SystemsManagement ScienceComputer NetworksCommunicationsOptimizationOperations ResearchArtificial IntelligenceSoftware
2007English

Evaluating the Importance of the Convex Hull in Solving the Euclidean Version of the Traveling Salesperson Problem: Reply to Lee and Vickers (2000)

Perception & Psychophysics
2000English

PathGame: Crowdsourcing Time-Constrained Human Solutions for the Travelling Salesperson Problem

Computational Intelligence and Neuroscience
MedicineMathematicsComputer ScienceNeuroscience
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy