6
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms

      ,
      Expert Systems with Applications
      Elsevier BV

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references6

          • Record: found
          • Abstract: not found
          • Article: not found

          An effective implementation of the Lin–Kernighan traveling salesman heuristic

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Ant colonies for the travelling salesman problem

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              An evolutionary approach to the traveling salesman problem

                Bookmark

                Author and article information

                Journal
                Expert Systems with Applications
                Expert Systems with Applications
                Elsevier BV
                09574174
                March 2011
                March 2011
                : 38
                : 3
                : 1313-1320
                Article
                10.1016/j.eswa.2010.07.006
                33b887ad-7c88-4023-aa5a-6b48938b3045
                © 2011

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Comments

                Comment on this article