{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T00:40:25Z","timestamp":1739752825914,"version":"3.37.1"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1109\/nabic.2009.5393321","type":"proceedings-article","created":{"date-parts":[[2010,1,26]],"date-time":"2010-01-26T17:36:43Z","timestamp":1264527403000},"page":"356-361","source":"Crossref","is-referenced-by-count":4,"title":["A perspective view on Travelling Salesman Problem using genetic algorithm"],"prefix":"10.1109","author":[{"given":"Ramani. R","family":"Geetha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Nishaa Bouvanasilan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Vasumathy Seenuvasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Solving the Traveling Salesman Problem with a parallel branch-and-bound algorithm on a 1024 processor network","year":"1994","author":"tsch\u00f6ke","key":"ref30"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1996.542671"},{"journal-title":"Implementation analysis of efficient heuristic algorithms for the traveling salesman problem","year":"2005","author":"gamboa","key":"ref11"},{"key":"ref12","first-page":"160","article-title":"Genetic algorithms for the travelling salesman problem","author":"greffenstette","year":"1985","journal-title":"Proceedings of the First International Conference on Genetic Algorithms and Their Applications"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010045"},{"journal-title":"Survey of Genetic Algorithms and Genetic Programming","year":"2009","author":"koza","key":"ref14"},{"journal-title":"A genetic algorithm for the traveling salesman problem","year":"2000","author":"bryant","key":"ref15"},{"journal-title":"Solving Precedence Constraint Traveling Salesman Problem using Genetic Algorithm","year":"2003","author":"kotecha","key":"ref16"},{"journal-title":"Dynamic programming approach for the generalized travelling salesman problem","year":"2000","author":"olfa","key":"ref17"},{"key":"ref18","article-title":"Enhanced Travelling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA)","volume":"38","author":"al-dulaimi","year":"2008","journal-title":"World Academy of Science Engineering and Technology"},{"journal-title":"Traveling Salesman Problem Using Genetic Algorithms","year":"2003","author":"lalena","key":"ref19"},{"year":"0","key":"ref28"},{"journal-title":"Genetic Algorithms in Search Optimization and Machine Learning","year":"0","author":"goldberg","key":"ref4"},{"key":"ref27","article-title":"Solving the Travelling Salesman Problem in Parallel by Genetic Algorithm on Multicomputer Cluster","volume":"2 11","author":"borovska","year":"2006","journal-title":"International Conference on Computer Systems and Technologies - CompSysTech'06"},{"key":"ref3","article-title":"Genetic Algorithm in Search, Optimization and Machine Learning","author":"goldberg","year":"1989","journal-title":"Machine Learning"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S1007-0214(07)70068-8"},{"year":"0","key":"ref29"},{"key":"ref5","article-title":"The Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination","author":"whitley","year":"1991","journal-title":"Handbook of Genetic Algorithms"},{"journal-title":"The Travelling Salesman Problem A Guided Tour of Combinatorial Optimization","year":"1985","author":"lawler","key":"ref8"},{"key":"ref7","article-title":"Solving Precedence Constraint Traveling Salesman Problem using Genetic Algorithm","author":"kotecha","year":"2003","journal-title":"Proceedings of National Conference on Software Agents and Embedded System"},{"journal-title":"Exploration of Genetic Parameters and Operators through Travelling Salesman Problem","year":"2006","author":"pongcharoen","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/01969729308961697"},{"key":"ref1","article-title":"Crossover operator in dna simulation of genetic algorithms","author":"moreno","year":"2007","journal-title":"International Conference «Information Research & Applications» - i Tech"},{"journal-title":"An Introduction to Genetic Algorithms","year":"1996","author":"melanie","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1997.592288"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","author":"mitchell","year":"1996","journal-title":"Introduction to Genetic Algorithms"},{"journal-title":"An Improved Genetic Algorithm to Solve the Travelling Salesman Problem","year":"2009","author":"sallabi","key":"ref24"},{"journal-title":"Traveling Salesman Problem Using Genetic Algorithms","year":"2003","author":"gambhava","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006529012972"},{"key":"ref25","article-title":"Improved selection operator for GA","author":"jadaan","year":"2005","journal-title":"Journal of Theoretical and Applied Information Technology"}],"event":{"name":"2009 World Congress on Nature & Biologically Inspired Computing (NaBIC)","start":{"date-parts":[[2009,12,9]]},"location":"Coimbatore, India","end":{"date-parts":[[2009,12,11]]}},"container-title":["2009 World Congress on Nature & Biologically Inspired Computing (NaBIC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5377996\/5393306\/05393321.pdf?arnumber=5393321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T00:14:38Z","timestamp":1739751278000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5393321\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/nabic.2009.5393321","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}