共 50 条
[31]
A New Hybrid Method Based on Nearest Neighbor Algorithm and 2-Opt Algorithm for Traveling Salesman Problem
[J].
PROCEEDINGS OF 2018 4TH INTERNATIONAL CONFERENCE ON WIRELESS AND TELEMATICS (ICWT),
2018,
[33]
A revised EM-like algorithm plus K-OPT method for solving the traveling salesman problem
[J].
ICICIC 2006: FIRST INTERNATIONAL CONFERENCE ON INNOVATIVE COMPUTING, INFORMATION AND CONTROL, VOL 1, PROCEEDINGS,
2006,
:546-+
[34]
A hybrid method for solving traveling salesman problem
[J].
6TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE, PROCEEDINGS,
2007,
:394-+
[35]
Filled function method for the traveling salesman problem
[J].
Jisuanji Xuebao/Chinese Journal of Computers,
2002, 25 (07)
:701-707
[36]
A Dynamic Colored Traveling Salesman Problem and Its Solution
[J].
PROCEEDINGS OF THE 36TH CHINESE CONTROL CONFERENCE (CCC 2017),
2017,
:2996-3001
[37]
Evolutionary Method for Solving the Traveling Salesman Problem
[J].
2018 INTERNATIONAL SCIENTIFIC-PRACTICAL CONFERENCE: PROBLEMS OF INFOCOMMUNICATIONS SCIENCE AND TECHNOLOGY (PIC S&T),
2018,
:331-338
[38]
APPLICATION OF AN EVOLUTIONARY PROGRAM FOR THE SOLUTION OF A TRAVELING SALESMAN PROBLEM
[J].
AVTOMATIKA,
1981, (04)
:10-14