{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T06:25:06Z","timestamp":1770704706204,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,4,13]],"date-time":"2014-04-13T00:00:00Z","timestamp":1397347200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s00500-014-1279-8","type":"journal-article","created":{"date-parts":[[2014,4,12]],"date-time":"2014-04-12T06:53:23Z","timestamp":1397285603000},"page":"585-596","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":43,"title":["Hybrid Max\u2013Min ant system with four vertices and three lines inequality for traveling salesman problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Wang","family":"Yong","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,13]]},"reference":[{"key":"1279_CR1","doi-asserted-by":"crossref","unstructured":"Berman P, Karpinski M (2006) 8\/7-approximation algorithm for (1,2)-TSP. In: Proceedings of the seventeenth annual ACM-SIAM symposium on discrete algorithms, SODA 2006, Miami, pp 641\u2013648","DOI":"10.1145\/1109557.1109627"},{"key":"1279_CR2","doi-asserted-by":"crossref","unstructured":"Bl\u00e4ser M (2008) A new approximation algorithm for the asymmetric TSP with triangle inequality. ACM Trans Algorithm 4(4):1\u201315 (Article 47)","DOI":"10.1145\/1383369.1383378"},{"key":"1279_CR3","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1016\/j.cor.2006.03.023","volume":"35","author":"B Bontoux","year":"2008","unstructured":"Bontoux B, Feillet D (2008) Ant colony optimization for the traveling purchaser problem. Comput Oper Res 35:628\u2013637","journal-title":"Comput Oper Res"},{"issue":"11","key":"1279_CR4","doi-asserted-by":"crossref","first-page":"1844","DOI":"10.1016\/j.cor.2009.05.004","volume":"37","author":"B Bontoux","year":"2010","unstructured":"Bontoux B, Artigues C, Feillet D (2010) A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem. Comput Oper Res 37(11):1844\u20131852","journal-title":"Comput Oper Res"},{"issue":"3","key":"1279_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1541885.1541892","volume":"5","author":"G Borradaile","year":"2009","unstructured":"Borradaile G, Kiein P, Mathieu C (2009) An O(n log n) approximation scheme for Steiner tree in planar graphs. ACM Trans Algorithm 5(3):1\u201333","journal-title":"ACM Trans Algorithm"},{"key":"1279_CR6","unstructured":"Brualdi RA (2004) Introductory combinatorics, 4th edn. Pearson Education Asia Limited and China Machine Press, Beijing, pp 307, 377\u2013402"},{"key":"1279_CR7","doi-asserted-by":"crossref","unstructured":"Chen SM, Chien CY (2011) Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Syst Appl 38(2):14439\u201314450","DOI":"10.1016\/j.eswa.2011.04.163"},{"key":"1279_CR8","unstructured":"Chien CY, Chen SM (2009) A new method for handling the traveling salesman problem based on parallelized genetic ant colony system. In: Eighth international conference on machine learning and cybernetics, pp 2828\u20132833"},{"issue":"6","key":"1279_CR9","first-page":"1","volume":"14","author":"V Deineko","year":"2009","unstructured":"Deineko V, Tiskin A (2009) Fast minimum-weight double-tree shortcutting for metric TSP: is the best one good enough? JEA 14(6):1\u201316","journal-title":"JEA"},{"issue":"1","key":"1279_CR10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the taveling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"1279_CR11","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/CI-M.2006.248054","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, St\u00fctzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"key":"1279_CR12","doi-asserted-by":"crossref","unstructured":"Duan HB, Yu XF (2007) Hybrid ant colony optimization using memetic algorithm for traveling salesman problem. In: Proceedings of the 2007 IEEE symposium on approximate dynamic programming and reinforcement learning, Honolulu, pp 92\u201395","DOI":"10.1109\/ADPRL.2007.368174"},{"key":"1279_CR13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0360-8352(02)00179-1","volume":"44","author":"H Ghaziri","year":"2003","unstructured":"Ghaziri H, Osman IH (2003) A neural network algorithm for the traveling salesman problem with backhauls. Comput Ind Eng 44:267\u2013281","journal-title":"Comput Ind Eng"},{"key":"1279_CR14","doi-asserted-by":"crossref","unstructured":"G\u00fcnd\u00fcz M, K $$\\imath $$ \u0131 ran MS, \u00d6zceylan E (2014) A hierarchic approach based on swarm intelligence to solve traveling salesman problem. Turk J Electr Eng Comput Sci","DOI":"10.3906\/elk-1210-147"},{"key":"1279_CR15","unstructured":"Helsgaun K (2013) An effective implementation of the Lin-Kernighan traveling salesman heuristic. Available: http:\/\/www2.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/tsp\/"},{"key":"1279_CR16","doi-asserted-by":"crossref","unstructured":"Ilie S, Badica C (2010) Effectiveness of solving traveling salesman problem using ant colony optimization on distributed multi-agent middleware. In: Proceedings of the 2010 international multiconference on computer science and information technology, vol 5, pp 197\u2013203","DOI":"10.1109\/IMCSIT.2010.5679867"},{"key":"1279_CR17","first-page":"445","volume":"12","author":"DS Johnson","year":"2004","unstructured":"Johnson DS, McGeoch LA (2004) The traveling salesman problem and its variations. Comb Optim 12:445\u2013487 Springer Press","journal-title":"Comb Optim"},{"issue":"16","key":"1279_CR18","doi-asserted-by":"crossref","first-page":"1815","DOI":"10.1016\/j.dam.2011.01.026","volume":"159","author":"ED Klerk","year":"2011","unstructured":"Klerk ED, Dobre C (2011) A comparison of lower bounds for the symmetric circulant traveling salesman problem. Discret Appl Math 159(16):1815\u20131826","journal-title":"Discret Appl Math"},{"key":"1279_CR19","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.neucom.2004.02.006","volume":"62","author":"KS Leung","year":"2004","unstructured":"Leung KS, Jin HD, Xu ZB (2004) An expanding self-organizing neural network for the traveling salesman problem. Neurocomputing 62:267\u2013292","journal-title":"Neurocomputing"},{"issue":"6","key":"1279_CR20","first-page":"1","volume":"5","author":"MS Levine","year":"2000","unstructured":"Levine MS (2000) Finding the right cutting planes for the TSP. J Exp Algorithm 5(6):1\u201316","journal-title":"J Exp Algorithm"},{"key":"1279_CR21","first-page":"2191","volume":"314","author":"WH Li","year":"2011","unstructured":"Li WH, Li WJ, Yang Y, Liao HQ, Li JL, Zheng XP (2011) Artificial bee colony algorithm for traveling salesman problem. Adv Mater Res 314:2191\u20132196","journal-title":"Adv Mater Res"},{"issue":"2","key":"1279_CR22","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.ejor.2007.08.023","volume":"191","author":"YH Liu","year":"2008","unstructured":"Liu YH (2008) Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem. Eur J Oper Res 191(2):332\u2013346","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1279_CR23","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.amc.2010.01.021","volume":"216","author":"YH Liu","year":"2010","unstructured":"Liu YH (2010) Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem. Appl Math Comput 216(1):125\u2013137","journal-title":"Appl Math Comput"},{"key":"1279_CR24","doi-asserted-by":"crossref","first-page":"3063","DOI":"10.1016\/j.cam.2010.12.027","volume":"235","author":"J Majumdar","year":"2011","unstructured":"Majumdar J, Bhunia AK (2011) Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. J Comput Appl Math 235:3063\u20133078","journal-title":"J Comput Appl Math"},{"key":"1279_CR25","doi-asserted-by":"crossref","first-page":"4684","DOI":"10.1016\/j.ins.2010.06.032","volume":"181","author":"Y Marinakis","year":"2011","unstructured":"Marinakis Y, Marinaki M, Dounias G (2011) Honey bees mating optimization algorithm for the Euclidean traveling salesman problem. Inf Sci 181:4684\u20134698","journal-title":"Inf Sci"},{"key":"1279_CR26","doi-asserted-by":"crossref","unstructured":"Masutti TAS, de Castro LN (2009) A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem. Information Sciences 179(10):1454\u20131468","DOI":"10.1016\/j.ins.2008.12.016"},{"key":"1279_CR27","doi-asserted-by":"crossref","unstructured":"Oliveira S, Saifullah M, St\u00fctzle T, Roli A, Dorigo M (2011) A detailed analysis of the population-based ant colony optimization algorithm for the TSP and the QAP. In: Proceedings of the 13th annual conference on genetic and evolutionary computation, Dublin, pp 13\u201314","DOI":"10.1145\/2001858.2001866"},{"key":"1279_CR28","doi-asserted-by":"crossref","first-page":"5443","DOI":"10.1016\/j.eswa.2010.02.069","volume":"37","author":"A Puris","year":"2010","unstructured":"Puris A, Bello R, Herrera F (2010) Analysis of the efficacy of a two-stage methodology for ant colony optimization: case of study with TSP and QAP. Expert Syst Appl 37:5443\u20135453","journal-title":"Expert Syst Appl"},{"issue":"7","key":"1279_CR29","doi-asserted-by":"crossref","first-page":"1566","DOI":"10.1016\/j.cor.2011.09.005","volume":"39","author":"A Rodr\u00edguez","year":"2012","unstructured":"Rodr\u00edguez A, Ruiz R (2012) The effect of the asymmetry of road transportation networks on the traveling salesman problem. Comput Oper Res 39(7):1566\u20131576","journal-title":"Comput Oper Res"},{"key":"1279_CR30","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi XH, Liang YC, Lee HP, Lu C, Wang QX (2007) Particle swarm optimization based algorithms for TSP and generalized TSP. Inf Process Lett 103:169\u2013176","journal-title":"Inf Process Lett"},{"key":"1279_CR31","doi-asserted-by":"crossref","unstructured":"St\u00fctzle T, Hoos H (1998) Improvements on ant-system: introducing MAX-MIN ant system. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna, pp 245\u2013249","DOI":"10.1007\/978-3-7091-6492-1_54"},{"key":"1279_CR32","unstructured":"Thang NB, Mufit C (2005) Solving geometric TSP with ants. In: Genetic and evolutionary computation conference, Washington, DC, pp 271\u2013272"},{"key":"1279_CR33","unstructured":"Tsai CF, Tsai CW, Tseng CC (2002) A new approach for solving large traveling salesman problem. In: Proceedings of the 2002 congress on evolutionary computation, vol 2, pp 1636\u20131641"},{"issue":"2","key":"1279_CR34","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.rcim.2009.05.003","volume":"26","author":"Y Wang","year":"2010","unstructured":"Wang Y, Liu JH (2010) Chaotic particle swarm optimization for assembly sequence planning. Robot Comput Integr Manuf 26(2):212\u2013222","journal-title":"Robot Comput Integr Manuf"},{"key":"1279_CR35","unstructured":"Wang C, Zhang J, Yang J, Hu C, Liu J (2005) A modified particle swarm optimization algorithm and its application for solving traveling salesman problem. In: International conference on neural networks and brain, pp 689\u2013694"},{"key":"1279_CR36","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1109\/TEVC.2009.2016570","volume":"13","author":"YR Zhou","year":"2009","unstructured":"Zhou YR (2009) Runtime analysis of an ant colony optimization algorithm for TSP instances. IEEE Trans Evol Comput 13:1083\u20131092","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1279-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-014-1279-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1279-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T12:55:15Z","timestamp":1565355315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-014-1279-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,13]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["1279"],"URL":"https:\/\/doi.org\/10.1007\/s00500-014-1279-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,13]]}}}