{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:48:34Z","timestamp":1760298514808},"reference-count":32,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1016\/j.asoc.2012.04.008","type":"journal-article","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T12:45:47Z","timestamp":1336049147000},"page":"1365-1375","source":"Crossref","is-referenced-by-count":43,"title":["A model induced max-min ant colony optimization for asymmetric traveling salesman problem"],"prefix":"10.1016","volume":"13","author":[{"given":"Jie","family":"Bai","sequence":"first","affiliation":[]},{"given":"Gen-Ke","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Yu-Wang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Li-Sheng","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Chang-Chun","family":"Pan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.asoc.2012.04.008_bib0005","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.ijpe.2004.04.011","article-title":"Optimal and near-optimal algorithms to rolling batch scheduling for seamless steel tube production","volume":"105","author":"Tang","year":"2007","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"10.1016\/j.asoc.2012.04.008_bib0010","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.cie.2008.05.001","article-title":"A method of solving a large-scale rolling batch scheduling problem in steel production using a variant of column generation","volume":"56","author":"Pan","year":"2009","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.asoc.2012.04.008_bib0015","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/j.ejor.2009.01.036","article-title":"Using a TSP heuristic for routing order pickers in warehouses","volume":"200","author":"Theys","year":"2010","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.asoc.2012.04.008_bib0020","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1016\/j.cor.2010.12.003","article-title":"An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times","volume":"39","author":"Keskinturk","year":"2012","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.asoc.2012.04.008_bib0025","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Ant colony system: a cooperative learning approach to the traveling salesman problem","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"6791","key":"10.1016\/j.asoc.2012.04.008_bib0030","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1038\/35017500","article-title":"Inspiration for optimization from social insect behaviour","volume":"406","author":"Bonabeau","year":"2000","journal-title":"Nature"},{"issue":"2","key":"10.1016\/j.asoc.2012.04.008_bib0035","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1109\/TSMCB.2003.821450","article-title":"The hyper-cube framework for ant colony optimization","volume":"34","author":"Blum","year":"2004","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics"},{"issue":"2\u20133","key":"10.1016\/j.asoc.2012.04.008_bib0040","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","article-title":"Ant colony optimization theory: a survey","volume":"344","author":"Dorigo","year":"2005","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10.1016\/j.asoc.2012.04.008_bib0045","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/S0377-2217(98)00099-X","article-title":"Guided local search and its application to the traveling salesman problem","volume":"113","author":"Voudouris","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.asoc.2012.04.008_bib0050","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1016\/j.mcm.2006.11.035","article-title":"A modified ant colony system for solving the travelling salesman problem with time windows","volume":"46","author":"Cheng","year":"2007","journal-title":"Mathematical and Computer Modelling"},{"issue":"11","key":"10.1016\/j.asoc.2012.04.008_bib0055","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1016\/j.pnsc.2008.03.028","article-title":"An ant colony optimization method for generalized TSP problem","volume":"18","author":"Yang","year":"2008","journal-title":"Progress in Natural Science"},{"issue":"5","key":"10.1016\/j.asoc.2012.04.008_bib0060","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.advengsoft.2008.05.004","article-title":"An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms","volume":"40","author":"Aybars","year":"2009","journal-title":"Advances in Engineering Software"},{"issue":"7","key":"10.1016\/j.asoc.2012.04.008_bib0065","doi-asserted-by":"crossref","first-page":"5443","DOI":"10.1016\/j.eswa.2010.02.069","article-title":"Analysis of the efficacy of a two-stage methodology for ant colony optimization: case of study with TSP and QAP","volume":"37","author":"Puris","year":"2010","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"10.1016\/j.asoc.2012.04.008_bib0070","doi-asserted-by":"crossref","first-page":"1256","DOI":"10.1016\/j.asoc.2010.03.002","article-title":"An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems","volume":"11","author":"Ghafurian","year":"2011","journal-title":"Applied Soft Computing"},{"issue":"12","key":"10.1016\/j.asoc.2012.04.008_bib0075","doi-asserted-by":"crossref","first-page":"14439","DOI":"10.1016\/j.eswa.2011.04.163","article-title":"Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques","volume":"38","author":"Chen","year":"2011","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.asoc.2012.04.008_bib0080","article-title":"Solving the traveling salesman problem using cooperative genetic ant systems","author":"Dong","year":"2011","journal-title":"Expert Systems with Applications"},{"issue":"4","key":"10.1016\/j.asoc.2012.04.008_bib0085","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/ijoc.11.4.358","article-title":"Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem","volume":"11","author":"Maniezzo","year":"1999","journal-title":"INFORMS Journal on Computing"},{"issue":"5","key":"10.1016\/j.asoc.2012.04.008_bib0090","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/S0305-0548(02)00050-3","article-title":"A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem","volume":"30","author":"Choi","year":"2003","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.asoc.2012.04.008_bib0095","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/S0305-0548(03)00248-X","article-title":"Embedded local search approaches for routing optimization","volume":"32","author":"Cowling","year":"2005","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.asoc.2012.04.008_bib0100","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No free lunch theorems for optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"6","key":"10.1016\/j.asoc.2012.04.008_bib0105","doi-asserted-by":"crossref","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","article-title":"Hybrid metaheuristics in combinatorial optimization: a survey","volume":"11","author":"Blum","year":"2011","journal-title":"Applied Soft Computing"},{"issue":"3","key":"10.1016\/j.asoc.2012.04.008_bib0110","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/j.ejor.2007.07.035","article-title":"Hybridizing exact methods and metaheuristics: a taxonomy","volume":"199","author":"Jourdan","year":"2009","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"10.1016\/j.asoc.2012.04.008_bib0115","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"MAX-MIN ant system","volume":"16","author":"Stutzle","year":"2000","journal-title":"Future Generation Computer Systems"},{"issue":"4","key":"10.1016\/j.asoc.2012.04.008_bib0120","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1109\/TEVC.2002.802444","article-title":"A short convergence proof for a class of ant colony optimization algorithms","volume":"6","author":"Stutzle","year":"2002","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"4","key":"10.1016\/j.asoc.2012.04.008_bib0125","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0208045","article-title":"A patching algorithm for the nonsymmetric traveling-salesman problem","volume":"8","author":"Karp","year":"1979","journal-title":"SIAM Journal on Computing"},{"issue":"1\u20132","key":"10.1016\/j.asoc.2012.04.008_bib0130","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0166-218X(99)00172-9","article-title":"Algorithms and codes for dense assignment problems: the state of the art","volume":"100","author":"Dell\u2019Amico","year":"2000","journal-title":"Discrete Applied Mathematics"},{"issue":"4995","key":"10.1016\/j.asoc.2012.04.008_bib0135","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1126\/science.251.4995.754","article-title":"Exact solution of large asymmetric traveling salesman problems","volume":"251","author":"Miller","year":"1991","journal-title":"Science"},{"issue":"23\u201324","key":"10.1016\/j.asoc.2012.04.008_bib0140","doi-asserted-by":"crossref","first-page":"4459","DOI":"10.1016\/j.physa.2011.06.070","article-title":"Improved extremal optimization for the asymmetric traveling salesman problem","volume":"390","author":"Chen","year":"2011","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"issue":"1","key":"10.1016\/j.asoc.2012.04.008_bib0145","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.physa.2007.06.014","article-title":"Optimization with extremal dynamics for the traveling salesman problem","volume":"385","author":"Chen","year":"2007","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"issue":"4","key":"10.1016\/j.asoc.2012.04.008_bib0150","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/212066.212081","article-title":"Exact solution of large-scale, asymmetric traveling salesman problems","volume":"21","author":"Carpaneto","year":"1995","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"5","key":"10.1016\/j.asoc.2012.04.008_bib0155","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1137\/S0097539701391518","article-title":"The probabilistic relationship between the assignment and asymmetric traveling salesman problems","volume":"36","author":"Frieze","year":"2007","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.asoc.2012.04.008_bib0160","series-title":"Operations Research Mathematical Programming","year":"2002"}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1568494612001901?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1568494612001901?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,23]],"date-time":"2018-11-23T18:02:15Z","timestamp":1542996135000},"score":1,"resource":{"primary":{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494612001901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["S1568494612001901"],"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1016\/j.asoc.2012.04.008","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2013,3]]}}}