共 50 条
- [21] Solving the symmetric traveling salesman problem by simulating annealing with an untying heuristic 7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL IX, PROCEEDINGS: COMPUTER SCIENCE AND ENGINEERING: II, 2003, : 235 - 240
- [22] Heuristic Methods for Solving the Traveling Salesman Problem (TSP): A Comparative Study 2023 IEEE 34TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, PIMRC, 2023,
- [23] Clustering Approach for Solving Traveling Salesman Problems via Ising Model Based Solver PROCEEDINGS OF THE 2020 57TH ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2020,
- [24] A Comparison between Heuristic and Meta-Heuristic Methods for Solving the Multiple Traveling Salesman Problem PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 19, 2007, 19 : 300 - 303
- [25] A New Approach for Solving the Generalized Traveling Salesman Problem HYBRID METAHEURISTICS, 2010, 6373 : 62 - +
- [26] A new approach for solving large traveling salesman problem CEC'02: PROCEEDINGS OF THE 2002 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2002, : 1636 - 1641
- [28] SDGP: A Developmental Approach for Traveling Salesman Problems PROCEEDINGS OF THE 2013 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN PRODUCTION AND LOGISTICS SYSTEMS (CIPLS), 2013, : 78 - 85
- [29] A Decomposition Approach to Colored Traveling Salesman Problems 2015 INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2015, : 51 - 56
- [30] An Efficient Combined Meta-Heuristic Algorithm for Solving the Traveling Salesman Problem BRAIN-BROAD RESEARCH IN ARTIFICIAL INTELLIGENCE AND NEUROSCIENCE, 2016, 7 (03): : 125 - 138