{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T19:05:00Z","timestamp":1773515100274,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,5,21]],"date-time":"2008-05-21T00:00:00Z","timestamp":1211328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1007\/s00500-008-0312-1","type":"journal-article","created":{"date-parts":[[2008,5,20]],"date-time":"2008-05-20T10:14:39Z","timestamp":1211278479000},"page":"95-101","source":"Crossref","is-referenced-by-count":100,"title":["A new grouping genetic algorithm approach to the multiple traveling salesperson problem"],"prefix":"10.1007","volume":"13","author":[{"given":"Alok","family":"Singh","sequence":"first","affiliation":[]},{"given":"Anurag Singh","family":"Baghel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,5,21]]},"reference":[{"key":"312_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas T (2006) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34: 209\u2013219","journal-title":"Omega"},{"key":"312_CR2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1142\/S0219622007002447","volume":"6","author":"EC Brown","year":"2007","unstructured":"Brown EC, Ragsdale CT, Carter AE (2007) A grouping genetic algorithm for the multiple traveling salesperson problem. Int J Inf Technol Dec Mak 6: 333\u2013347","journal-title":"Int J Inf Technol Dec Mak"},{"key":"312_CR3","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0305-0483(02)00059-2","volume":"30","author":"AE Carter","year":"2002","unstructured":"Carter AE, Ragsdale CT (2002) Scheduling pre-printed newspaper advertising inserts using genetic algorithms. Omega 30: 415\u2013421","journal-title":"Omega"},{"key":"312_CR4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.ejor.2005.04.027","volume":"175","author":"AE Carter","year":"2006","unstructured":"Carter AE, Ragsdale CT (2006) A new approach to solving the multiple traveling salesperson problem using genetic algorithms. Eur J Oper Res 175: 245\u2013257","journal-title":"Eur J Oper Res"},{"key":"312_CR5","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0377-2217(95)00077-1","volume":"93","author":"S Chatterjee","year":"1996","unstructured":"Chatterjee S, Carrera C, Lynch L (1996) Genetic algorithms and traveling salesperson problem. Eur J Oper Res 93: 490\u2013510","journal-title":"Eur J Oper Res"},{"key":"312_CR6","volume-title":"Handbook of genetic algorithms","author":"L Davis","year":"1991","unstructured":"Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold, New York"},{"key":"312_CR7","volume-title":"Genetic algorithms and grouping problems","author":"E Falkenauer","year":"1998","unstructured":"Falkenauer E (1998) Genetic algorithms and grouping problems. Wiley, Chicester"},{"key":"312_CR8","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, San Francisco"},{"key":"312_CR9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0377-2217(95)00185-9","volume":"93","author":"C Malmborg","year":"1996","unstructured":"Malmborg C (1996) A genetic algorithm for service level based vehicle scheduling. Eur J Oper Res 93: 121\u2013134","journal-title":"Eur J Oper Res"},{"key":"312_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0925-5273(00)00174-2","volume":"73","author":"YB Park","year":"2001","unstructured":"Park YB (2001) A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines. Int J Prod Econ 73: 175\u2013188","journal-title":"Int J Prod Econ"},{"key":"312_CR11","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1007\/s00291-006-0071-2","volume":"29","author":"A Singh","year":"2007","unstructured":"Singh A, Gupta AK (2007) Two heuristics for the one-dimensional bin-packing problem. OR Spectr 29: 765\u2013781","journal-title":"OR Spectr"},{"key":"312_CR12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0377-2217(99)00380-X","volume":"124","author":"L Tang","year":"2000","unstructured":"Tang L, Liu J, Rong A, Yang Z (2000) A multiple traveling salesman problem model for hot rolling schedule in Shanghai Baoshan Iron & Steel Complex. Eur J Oper Res 124: 267\u2013282","journal-title":"Eur J Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0312-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-008-0312-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0312-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:39:54Z","timestamp":1559079594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-008-0312-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,21]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["312"],"URL":"https:\/\/doi.org\/10.1007\/s00500-008-0312-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,21]]}}}