Computer Science ›› 2022, Vol. 49 ›› Issue (6A): 199205.doi: 10.11896/jsjkx.210400065
• Intelligent Computing • Previous Articles Next Articles
WANG Yong^{1,2}, CUI Yuan^{2}
CLC Number:
[1] CHEN X J,XUD C,ZHANG G C.New perspectives of several fundamental problems in combinatorial optimization[J].Operations Research Transactions,2014,18(1):149158. [2] HU X D,YUAN Y X,ZHANG X S.Review and Prospect forthe Development of Operations Research[J].Disciplinary Development,2012,27(2):145160. [3] KARP M.On the computational complexity of combinatorialproblems[J].Networks(USA),1975,5(1):4568. [4] ROBERTO R,MARIO R.Exact Methods for the TravelingSalesman Problem with Drone[J].Transportaton Science,2021,55(2):315335. [5] GONZALOL R,JUANJOSEM B.A branch and cut algorithm for the timedependent profitable tour problem with resource constraints[J].European Journal of Operational Research,2021,289(3):879896. [6] HELD M,KARP R M.The traveling salesman problem andminimum spanning trees[J].Operations Research,1970,18(6):11381162. [7] HELD M,KARP R M.A dynamic programming approach to sequencing problems[J].Journal of the Society for Industrial and Applied Mathematics,1962,10(1):196210. [8] BELLMAN R E.Dynamic programming treatment of the travelling salesman problem[J].Journal of the ACM,1962,9(1):6163. [9] COOK W J,CUNNINGHAM W H.Combinatorial Optimization [M].Beijing:Higher Education Press,2011:217242. [10] MANERBA D,MANSINI R,RIERALEDESMA J.The Traveling Purchaser Problem and its variants[J].European Journal of Operational Research,2017,259(1):118. [11] LV X H.Research on vehicle routing optimization based on improved branch pricing method[J].Software,2020(4):165168. [12] JIE W C,YANG J,LU J Y.Electric vehicle routing problembased on a branchandprice algorithm[J].Operations Research and Management Science,2016,25(4):93100. [13] APPLEGATE D L,BIXBY R E.Certification of an optimal TSP tour through 85900 cities[J].Operations Research Letters,2009,37(1):1115. [14] COOK W.The traveling salesman problem:postcards from the edge of impossibility(Plenary talk)[C]//The 30th European Conference on Operational Research.Dublin,Ireland,2019:2326. [15] SEEJA K R.Solving Travelling Salesman Problem with Sparse Graphs[C]//International Conference of Computational Methods in Sciences and Engineering.Rhodes,GREECE,2019:15. [16] XIAO M,NAGAMOCHI H.An exact algorithm for TSP in degree3 graphs via circuit procedure and amortization on connectivity structure[J].Algorithmica,2016,74(2):713741. [17] JONKER R,VOLGENANT T.Nonoptimal edges for the symmetric traveling salesman problem[J].Operations Research,1984,32(4):837846. [18] HOUGARDY S,SCHROEDER R T.Edges elimination in TSP instances[C]//GraphTheoretic Concepts in Computer Science.Berlin:Springer,2014:275286. [19] WANG Y,HAN Z P.The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem[C]//14th International Conference on Algorithmic Aspects in Information and Management(AAIM 2020).2020:513524. [20] WANG Y,REMMEL J B.A binomial distribution model for the traveling salesman problem based on frequency quadrilaterals[J].Journal of Graph Algorithms & Applications,2016,20(2):411434. [21] WANG Y,REMMEL J B.An iterative algorithm to eliminate edges for traveling salesman problem based on a new binomial distribution[J].Applied Intelligence,2018,48(11):44704484. [22] REINELT G.TSPLIB[EB/OL]http://comopt.ifi.uniheidelberg.de/software/TSPLIB95/. [23] MITTELMANN H.Comcorde Online[EB/OL].http://neosserver.org/neos/solvers/co:concorde/TSP.html. [24] WANG Y.Bounded degree graphs computed for TravelingSalesman Problem based on frequency quadrilaterals[C]//International Conference on Combinatorial Optimization and Applications(COCOA 2019).2019:529540. 
[1]  CHEN Junwu, YU Huashan. Strategies for Improving Δstepping Algorithm on Scalefree Graphs [J]. Computer Science, 2022, 49(6A): 594600. 
[2]  ZHAO Xiaowei, ZHU Xiaojun, HAN Zhouqing. Hover Location Selection and Flight Path Optimization for UAV for Localization Applications [J]. Computer Science, 2021, 48(11): 345355. 
[3]  YANG Decheng, LI Fengqi, WANG Yi, WANG Shengfa, YIN Huishu. Intelligent 3D Printing Path Planning Algorithm [J]. Computer Science, 2020, 47(8): 267271. 
[4]  HU Shijuan, LU Haiyan, XIANG Lei, SHEN Wanqiang. Fuzzy Cmeans Clustering Based Parthenogenetic Algorithm for Solving MMTSP [J]. Computer Science, 2020, 47(6): 219224. 
[5]  LIAO Yihui, YANG Enjun, LIU Andong, YU Li. Path Optimization in CNC Cutting Machine Based on Modified Variable Neighborhood Search [J]. Computer Science, 2020, 47(10): 233239. 
[6]  GENG Haijun, YIN Xia. Efficient Intradomain Routing Protection Algorithm Based on iSPF [J]. Computer Science, 2019, 46(8): 116120. 
[7]  MAN Zhenzhen, YU Shiming and HE Defeng. Shortest Path Network Routing Optimization Algorithm Based on Improved ITO Algorithm [J]. Computer Science, 2017, 44(7): 215220. 
[8]  ZUO Xiufeng and SHEN Wanjie. Improved Algorithm about Mutishortest Path Problem Based on Floyd Algorithm [J]. Computer Science, 2017, 44(5): 232234. 
[9]  LI Bingkui, ZHUANG Lei, MA Ding, HU Ying, WANG Guoqing and JING Chenkai. Routing Mechanism Based on Business Differentiating in Software Defined Network [J]. Computer Science, 2017, 44(3): 118122. 
[10]  GAO Faqin. Path Prediction and Query Algorithm Based on Probability [J]. Computer Science, 2016, 43(8): 207211. 
[11]  GU Minghao and XU Ming. Shortest Path Searching Algorithm Based on Geographical Coordinates and Closed Attribute in Road Network [J]. Computer Science, 2016, 43(6): 188193. 
[12]  LONG Qi,YE Chen and ZHANG Yaying. Distributed Path Generation Algorithm Based on Realtime Traffic Information in Dynamic Road Network [J]. Computer Science, 2014, 41(9): 259262. 
[13]  WANG Zhaoyuan,LI Tianrui and YI Xiuwen. Approach for Development of Ant Colony Optimization Based on MapReduce [J]. Computer Science, 2014, 41(7): 261265. 
[14]  MA Hui,LI Jianguo and LIANG Ruishi. Finding Optimal Long Paths over Multicost Road Networks Using Bidirectional Searches [J]. Computer Science, 2014, 41(7): 242245. 
[15]  DENG Dongmei,WANG Guannan,ZHU Jian,GAO Hui and CHEN Duanbing. Temporal Shortest Path Algorithm [J]. Computer Science, 2014, 41(6): 185187. 
