{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:52:27Z","timestamp":1725583947581},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215148"},{"type":"electronic","value":"9783642215155"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21515-5_42","type":"book-chapter","created":{"date-parts":[[2011,5,30]],"date-time":"2011-05-30T11:33:45Z","timestamp":1306755225000},"page":"355-363","source":"Crossref","is-referenced-by-count":0,"title":["Collaborative Optimization under a Control Framework for ATSP"],"prefix":"10.1007","author":[{"given":"Jie","family":"Bai","sequence":"first","affiliation":[]},{"given":"Jun","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Gen-Ke","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Chang-Chun","family":"Pan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"42_CR1","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1109\/TSMCB.2003.821450","volume":"34","author":"C. Blum","year":"2004","unstructured":"Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics\u00a034(2), 1161\u20131172 (2004)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics"},{"issue":"4","key":"42_CR2","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/212066.212081","volume":"21","author":"G. Carpaneto","year":"1995","unstructured":"Carpaneto, G., Dell\u2019Amico, M., et al.: Exact solution of large-scale, asymmetric traveling salesman problems. ACM Trans. Math. Softw.\u00a021(4), 394\u2013409 (1995)","journal-title":"ACM Trans. Math. Softw."},{"issue":"5","key":"42_CR3","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/S0305-0548(02)00050-3","volume":"30","author":"I.-C. Choi","year":"2003","unstructured":"Choi, I.-C., Kim, S.-I., et al.: A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem. Comput. Oper. Res.\u00a030(5), 773\u2013786 (2003)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"42_CR4","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1016\/j.compchemeng.2003.09.001","volume":"28","author":"J. Choi","year":"2004","unstructured":"Choi, J., Realff, M.J., et al.: An algorithmic framework for improving heuristic solutions Part I. A deterministic discount coupon traveling salesman problem Computers & Chemical Engineering 28(1): 1285-1296 (2004). Computers & Chemical Engineering\u00a028(1), 1285\u20131296 (2004)","journal-title":"Computers & Chemical Engineering"},{"issue":"1-2","key":"42_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0166-218X(99)00172-9","volume":"100","author":"M. Dell\u2019Amico","year":"2000","unstructured":"Dell\u2019Amico, M., Toth, P.: Algorithms and codes for dense assignment problems: the state of the art. Discrete Applied Mathematics\u00a0100(1-2), 17\u201348 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"42_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"42_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(92)00033-I","volume":"51","author":"C.N.. Fiechter","year":"1994","unstructured":"Fiechter, C.N.: A parallel tabu search algorithm for large traveling salesman problems. Discrete Appl. Math.\u00a051(3), 243\u2013267 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"11","key":"42_CR8","doi-asserted-by":"publisher","first-page":"1520","DOI":"10.1287\/mnsc.43.11.1520","volume":"43","author":"M. Fischetti","year":"1997","unstructured":"Fischetti, M., Toth, P.: A Polyhedral Approach to the Asymmetric Traveling Salesman Problem. Management Science\u00a043(11), 1520\u20131536 (1997)","journal-title":"Management Science"},{"issue":"3","key":"42_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/S0377-2217(99)00468-3","volume":"129","author":"F. Glover","year":"2001","unstructured":"Glover, F., Gutin, G., et al.: Construction heuristics for the asymmetric TSP. European Journal of Operational Research\u00a0129(3), 555\u2013568 (2001)","journal-title":"European Journal of Operational Research"},{"key":"42_CR10","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)"},{"issue":"12","key":"42_CR11","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1145\/2135.2141","volume":"27","author":"D.L.. John","year":"1984","unstructured":"John, D.L.: An improved solution to the traveling salesman problem with thousands of nodes. Commun. ACM\u00a027(12), 1227\u20131236 (1984)","journal-title":"Commun. ACM"},{"issue":"3","key":"42_CR12","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.ejor.2007.07.035","volume":"199","author":"L. Jourdan","year":"2009","unstructured":"Jourdan, L., Basseur, M., et al.: Hybridizing exact methods and metaheuristics: A taxonomy. European Journal of Operational Research\u00a0199(3), 620\u2013629 (2009)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"42_CR13","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1137\/0208045","volume":"8","author":"R.M.. Karp","year":"1979","unstructured":"Karp, R.M.: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem. SIAM Journal on Computing\u00a08(4), 561\u2013573 (1979)","journal-title":"SIAM Journal on Computing"},{"key":"42_CR14","series-title":"Mathematics and Its Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated Annealing: Theory and Applications","author":"P.J.v. Laarhoven","year":"1987","unstructured":"Laarhoven, P.J.v., Aarts, E.H.: Simulated Annealing: Theory and Applications. Mathematics and Its Applications. Springer, Heidelberg (1987)"},{"issue":"2-3","key":"42_CR15","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"D. Marco","year":"2005","unstructured":"Marco, D., Christian, B.: Ant colony optimization theory: a survey. Theor. Comput. Sci.\u00a0344(2-3), 243\u2013278 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"4995","key":"42_CR16","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1126\/science.251.4995.754","volume":"251","author":"D.L. Miller","year":"1991","unstructured":"Miller, D.L., Pekny, J.F.: Exact Solution of Large Asymmetric Traveling Salesman Problems. Science\u00a0251(4995), 754\u2013761 (1991)","journal-title":"Science"},{"issue":"1","key":"42_CR17","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.cie.2008.05.001","volume":"56","author":"C. Pan","year":"2009","unstructured":"Pan, C., Yang, G.K.: A method of solving a large-scale rolling batch scheduling problem in steel production using a variant of column generation. Comput. Ind. Eng.\u00a056(1), 165\u2013178 (2009)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"42_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0377-2217(99)00380-X","volume":"124","author":"L.X. Tang","year":"2000","unstructured":"Tang, L.X., Liu, J.Y., et al.: A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex. European Journal of Operational Research\u00a0124(2), 267\u2013282 (2000)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"42_CR19","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/j.ejor.2006.10.062","volume":"189","author":"M. Turkensteen","year":"2008","unstructured":"Turkensteen, M., Ghosh, D., et al.: Tolerance-based Branch and Bound algorithms for the ATSP. European Journal of Operational Research\u00a0189(3), 775\u2013788 (2008)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21515-5_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T23:12:09Z","timestamp":1553728329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21515-5_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215148","9783642215155"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21515-5_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}