{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T12:35:58Z","timestamp":1723034158562},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Expert Systems with Applications"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1016\/j.eswa.2010.07.006","type":"journal-article","created":{"date-parts":[[2010,7,24]],"date-time":"2010-07-24T11:08:29Z","timestamp":1279969709000},"page":"1313-1320","source":"Crossref","is-referenced-by-count":139,"title":["Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms"],"prefix":"10.1016","volume":"38","author":[{"given":"Murat","family":"Albayrak","sequence":"first","affiliation":[]},{"given":"Novruz","family":"Allahverdi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.eswa.2010.07.006_bib1","unstructured":"Albayrak Murat (2008). Determination of route by means of Genetic Algorithms for printed circuit board driller machines. Master dissertation (p. 180). Selcuk University."},{"key":"10.1016\/j.eswa.2010.07.006_bib2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00203625","article-title":"The \u2018molecular\u2019 traveling salesman","volume":"64","author":"Banzhaf","year":"1990","journal-title":"Biological Cybernetics"},{"key":"10.1016\/j.eswa.2010.07.006_bib3","unstructured":"Davis, L. (1985). Applying adaptive algorithms to epispastics domains. In Proceedings of the int. joint conf. on artificial intelligence (IJCAI\u201985) (pp. 162\u2013164). Los Angeles, CA."},{"key":"10.1016\/j.eswa.2010.07.006_bib4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","article-title":"Ant colonies for the traveling salesman problem","volume":"43","author":"Dorigo","year":"1997","journal-title":"BioSystems"},{"key":"10.1016\/j.eswa.2010.07.006_bib5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00202901","article-title":"An evolutionary approach to the traveling salesman problems","volume":"60","author":"Fogel","year":"1988","journal-title":"Biological Cybernetics"},{"key":"10.1016\/j.eswa.2010.07.006_bib6","unstructured":"Fogel, D. B. (1993a). Empirical estimation of the computation required to discover approximate solutions to the traveling salesman problem using evolutionary programming. In Proceedings of 2nd annual conference on evolutionary programming (pp. 56\u201361)."},{"key":"10.1016\/j.eswa.2010.07.006_bib7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/01969729308961697","article-title":"Applying evolutionary programming to selected traveling salesman problems","volume":"24","author":"Fogel","year":"1993","journal-title":"Cybernetics and Systems: An International Journal"},{"key":"10.1016\/j.eswa.2010.07.006_bib8","series-title":"Proceedings of the IEEE international conference on evolutionary computation","first-page":"616","article-title":"A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems","author":"Freisleben","year":"1996"},{"key":"10.1016\/j.eswa.2010.07.006_bib9","unstructured":"Genetic Algorithms (2009). Wikipedia. http:\/\/en.wikipedia.org\/wiki\/Genetic_Algorithms; last access."},{"key":"10.1016\/j.eswa.2010.07.006_bib10","series-title":"Proceedings of the first int. conf. on genetic algorithms (ICGA\u201985)","first-page":"154","article-title":"Alleles, loci and the traveling salesman problem","author":"Goldberg","year":"1985"},{"key":"10.1016\/j.eswa.2010.07.006_bib11","unstructured":"Grefenstette, J., Gopal, R., Rosmaita, B., Gucht, D. V. (1985). Genetic Algorithms for the TSP. In Proceedings of the first international conference on genetic algorithms and their applications (pp. 160\u201365)."},{"issue":"1","key":"10.1016\/j.eswa.2010.07.006_bib12","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","article-title":"An effective implementation of the Lin-Kernighan traveling salesman heuristic","volume":"126","author":"Helsgaun","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2010.07.006_bib13","series-title":"Adaptation in natural and artificial systems","author":"Holland","year":"1975"},{"issue":"2","key":"10.1016\/j.eswa.2010.07.006_bib14","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1142\/S1465876301000350","article-title":"A hybrid genetic algorithm \u2013 a new approach to solve traveling salesman problem","volume":"2","author":"Jayalakshmi","year":"2001","journal-title":"International Journal of Computational Engineering Science"},{"key":"10.1016\/j.eswa.2010.07.006_bib15","unstructured":"Louis, S. J., Tang, R. (1999). Interactive genetic algorithms for the traveling salesman problem. In Proceedings of the 1999 genetic and evolutionary computing conference (GECCO 1999) (pp. 385\u2013392)."},{"key":"10.1016\/j.eswa.2010.07.006_bib1a","series-title":"Genetic algorithms + data structures = evolution programs","author":"Michalewicz","year":"1992"},{"issue":"32","key":"10.1016\/j.eswa.2010.07.006_bib16","first-page":"29","article-title":"Using iterated tabu search for the traveling salesman problem","volume":"3","author":"Misevicius","year":"2004","journal-title":"Information Technology and Control"},{"key":"10.1016\/j.eswa.2010.07.006_bib17","series-title":"Proceedings of the second int. conf. on genetic algorithms (ICGA\u201987)","first-page":"224","article-title":"A study of permutation crossover operators on the traveling salesman problem","author":"Oliver","year":"1987"},{"key":"10.1016\/j.eswa.2010.07.006_bib18","series-title":"Proceedings of the 1997 IEEE international conference on evolutionary computation","first-page":"171","article-title":"Asparagos96 and the traveling salesman problem","author":"Schleuter","year":"1997"},{"key":"10.1016\/j.eswa.2010.07.006_bib19","unstructured":"Seo, D., Moon, B. (2002). Voronoi quantized crossover for traveling salesman problem. In Proceedings of the genetic and evolutionary computation conference (pp. 544\u2013552)."},{"key":"10.1016\/j.eswa.2010.07.006_bib20","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., Hoos, H. (1997). The MAX\u2013MIN ant system and local search for the traveling salesman problem. In Proceedings of the IEEE international conference on evolutionary computation (pp. 308\u2013313). Indianapolis, Indiana, USA.","DOI":"10.1109\/ICEC.1997.592327"},{"key":"10.1016\/j.eswa.2010.07.006_bib21","series-title":"Handbook of genetic algorithms","first-page":"332","article-title":"Schedule optimization using genetic algorithms","author":"Syswerda","year":"1991"},{"key":"10.1016\/j.eswa.2010.07.006_bib22","unstructured":"TSPLIB (2009). http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/; last access: April 2009."}],"container-title":["Expert Systems with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417410006238?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417410006238?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T15:06:47Z","timestamp":1559315207000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417410006238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["S0957417410006238"],"URL":"https:\/\/doi.org\/10.1016\/j.eswa.2010.07.006","relation":{},"ISSN":["0957-4174"],"issn-type":[{"value":"0957-4174","type":"print"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1016%2FJ.ESWA.2010.07.006', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid123' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:123', '*');; return false;" style='text-decoration: none; '>INTERN </a> <a style='color: white;' href='#diffid123'><sup>6</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>