{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T13:33:18Z","timestamp":1772803998151,"version":"3.50.1"},"reference-count":0,"publisher":"Instituto Politecnico Nacional\/Centro de Investigacion en Computacion","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CyS"],"DOI":"10.13053\/cys-22-2-2956","type":"journal-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T15:53:22Z","timestamp":1530633202000},"source":"Crossref","is-referenced-by-count":14,"title":["Genetic Algorithm for Solving Multiple Traveling Salesmen Problem using a New Crossover and Population Generation"],"prefix":"10.13053","volume":"22","author":[{"given":"Dharm Raj","family":"Singh","sequence":"first","affiliation":[]},{"given":"Manoj Kumar","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Tarkeshwar","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Rajkishore","family":"Prasad","sequence":"additional","affiliation":[]}],"member":"5402","published-online":{"date-parts":[[2018,7,1]]},"container-title":["Computaci\u00f3n y Sistemas"],"original-title":[],"deposited":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T15:53:29Z","timestamp":1530633209000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.cys.cic.ipn.mx\/ojs\/index.php\/CyS\/article\/view\/2764"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,1]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,7,1]]}},"URL":"https:\/\/doi.org\/10.13053\/cys-22-2-2956","relation":{},"ISSN":["2007-9737","1405-5546"],"issn-type":[{"value":"2007-9737","type":"electronic"},{"value":"1405-5546","type":"print"}],"subject":[],"published":{"date-parts":[[2018,7,1]]}}}