{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,25]],"date-time":"2025-12-25T21:23:40Z","timestamp":1766697820284,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642217043"},{"type":"electronic","value":"9783642217050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21705-0_9","type":"book-chapter","created":{"date-parts":[[2011,7,26]],"date-time":"2011-07-26T01:46:02Z","timestamp":1311644762000},"page":"241-269","source":"Crossref","is-referenced-by-count":34,"title":["Optimization of Multiple Traveling Salesmen Problem by a Novel Representation Based Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Andr\u00e1s","family":"Kir\u00e1ly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1nos","family":"Abonyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0166-218X(86)90087-9","volume":"13","author":"A.I. Ali","year":"1986","unstructured":"Ali, A.I., Kennington, J.L.: The asymmetric m-traveling salesmen problem: a duality based branch-and-bound algorithm. Discrete Applied Mathematics\u00a013, 259\u2013276 (1986)","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"9_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1287\/mnsc.18.6.B279","volume":"18","author":"R.D. Angel","year":"1972","unstructured":"Angel, R.D., Caudle, W.L., Noonan, R., Whinston, A.: Computer-assisted school bus scheduling. Management Science\u00a018(6), 279\u2013288 (1972)","journal-title":"Management Science"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Back, T., Fogel, D.B., Michalewicz, Z.: Handbook of evolutionary computation. IOP Publishing Ltd (1997)","DOI":"10.1887\/0750308958"},{"issue":"9","key":"9_CR4","doi-asserted-by":"publisher","first-page":"3020","DOI":"10.1016\/j.cor.2007.01.029","volume":"35","author":"J. Bautista","year":"2008","unstructured":"Bautista, J., Fern\u00e1ndez, E., Pereira, J.: Solving an urban waste collection problem using ants heuristics. Computers & OR\u00a035(9), 3020\u20133033 (2008)","journal-title":"Computers & OR"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T. Bektas","year":"2006","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega\u00a034, 209\u2013219 (2006)","journal-title":"Omega"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1002\/net.3230040106","volume":"4","author":"E.J.B. Beltrami","year":"1972","unstructured":"Beltrami, E.J.B.: Networks and vehicle routing for municipal waste collection. Networks\u00a04(1), 65\u201394 (1972)","journal-title":"Networks"},{"issue":"10","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1109\/12.257714","volume":"42","author":"S. Bhide","year":"1993","unstructured":"Bhide, S., John, N., Kabuka, M.R.: A boolean neural network approach for the traveling salesman problem. IEEE Transactions on Computers\u00a042(10), 1271 (1993)","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1162\/evco.1996.4.4.361","volume":"4","author":"T. Blickle","year":"1996","unstructured":"Blickle, T., Thiele, L.: A comparison of selection schemes used in evolutionary algorithms. Evolutionary Computation\u00a04(4), 361\u2013394 (1996)","journal-title":"Evolutionary Computation"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.ejor.2005.04.027","volume":"175","author":"A.E. Carter","year":"2006","unstructured":"Carter, A.E., Ragsdale, C.T.: A new approach to solving the multiple traveling salesperson problem using genetic algorithms. European Journal of Operational Research\u00a0175, 246\u2013257 (2006)","journal-title":"European Journal of Operational Research"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"1753","DOI":"10.1145\/1068009.1068300","volume-title":"Proceedings of the 2005 Conference on Genetic and Evolutionary Computation","author":"R. Cavill","year":"2005","unstructured":"Cavill, R., Smith, S., Tyrrell, A.: Multi-chromosomal genetic programming. In: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, pp. 1753\u20131759. ACM, New York (2005)"},{"issue":"8","key":"9_CR11","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1287\/mnsc.34.8.1005","volume":"34","author":"J. Desrosier","year":"1988","unstructured":"Desrosier, J., Sauve, M., Soumis, F.: Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows. Management Science\u00a034(8), 1005\u20131022 (1988)","journal-title":"Management Science"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"717","DOI":"10.4028\/www.scientific.net\/MSF.626-627.717","volume":"626","author":"H. Feng","year":"2009","unstructured":"Feng, H., Bao, J., Jin, Y.: Particle swarm optimization combined with ant colony optimization for the multiple traveling salesman problem. Materials science forum, Trans. Tech.\u00a0626, 717\u2013722 (2009)","journal-title":"Materials science forum, Trans. Tech."},{"key":"9_CR13","unstructured":"Finke, G.: Network flow based branch and bound method for asymmetric traveling salesman problems. In: Symposium, X.I. (ed.) on Operations Research, Darmstadt, pp. 117\u2013119 (1986)"},{"key":"9_CR14","first-page":"284","volume-title":"Foundations of Genetic Algorithms","author":"B. Fox","year":"1991","unstructured":"Fox, B., McMahon, M.: Genetic operators for sequencing problems. In: Rawlins, G.J. (ed.) Foundations of Genetic Algorithms, pp. 284\u2013300. Morgan Kaufmann, San Francisco (1991)"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.ejor.2006.03.041","volume":"180","author":"C. Garcia-Martinez","year":"2007","unstructured":"Garcia-Martinez, C., Cord\u00f3n, O., Herrera, F.: A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria tsp. European Journal of Operational Research\u00a0180(1), 116\u2013148 (2007)","journal-title":"European Journal of Operational Research"},{"key":"9_CR16","volume-title":"Genetic algorithms and engineering design","author":"M. Gen","year":"1997","unstructured":"Gen, M., Cheng, R.: Genetic algorithms and engineering design. John Wiley and Sons, Inc., New York (1997)"},{"issue":"5","key":"9_CR17","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1002\/mde.4090110512","volume":"11","author":"F. Glover","year":"1990","unstructured":"Glover, F.: Artificial intelligence, heuristic frameworks and tabu search. Managerial and Decision Economics\u00a011(5), 365\u2013375 (1990)","journal-title":"Managerial and Decision Economics"},{"key":"9_CR18","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 Longman Publishing Co., Inc., Boston (1989)"},{"issue":"6","key":"9_CR19","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1287\/mnsc.16.6.B373","volume":"16","author":"S. Gorenstein","year":"1970","unstructured":"Gorenstein, S.: Printing press scheduling for multi-edition periodicals. Management Science\u00a016(6), 373\u2013383 (1970)","journal-title":"Management Science"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Gromicho, J., Paix\u00e3o, J., Bronco, I.: Exact solution of multiple traveling salesman problems. Combinatorial optimization: new frontiers in theory and practice, pp. 291\u2013292 (1992)","DOI":"10.1007\/978-3-642-77489-8_27"},{"key":"9_CR21","volume-title":"The Traveling Salesman Problem and Its Variations. Combinatorial Optimization","author":"G. Gutin","year":"2002","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Combinatorial Optimization. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"9_CR22","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Cambridge (1975)"},{"issue":"5","key":"9_CR23","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1287\/opre.25.5.871","volume":"25","author":"S. Hong","year":"1977","unstructured":"Hong, S., Padberg, M.W.: Note on the symmetric multiple traveling salesman problem with fixed charges. Operations Research\u00a025(5), 871\u2013874 (1977)","journal-title":"Operations Research"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Hsu, C.-Y., Tsai, M.-H., Chen, W.-M.: A study of feature-mapped approach to the multiple travelling salesmen problem. In: IEEE International Symposium on Circuits and Systems, vol.\u00a03, pp. 1589\u20131592 (1991)","DOI":"10.1109\/ISCAS.1991.176682"},{"key":"9_CR25","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1057\/jors.1980.188","volume":"31","author":"G. Laporte","year":"1980","unstructured":"Laporte, G., Nobert, Y.: A cutting planes algorithm for the m-salesmen problem. Journal of the Operational Research Society\u00a031, 1017\u20131023 (1980)","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0377-2217(95)00185-9","volume":"93","author":"C.J. Malmborg","year":"1996","unstructured":"Malmborg, C.J.: A genetic algorithm for service level based vehicle scheduling. European Journal of Operational Research\u00a093(1), 121\u2013134 (1996)","journal-title":"European Journal of Operational Research"},{"key":"9_CR27","first-page":"219","volume":"2","author":"K. Mathias","year":"1992","unstructured":"Mathias, K., Whitley, D.: Genetic operators, the fitness landscape and the traveling salesman problem. Parallel Problem Solving from Nature\u00a02, 219\u2013228 (1992)","journal-title":"Parallel Problem Solving from Nature"},{"issue":"1","key":"9_CR28","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01609016","volume":"15","author":"P. Miliotis","year":"1978","unstructured":"Miliotis, P.: Using cutting planes to solve the symmetric travelling salesman problem. Mathematical Programming\u00a015(1), 177\u2013188 (1978)","journal-title":"Mathematical Programming"},{"issue":"1","key":"9_CR29","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejor.2002.11.003","volume":"162","author":"G. Nagy","year":"2005","unstructured":"Nagy, G., Salhi, S.: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research\u00a0162(1), 126\u2013141 (2005)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"9_CR30","first-page":"480","volume":"8","author":"R. Nallusamy","year":"2009","unstructured":"Nallusamy, R., Duraiswamy, K., Dhanalaksmi, R., Parthiban, P.: Optimization of non-linear multiple traveling salesman problem using k-means clustering, shrink wrap algorithm and meta-heuristics. International Journal of Nonlinear Science\u00a08(4), 480\u2013487 (2009)","journal-title":"International Journal of Nonlinear Science"},{"issue":"2","key":"9_CR31","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0925-5273(00)00174-2","volume":"73","author":"Y.B. Park","year":"2001","unstructured":"Park, Y.B.: A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines. International Journal of Productions Economics\u00a073(2), 175\u2013188 (2001)","journal-title":"International Journal of Productions Economics"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-63797-4_66","volume-title":"Advanced Topics in Artificial Intelligence","author":"H.J. Pierrot","year":"1997","unstructured":"Pierrot, H.J., Hinterding, R.: Multi-chromosomal genetic programming. In: Sattar, A. (ed.) Canadian AI 1997. LNCS, vol.\u00a01342, pp. 137\u2013146. Springer, Heidelberg (1997)"},{"issue":"3","key":"9_CR33","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02125403","volume":"63","author":"J.Y. Potvin","year":"1996","unstructured":"Potvin, J.Y.: Genetic algorithms for the traveling salesman problem. Annals of Operations Research\u00a063(3), 337\u2013370 (1996)","journal-title":"Annals of Operations Research"},{"key":"9_CR34","first-page":"474","volume":"27","author":"J.Y.P. Potvin","year":"1989","unstructured":"Potvin, J.Y.P., Lapalme, G., Rousseau, J.: A generalized k-opt exchange procedure for the mtsp. INFOR\u00a027, 474\u2013481 (1989)","journal-title":"INFOR"},{"key":"9_CR35","unstructured":"Ronald, S., Kirkby, S.: Compound optimization. solving transport and routing problems with a multi-chromosome genetic algorithm. In: The 1998 IEEE International Conference on Evolutionary Computation, ICEC 1998, pp. 365\u2013370 (1998)"},{"key":"9_CR36","volume-title":"Introduction to Probability Models","author":"S.M. Ross","year":"1984","unstructured":"Ross, S.M.: Introduction to Probability Models. Academic Press, New York (1984)"},{"issue":"3","key":"9_CR37","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1287\/opre.25.3.517","volume":"25","author":"R.A. Russell","year":"1977","unstructured":"Russell, R.A.: An effective heuristic for the m-tour traveling salesman problem with some side conditions. Operations Research\u00a025(3), 517\u2013524 (1977)","journal-title":"Operations Research"},{"issue":"1","key":"9_CR38","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.engappai.2003.11.001","volume":"17","author":"H.A. Saleh","year":"2003","unstructured":"Saleh, H.A., Chelouah, R.: The design of the global navigation satellite system surveying networks using genetic algorithms. Engineering Applications of Artificial Intelligence\u00a017(1), 111\u2013122 (2003)","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"7","key":"9_CR39","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1287\/mnsc.19.7.790","volume":"19","author":"J.A. Svestka","year":"1973","unstructured":"Svestka, J.A., Huckfeldt, V.E.: Computational experience with an m-salesman traveling salesman algorithm. Management Science\u00a019(7), 790\u2013799 (1973)","journal-title":"Management Science"},{"issue":"2","key":"9_CR40","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0377-2217(99)00380-X","volume":"124","author":"L. Tanga","year":"2000","unstructured":"Tanga, L., Liu, J., Rongc, A., Yanga, Z.: A multiple traveling salesman problem model for hot rolling scheduling in shangai baoshan iron & steel complex. European Journal of Operational Research\u00a0124(2), 267\u2013282 (2000)","journal-title":"European Journal of Operational Research"},{"key":"9_CR41","unstructured":"Yoshiji, F., Yuki, A., Tsuyoshi, Y.: Applying the genetic algorithm with multi-chromosomes to order problems. In: Proceedings of the Annual Conference of JSAI, vol.\u00a013, pp. 468\u2013471 (2001)"},{"key":"9_CR42","unstructured":"Yu, Z., Jinhai, L., Guochang, G., Rubo, Z., Haiyan, Y.: An implementation of evolutionary computation for path planning of cooperative mobile robots. In: Proceedings of the 4th World Congress on Intelligent Control and Automation, pp. 1798\u20131802 (2002)"},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Zhang, T., Gruver, W., Smith, M.: Team scheduling by genetic search. In: Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials, vol.\u00a02, pp. 839\u2013844 (1999)","DOI":"10.1109\/IPMM.1999.791495"}],"container-title":["Studies in Computational Intelligence","Intelligent Computational Optimization in Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21705-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T12:17:15Z","timestamp":1741349835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21705-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642217043","9783642217050"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21705-0_9","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2011]]}}}