Genetic Algorithms for the Traveling Salesman Problem
- Journal
- international conference on Genetic algorithms
In The Last Decade
doi.org/w15118124 →Countries where authors are citing Genetic Algorithms for the Traveling Salesman Problem
This map shows the geographic impact of Genetic Algorithms for the Traveling Salesman Problem. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Genetic Algorithms for the Traveling Salesman Problem with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Genetic Algorithms for the Traveling Salesman Problem more than expected).
Fields of papers citing Genetic Algorithms for the Traveling Salesman Problem
This network shows the impact of Genetic Algorithms for the Traveling Salesman Problem. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the Genetic Algorithms for the Traveling Salesman Problem.
About Genetic Algorithms for the Traveling Salesman Problem
This paper, published in 1985, received 533 indexed citations . Written by John J. Grefenstette, Brian J. Rosmaita and Dirk Van Gucht covering the research area of Artificial Intelligence. It is primarily cited by scholars working on Artificial Intelligence (305 citations), Industrial and Manufacturing Engineering (246 citations) and Computational Theory and Mathematics (125 citations). Published in international conference on Genetic algorithms.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.
This paper is also available at doi.org/w15118124.