Computer Science ›› 2024, Vol. 51 ›› Issue (6A): 230700222-8.doi: 10.11896/jsjkx.230700222
• Artificial Intelligenc • Previous Articles Next Articles
WEI Niannian, HAN Shuguang
CLC Number:
| [1]PAPADIMITRIOU C H.The Euclidean travelling salesmanproblem is NP-complete[J].Theoretical Computer Science,1977,4(3):237-244. [2]NOGAREDA A M,SER D J,OSABA E,et al.On the design of hybrid bio-inspired meta-heuristics for complex misattribute vehicle routing problems[J].Expert Systems,2020,37(6):e12528. [3]NOVELLANI S.Models and algorithms for the optimization of real-world routing and logistics problems[J].A Quarterly Journal of Operations Research,2016,14:331-332. [4]DANTZIG G,FULKERSON R,JOHNSON S.Solution of aLange-Scale Traveling Salesman Problem[J].Operations Research,1954,2(4):365-462. [5]FISCHETTI M,GONZÁLEZ J J S,TOTH P.A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem[J].Operations Research,1997,45(3):327-494. [6]BELLMAN R.Dynamic Programming Treatment of the Traveling Salesman Problem[J].Journal of the ACM,1962,9(1):61-63. [7]TASSIULAS L.Worst Case Length of Nearest Neighbor Tours for the Euclidean Traveling Salesman Problem[J].SIAM Journal on Discrete Mathematics,1997,10(2):171-179. [8]CLARKE G,WRIGHT J W.Scheduling of vehicles from a central depot to a number of delivery points[J].Operations Research,1964,12(4):519-643. [9]CHRISTOFIDES N.Worst-case analysis of a new heuristic for the travelling salesman problem[J].Operations Research Forum,2022,3(1):20. [10]DORIGO M,GAMBARDELLA L M.Ant colony system:a cooperative learning approach to the traveling salesman problem[J].IEEE Transactions on Evolutionary Computation,1997,1(1):53-66. [11]CHEN Y,ZHANG Y D,JING L,et al.An integer-coded chaotic particle swarm optimization for traveling salesman problem[M]//Progress in Robotics.Berlin:Springer,2009:372-379. [12]ZHU M W,SHE X Y.Improved artificial fish swarm algorithm for solving traveling salesman problems[J].Computer Application Research,2010,27(10):3734-3736. [13]LI Z F,WANG Y H.An improved shuffled frog leaping algorithm for TSP[M]//Advances in Multimedia,Software Engineering and Computing Vol.2.Berlin:Springer,2012:139-144. [14]KARABOGA D,GORKEMLI B.A combinational artificial bee colony algorithm for traveling salesman problem[C]//International Symposium on Innovations in Intelligent Systems and Applications.2011:50-53. [15]CARPANETO G,DELL′AMICO M,TOTH P.Exact solutionof large-scale,asymmetric traveling salesman problems[J].ACM Transactions on Mathematical Software,1995,21(4):394-409. [16]GOETSCHALCKX M,JACOBS-BLECHA C.The vehicle routing problem with backhauls[J].European Journal of Operational Research,1989,42(1):39-51. [17]XUE M H,WANG T Z,MAO S.Double evolutional artificial bee colony algorithm for multiple traveling salesman problem[J].MATEC Web of Conferences,2016,44:02025. [18]BOUZOUBÍA S,LAYEB A,CHIKHI S.Enhanced ChemicalReaction Optimization for Multi-objective Traveling Salesman Problem[M]//Modelling and Implementation of Complex Systems.Springer,2016:91-106. [19]MAUTOR T,NAUDIN E.Arcs-states models for the vehiclerouting problem with time windows and related problems[J].Computers & Operations Research,2007,34(4):1061-1084. [20]LI J,ZHOU M C,SUN Q R,et al.Colored traveling salesman problem[J].IEEE Transactions on Cybernetics,2015,45(11):2390-2401. [21]VINYALS O,FORTUNATO M,JAITLY N.Pointer networks[C]//Proceedings of the 28th Intermational Conference on Neural Information Processing Systems(NIPS’15).2015:2692-2700. [22]BELLO I,PHAM H,QUOC V L,et al.Neural combinatorialoptimization with reinforcement learning[J].arXiv:1611.09940,2016. [23]KOOL W,HOOF H V,WELLING M.Attention,learn to solve routing problems[J].arXiv:1803.08475,2018. [24]NOWAK A,VILLAR S,BANDEIRA A S,et al.Revised note on learning algorithms for quadratic assignment with graph neural networks[J].arXiv:1706.07450,2018. [25]JOSHI C K,LAURENT T,BRESSON X.An efficient graph convolutional network technique for the travelling salesman problem[J].arXiv:1906.01227,2019. [26]KOOL W,HOOF H V,GROMICHO J,et al.Deep policy dynamic programming for vehicle routing problems[M]//Integration of Constraint Programming,Artificial Intelligence,and Operations Research.Springer,2022:190-213. [27]FU Z H,QIU K B,ZHA H Y.Generalize a small pre-trained model to arbitrarily large tsp instances[C]//Proceedings of the AAAI Conference on Artificial Intelligence.2021:7474-7482. [28]DEUDON M,COURNUT P,LACOSTE A,et al.Learning heuristics for the TSP by policy gradient[C]//Integration of Constraint Programming.Artificial Intelligence,and Operations Research,2018:170-181. [29]DAI H,KHALIL E B,ZHANG Y Y,et al.Learning combinatorial optimization algorithms over graphs[C]//Proceedings of the 31st International Conference on Neural Information Processing(NIPS’17).2017:6348-6358. [30]WU Y,SONG W,CAO Z,et al.Learning improvement heuristics for solving routing problems[J].IEEE Transactions on Neural Networks and Learning Systems,2022,33(9):5057-5069. [31]DACOSTA P,RHUGGENAATH J,ZHANG Y Q,et al.Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning[J].arXiv:2004.01608,2020. [32]HUANG L Y,CHEN X M,WEI H,et al.Branch and Bound in Mixed Integer Linear Programming Problems:A Survey of Techniques and Trends[J].arXiv:2111.06257,2021. [33]LAWLER E L,LENSTRA J K,RINNOOY K A H,et al.The Travelling Salesman:A Guided Tour of Combinatorial Optimization[J].Journal of the Operational Research Society,1986,37(5):535-536. [34]LOMNICKI Z A.A Branch-and-Bound Algorithm for the Exact Solution of the Three-Machine Scheduling Problem[J].Journal of the Operations Research Society,1965,16:89-100. [35]CLAUSEN J,TRAFF J L.Implementation of parallel Branch-and-Bound algorithms experiences with the graph partitioning problem[J].Annals of Operations Research,1991,33:331-349. [36]MAUTOR T,ROUCAIROL C.A new exact algorithm for the solution of quadratic assignment problems[J].Discrete Applied Mathematics,1994,55(3):281-293. [37]LAND A H,DOIG A G.An automatic method for solving discrete programming problems[J].Econometrica,1960,28(3):497-520. [38]CLAUSEN J.Branch and bound algorithms-principles and examples[J/OL].https://janders.eecg.toronto.edu/1387/readings/b_and_b.pdf. [39]ACHTERBERG T,KOCH T,MARTIN A.Branching rules revisited[J].Operations Research Letter,2005,33:42-54. [40]GAMRATH G.Improving Strong Branching by Domain Propagation[J].EURO Journal on Computational Optimization,2014,2:99-122. [41]KILINÇ,MUSTAFA R L.Strong-branching inequalities forconvex mixed integer nonlinear programs[J].Computational Optimization and Applications,2014,59:639-665. [42]SANTANU S D,YATHARTH D,MARCO M,et al.A Theoretical and Computational Analysis of FullStrong-Branching[J].arXiv:2110.10754,2021. [43]MILLER C E,TUCKER A W,ZEMLIN R A.Integer programming formulation of traveling salesman problems[J].Journal of the ACM,1960,7(4):326-329. [44]TOBIAS A,TIMO B.Hybrid branching[M]//Integration of AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems.Berlin:Springer,2009:309-311. |
| [1] | LI Dongyang, NIE Rencan, PAN Linna, LI He. UMGN:An Infrared and Visible Image Fusion Network Based on Unsupervised Significance MaskGuidance [J]. Computer Science, 2024, 51(6A): 230600170-5. |
| [2] | LOU Ren, HE Renqiang, ZHAO Sanyuan, HAO Xin, ZHOU Yueqi, WANG Xinyuan, LI Fangfang. Single Stage Unsupervised Visible-infrared Person Re-identification [J]. Computer Science, 2024, 51(6A): 230600138-7. |
| [3] | HUANG Rui, XU Ji. Text Classification Based on Invariant Graph Convolutional Neural Networks [J]. Computer Science, 2024, 51(6A): 230900018-5. |
| [4] | LIU Hui, JI Ke, CHEN Zhenxiang, SUN Runyuan, MA Kun, WU Jun. Malicious Attack Detection in Recommendation Systems Combining Graph Convolutional Neural Networks and Ensemble Methods [J]. Computer Science, 2024, 51(6A): 230700003-9. |
| [5] | HE Yifan, HE Yulin, CUI Laizhong, HUANG Zhexue. Subspace-based I-nice Clustering Algorithm [J]. Computer Science, 2024, 51(6): 153-160. |
| [6] | CHEN Wenzhong, CHEN Hongmei, ZHOU Lihua, FANG Yuan. Time-aware Pre-training Method for Sequence Recommendation [J]. Computer Science, 2024, 51(5): 45-53. |
| [7] | ZHANG Liying, SUN Haihang, SUN Yufa , SHI Bingbo. Review of Node Classification Methods Based on Graph Convolutional Neural Networks [J]. Computer Science, 2024, 51(4): 95-105. |
| [8] | KANG Wei, LI Lihui, WEN Yimin. Semi-supervised Classification of Data Stream with Concept Drift Based on Clustering Model Reuse [J]. Computer Science, 2024, 51(4): 124-131. |
| [9] |
YAN Wenjie, YIN Yiying.
Human Action Recognition Algorithm Based on Adaptive Shifted Graph Convolutional Neural Network with 3D Skeleton Similarity [J]. Computer Science, 2024, 51(4): 236-242. |
| [10] | HUANG Wenke, TENG Fei, WANG Zidan, FENG Li. Image Segmentation Based on Deep Learning:A Survey [J]. Computer Science, 2024, 51(2): 107-116. |
| [11] | CAI Jiacheng, DONG Fangmin, SUN Shuifa, TANG Yongheng. Unsupervised Learning of Monocular Depth Estimation:A Survey [J]. Computer Science, 2024, 51(2): 117-134. |
| [12] | DAI Wei, CHAI Jing, LIU Yajiao. Semi-supervised Learning Algorithm Based on Maximum Margin and Manifold Hypothesis [J]. Computer Science, 2024, 51(2): 259-267. |
| [13] | JING Yeyiran, YU Zeng, SHI Yunxiao, LI Tianrui. Review of Unsupervised Domain Adaptive Person Re-identification Based on Pseudo-labels [J]. Computer Science, 2024, 51(1): 72-83. |
| [14] | ZHOU Wenhao, HU Hongtao, CHEN Xu, ZHAO Chunhui. Weakly Supervised Video Anomaly Detection Based on Dual Dynamic Memory Network [J]. Computer Science, 2024, 51(1): 243-251. |
| [15] | XU Jie, WANG Lisong. Contrastive Clustering with Consistent Structural Relations [J]. Computer Science, 2023, 50(9): 123-129. |
|
||
Home