{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T02:50:30Z","timestamp":1770605430548,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"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":[[2017,4]]},"DOI":"10.1007\/s00500-015-1886-z","type":"journal-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T05:48:44Z","timestamp":1443678524000},"page":"1863-1875","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Imperial competitive algorithm with policy learning for the traveling salesman problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Meng-Hui","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shih-Hsin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pei-Chann","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,1]]},"reference":[{"issue":"1","key":"1886_CR1","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1007\/978-3-540-45210-2_35","volume":"2809","author":"M Affenzeller","year":"2003","unstructured":"Affenzeller M, Wanger S (2003) A self-adaptive model for selective pressure handling within the theory of genetic algorithms. Lect Notes Comput Sci 2809(1):384\u2013393","journal-title":"Lect Notes Comput Sci"},{"key":"1886_CR2","doi-asserted-by":"crossref","unstructured":"Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE congress on evolutionary computation, pp 4661\u20134667","DOI":"10.1109\/CEC.2007.4425083"},{"issue":"1","key":"1886_CR3","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.ejor.2003.10.016","volume":"162","author":"L Bianchi","year":"2005","unstructured":"Bianchi L, Knowles J, Bowler J (2005) Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms. Eur J Oper Res 162(1):206\u2013219","journal-title":"Eur J Oper Res"},{"key":"1886_CR4","unstructured":"Bonyadi RM, Rahimi Azghadi SM, Shah-Hosseini H (2007) Solving travelingsalesman problem using combinational evolutionary algorithm. In: Boukis C, Pnevmatikakis L, Polymenakos L (eds) IFIP international federation for information processing. Artificial intelligence and innovations 2007: from theory to applications, vol 247, Springer, Boston, pp 37\u201344"},{"key":"1886_CR5","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1162\/neco.1996.8.2.416","volume":"8","author":"M Budinich","year":"1996","unstructured":"Budinich M (1996) A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing. Neural Comput 8:416\u2013424","journal-title":"Neural Comput"},{"issue":"6","key":"1886_CR6","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1007\/s00500-013-1136-1","volume":"18","author":"PC Chang","year":"2014","unstructured":"Chang PC, Chen MH (2014) A block based estimation of distribution algorithm using bivariate model for scheduling problems. Soft Comput 18(6):1177\u20131188","journal-title":"Soft Comput"},{"issue":"1","key":"1886_CR7","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10479-008-0489-9","volume":"180","author":"PC Chang","year":"2010","unstructured":"Chang PC, Chen SH, Fan CY (2010) Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems. Ann Oper Res 180(1):197\u2013211","journal-title":"Ann Oper Res"},{"issue":"1","key":"1886_CR8","doi-asserted-by":"crossref","first-page":"4536","DOI":"10.1016\/j.asoc.2013.07.018","volume":"13","author":"PC Chang","year":"2013","unstructured":"Chang PC, Chen MH, Tiwari MK, Iquebal AS (2013) A block-based evolutionary algorithm for flow-shop scheduling problem. Appl Soft Comput 13(1):4536\u20134547","journal-title":"Appl Soft Comput"},{"key":"1886_CR9","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s00500-011-0759-3","volume":"16","author":"J Cheng","year":"2012","unstructured":"Cheng J, Zhang G, Li Z, Li Y (2012) Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems. Soft Comput 16:597\u2013614","journal-title":"Soft Comput"},{"issue":"1\u20134","key":"1886_CR10","first-page":"63","volume":"167","author":"SC Chu","year":"2004","unstructured":"Chu SC, Roddick JF, Pan JS (2004) Ant colony system with communication strategies. Inf Sci 167(1\u20134):63\u201376","journal-title":"Inf Sci"},{"key":"1886_CR11","volume-title":"Genetic algorithms in search, optimization and machine learning (book style)","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning (book style). Addison-Wesley, Boston"},{"key":"1886_CR12","unstructured":"Gutin G, Punnen AP (2002) The traveling salesman problem and its variations. Springer, New York"},{"key":"1886_CR13","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0202009","volume":"2","author":"JH Holland","year":"1973","unstructured":"Holland JH (1973) Genetic algorithms and the optimal allocation of trials. SIAM J Comput 2:88\u2013105","journal-title":"SIAM J Comput"},{"key":"1886_CR14","first-page":"771","volume":"6","author":"WH Huang","year":"2012","unstructured":"Huang WH, Chang PC, Wang LC (2012) A fast block-based evolutional algorithm for combinatorial problems. World Acad Sci Eng Technol 6:771\u2013777","journal-title":"World Acad Sci Eng Technol"},{"key":"1886_CR15","first-page":"215","volume-title":"Local search in combinatorial optimization","author":"DS Johnson","year":"1997","unstructured":"Johnson DS, McGeoch LA (1997) The traveling salesman problem: a case study in local optimization. In: Aarts EHL, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, Chichester, pp 215\u2013310"},{"issue":"2","key":"1886_CR16","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(2):345\u2013358","journal-title":"Eur J Oper Res"},{"key":"1886_CR17","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larranaga","year":"1999","unstructured":"Larranaga P, Kuijpers CMH, Murga RH, Inza I, Dizdarevic S (1999) Genetic algorithms for the travelling salesman problems: a review of representations and operators. Artif Intell Rev 13:129\u2013170","journal-title":"Artif Intell Rev"},{"key":"1886_CR18","unstructured":"Lee ZJ (2004) A hybrid algorithm applied to traveling salesman problem. In: Proceedings of the 2004 IEEE international conference on networking, sensing and control, pp 237\u2013242"},{"key":"1886_CR19","first-page":"267","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. Neural comput 62:267\u2013292","journal-title":"Neural comput"},{"key":"1886_CR20","unstructured":"Liu G, He Y, Fang Y, Qiu Y (2003) A novel adaptive search strategy of intensification and diversification in tabu search. In: Proceedings of IEEE international conference on neural networks and signal processing, Nanjing, pp 14\u201317"},{"key":"1886_CR21","volume-title":"Evolutionary optimization","author":"M Mohammadian","year":"2002","unstructured":"Mohammadian M, Sarker R, Yao X (2002) Evolutionary optimization. Kluwer Academic, Boston"},{"key":"1886_CR22","first-page":"54","volume":"30","author":"S Nozarian","year":"2012","unstructured":"Nozarian S, Jahan MV (2012) A novel memetic algorithm with imperialist competition as local search. IPCSIT Hong Kong Conf 30:54\u201359","journal-title":"IPCSIT Hong Kong Conf"},{"issue":"3","key":"1886_CR23","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1080\/00207540310001614150","volume":"44","author":"GC Onwubolu","year":"2004","unstructured":"Onwubolu GC, Clerc M (2004) Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization. Int J Prod Res 44(3):473\u2013491","journal-title":"Int J Prod Res"},{"key":"1886_CR24","doi-asserted-by":"crossref","unstructured":"Ouaarab A, Ahiod B, Yang XS (2015) Random-key cuckoo search for the travelling salesman problem. Soft Comput 19(4):1099\u20131106","DOI":"10.1007\/s00500-014-1322-9"},{"issue":"2","key":"1886_CR25","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.omega.2011.05.002","volume":"40","author":"QK Pan","year":"2012","unstructured":"Pan QK, Ruiz R (2012) An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega 40(2):166\u2013180","journal-title":"Omega"},{"key":"1886_CR26","doi-asserted-by":"crossref","unstructured":"Pasti R, de Castro LN (2006) A neuro-immune network for solving the traveling salesman problem. In: Proceedings of international joint conference on neural networks, vol 6, Sheraton Vancouver Wall Centre Hotel, Vancouver, 16\u201321 July 2006, pp 3760\u20133766","DOI":"10.1109\/IJCNN.2006.247394"},{"key":"1886_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0721-7","volume-title":"Intelligent optimization techniques: genetic algorithms. Tabu search, simulated annealing and neural networks","author":"DT Pham","year":"2000","unstructured":"Pham DT, Karaboga D (2000) Intelligent optimization techniques: genetic algorithms. Tabu search, simulated annealing and neural networks. Springer, London"},{"key":"1886_CR28","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1057\/palgrave.jors.2600439","volume":"48","author":"S Somhom","year":"1997","unstructured":"Somhom S, Modares A, Enkawa T (1997) A self-organizing model for the travelling salesman problem. J Oper Res Soc 48:919\u2013928","journal-title":"J Oper Res Soc"},{"key":"1886_CR29","unstructured":"Wang YW, Wu JL, Lin JL (2011) Artificial chromosomes embedded in sub-population genetic algorithm for a multi-objective scheduling problem. In: 3rd international conference on information and financial engineering, vol 12. IPEDR IACSIT Press, Singapore, pp 108\u2013112"},{"key":"1886_CR30","unstructured":"Yan XS, Li H, CAI ZH, Kang LS (2005) A fast evolutionary algorithm for combinatorial optimization problem. In: Proceedings of the fourth international conference on machine learning and cybernetics, pp 3288\u20133292"},{"key":"1886_CR31","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s00500-014-1279-8","volume":"19","author":"W Yong","year":"2015","unstructured":"Yong W (2015) Hybrid max\u2013min ant system with four vertices and three lines inequality for traveling salesman problem. Soft Comput 19:585\u2013596","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1886-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1886-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1886-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1886-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:43:52Z","timestamp":1559094232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1886-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,1]]},"references-count":31,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["1886"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1886-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,1]]}}}