Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
Bi-Objective Colored Traveling Salesman Problems
Xiangping Xu, Jun Li,
Meng Chu Zhou
Electrical and Computer Engineering
Research output
:
Contribution to journal
›
Article
›
peer-review
17
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Bi-Objective Colored Traveling Salesman Problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Colored Traveling Salesman Problem
100%
Bi-objective
100%
Variable Neighborhood Search
71%
Objective Variables
57%
Salesperson
42%
Probability-based
28%
Population-based
28%
High Performance
14%
Two-variable
14%
Performance Metrics
14%
Local Search Algorithm
14%
Distance Metric
14%
Genetic Algorithm
14%
Hypergraph
14%
Multiple Traveling Salesman Problem
14%
Delaunay Triangulation
14%
Feasible Solution
14%
Comprehensive Comparison
14%
Pareto Optimal
14%
2-opt
14%
Hypervolume
14%
Inverted Generational Distance
14%
Elitist
14%
Solution Framework
14%
Popular Performance
14%
C-metric
14%
Non-dominated Sorting
14%
Computer Science
Traveling Salesman Problem
100%
Variable Neighborhood Search
100%
Objective Variable
80%
Performance Metric
20%
Experimental Result
20%
Genetic Algorithm
20%
Feasible Solution
20%
Search Procedure
20%
Search Variant
20%
Initialization Stage
20%
Pareto Optimum
20%
Mathematics
Traveling Salesman Problem
100%
Objective Variable
100%
Probability Theory
50%
Genetic Algorithm
25%
Local Search
25%
Opts _ _ _
25%
Feasible Solution
25%
Hypergraphs
25%
Prepare Candidate
25%