{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:36:38Z","timestamp":1725518198813},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859833"},{"type":"electronic","value":"9783540859840"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85984-0_21","type":"book-chapter","created":{"date-parts":[[2008,9,7]],"date-time":"2008-09-07T21:00:48Z","timestamp":1220821248000},"page":"164-173","source":"Crossref","is-referenced-by-count":1,"title":["A Parallel Multi-algorithm Solver for Dynamic Multi-Objective TSP (DMO-TSP)"],"prefix":"10.1007","author":[{"given":"Ming","family":"Yang","sequence":"first","affiliation":[]},{"given":"Zhou","family":"Kang","sequence":"additional","affiliation":[]},{"given":"Lishan","family":"Kang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An Effective Heuristic Algorithm for the Traveling Salesman Problem. Operations Research\u00a021, 498\u2013516 (1973)","journal-title":"Operations Research"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K. Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic. Eur. J. Oper. Res.\u00a0126, 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"unstructured":"Guo, T.: Evolutionary Computation and Optimization (Ph.D Thesis). Wuhan University, Wuhan (May 2000)","key":"21_CR3"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","first-page":"803","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"T. Guo","year":"1998","unstructured":"Guo, T., Michalewicz, Z.: Inver-Over Operator for the TSP. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 803\u2013812. Springer, Heidelberg (1998)"},{"key":"21_CR5","first-page":"223","volume-title":"Vehicle Routing: Methods and Studies","author":"H.N. Psaraftis","year":"1988","unstructured":"Psaraftis, H.N.: Dynamic Vehicle Routing Problems. In: Golden, B.L., Assad, A.A. (eds.) Vehicle Routing: Methods and Studies, pp. 223\u2013248. Elsevier Science Publishers, Amsterdam (1988)"},{"unstructured":"Guntsch, M., Branke, J., Middendorf, M., Schmeck, H.: ACO Strategies for Dynamic TSP. In: Dorrigo, M., et al. (eds.) Abstract Proceedings of ANTS 2000, pp. 59\u201362 (2000)","key":"21_CR6"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-45365-2_22","volume-title":"Applications of Evolutionary Computing","author":"M. Guntsch","year":"2001","unstructured":"Guntsch, M., Middendorf, M.: Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol.\u00a02037, pp. 213\u2013220. Springer, Heidelberg (2001)"},{"key":"21_CR8","first-page":"860","volume-title":"Proceedings of the GECCO 2001","author":"M. Guntsch","year":"2001","unstructured":"Guntsch, M., Middendorf, M., Schmeck, H.: An Ant Colony Optimization Approach to Dynamic TSP. In: Proceedings of the GECCO 2001, pp. 860\u2013867. Morgan Kaufmann, San Francisco (2001)"},{"issue":"4","key":"21_CR9","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/s004530010071","volume":"29","author":"G. Ausiello","year":"2001","unstructured":"Ausiello, G., Feuestein, E., Leonardi, S., Stougie, L., Talamo, M.: Algorithms for the On-line Traveling Salesman. Algorithmica\u00a029(4), 560\u2013581 (2001)","journal-title":"Algorithmica"},{"unstructured":"Kang, L.S., Zhou, A., McKay, B., Li, Y., Kang, Z.: Benchmarking Algorithms for Dynamic Travelling Salesman Problems. In: Proceedings of the Congress on Evolutionary Computation, Portland, Oregon (2004)","key":"21_CR10"},{"issue":"6114","key":"21_CR11","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1038\/326689a0","volume":"326","author":"R. Durbin","year":"1987","unstructured":"Durbin, R., Willshaw, D.: An Analogue Approach to the Traveling Salesman Problem Using an Elastic Net Method. Nature\u00a0326(6114), 689\u2013691 (1987)","journal-title":"Nature"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-36970-8_24","volume-title":"Evolutionary Multi-Criterion Optimization","author":"Z.Y. Yan","year":"2003","unstructured":"Yan, Z.Y., Zhang, L.H., Kang, L.S., Lin, G.M.: A New MOEA for Multi-objective TSP and Its Convergence Property Analysis. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol.\u00a02632, pp. 342\u2013354. Springer, Heidelberg (2003)"},{"key":"21_CR13","first-page":"174","volume-title":"Congress on Evolution Compution (CEC 2004)","author":"Z.W. Ji","year":"2004","unstructured":"Ji, Z.W., Chen, A., Kitti, S.: Finding Multi-Objective Paths in Stochastic Networks: A Simulation-based Genetic Algorithm Approach. In: Congress on Evolution Compution (CEC 2004), pp. 174\u2013180. IEEE Press, Los Alamitos (2004)"},{"key":"21_CR14","first-page":"1964","volume-title":"Congress on Evolution Compution (CEC 2004)","author":"S. Marwaha","year":"2004","unstructured":"Marwaha, S., Srinivasan, D., Tham, C.K., et al.: Evolutionary Fuzzy Multi-Objective Routing For Wireless Mobile Ad Hoc Networks. In: Congress on Evolution Compution (CEC 2004), pp. 1964\u20131971. IEEE Press, Los Alamitos (2004)"},{"key":"21_CR15","volume-title":"Cours D\u2019 Economie Politique","author":"V. Pareto","year":"1896","unstructured":"Pareto, V.: Cours D\u2019 Economie Politique, vol.\u00a0I. F. Rouge, Lausanne (1896)"},{"issue":"1","key":"21_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.H. Wolpert","year":"1997","unstructured":"Wolpert, D.H., MacReady, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput.\u00a01(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"unstructured":"Kang, L.S., Jin, H.Y., et al.: The Split Method for Solving High-dimensional Partial Differential Equations, pp. 160\u2013196. Science and Technology of Shanghai Press (1990)","key":"21_CR17"},{"key":"21_CR18","first-page":"164","volume-title":"Proceedings of the 1997 IEEE International Conference on Evolutionary Computation","author":"M. Peter","year":"1997","unstructured":"Peter, M., Freisleben, B.: Genetic Local Search for the TSP: New Results. In: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, pp. 164\u2013259. IEEE Press, NJ (1997)"},{"issue":"6","key":"21_CR19","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/4235.974843","volume":"5","author":"R. Baraglia","year":"2001","unstructured":"Baraglia, R., Hidalgo, J.I., Perego, R.: A Hybrid Heuristic for the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation\u00a05(6), 613\u2013622 (2001)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1B","key":"21_CR20","first-page":"217","volume":"8","author":"Yang","year":"2003","unstructured":"Yang, Hui, Kang, L.S., Chen, Y.P.: A Gene-pool Based Genetic Algorithm for TSP. Wuhan University Journal of Nature Sciences\u00a08(1B), 217\u2013223 (2003)","journal-title":"Wuhan University Journal of Nature Sciences"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/0377-2217(83)90161-3","volume":"12","author":"T. Volgenant","year":"1983","unstructured":"Volgenant, T., Jonker, R.: The Symmetric Traveling Salesman Problem and Edge Exchange i Minimal 1-Trees. Eur. J. Oper. Res.\u00a012, 394\u2013403 (1983)","journal-title":"Eur. J. Oper. Res."},{"unstructured":"TSP Library (2006), \n                    \n                      http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/tsp","key":"21_CR22"},{"unstructured":"Goldberg, D.E., Lingle, R.: Alletes, Loci, and the TSP. In: Proceedings of the First International Conference on Genetic Algorithms. Lawrence Erlbaum Associates, Hilladale, pp. 154\u2013159 (1985)","key":"21_CR23"},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1073\/pnas.0610471104","volume":"104","author":"J.A. Vrugt","year":"2007","unstructured":"Vrugt, J.A., Robinsion, B.A.: Improved evolutionary optimization from genetically adaptive multi-method search. Proceedings of the National Academy of Sciences of the United stats of America\u00a0104, 708\u2013711 (2007)","journal-title":"Proceedings of the National Academy of Sciences of the United stats of America"},{"doi-asserted-by":"crossref","unstructured":"Corne, D., Knowles, J.: Techniques for Highly Multi-objective Optimization: Some Nondominated Points are Better than Others. In: Proceedings of GECCO, pp. 773\u2013780 (2007)","key":"21_CR25","DOI":"10.1145\/1276958.1277115"},{"unstructured":"Yang, M., Kang, L.S., Guan, J.: Multi-Algorithm Co-evolution Strategy for Dynamic Multi-Objective TSP. In: Proceedings of the Congress on Evolutionary Computation (CEC 2008), Hong Kong (2008)","key":"21_CR26"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85984-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T10:31:54Z","timestamp":1580380314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85984-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859833","9783540859840"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85984-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}