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
Delaunay-Triangulation-Based Variable Neighborhood Search to Solve Large-Scale General Colored Traveling Salesman Problems
Xiangping Xu, Jun Li,
Meng Chu Zhou
Electrical and Computer Engineering
Research output
:
Contribution to journal
›
Article
›
peer-review
43
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Delaunay-Triangulation-Based Variable Neighborhood Search to Solve Large-Scale General Colored Traveling Salesman Problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Colored Traveling Salesman Problem
100%
Delaunay Triangulation
100%
Variable Neighborhood Search
100%
Salesperson
50%
City Color
33%
Convergence Rate
16%
Scheduling Problem
16%
Divide-and-conquer
16%
Genetic Algorithm
16%
Search Ability
16%
Hypergraph
16%
Multiple Traveling Salesman Problem
16%
Local Search
16%
Delaunay
16%
2-opt
16%
Color Matrix
16%
3-opt
16%
Computer Science
Traveling Salesman Problem
100%
Variable Neighborhood Search
100%
Convergence Rate
14%
Scheduling Problem
14%
Genetic Algorithm
14%
Search Algorithm
14%
Divide-and-Conquer Algorithm
14%
Mathematics
Traveling Salesman Problem
100%
Opts _ _ _
28%
Convergence Rate
14%
Divide and Conquer
14%
Search Algorithm
14%
Matrix (Mathematics)
14%
Genetic Algorithm
14%
Local Search
14%
Hypergraphs
14%