Skip to main navigation
Skip to search
Skip to main content
University of Nottingham Ningbo China Home
Home
Profiles
Research units
Research output
Projects
Prizes
Activities
Press/Media
Impacts
Student theses
Search by expertise, name or affiliation
Competitive travelling salesmen problem: A hyper-heuristic approach
G. Kendall,
J. Li
School of Computer Science
Research output
:
Journal Publication
›
Article
›
peer-review
23
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Competitive travelling salesmen problem: A hyper-heuristic approach'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Competitive Element
25%
Competitive Travelling Salesmen Problem
100%
Computational Example
25%
Distance Traveled
25%
Equilibrium Analysis
25%
Heuristic Techniques
50%
Hyper-heuristics
100%
Low-level Heuristics
50%
Nonoperative
25%
Novel Variants
25%
Payoff
25%
Salesperson
100%
Travel Distance
25%
Traveling Salesman
50%
Traveling Salesman Problem
25%
Computer Science
Decision Point
25%
Equilibrium Analysis
25%
Hyper-Heuristic
100%
Traveled Distance
25%
Traveling Salesman
50%
Traveling Salesman Problem
100%
Mathematics
Heuristic Approach
100%
Traveling Salesman Problem
100%
Social Sciences
Cooperatives
100%