A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem
Published Online:4 May 2012https://doi.org/10.1287/ijoc.1120.0506
Supplemental Material
ijoc.1120.0506-sm-ec.pdf (144 KB)
Use this option if you have an account on informs.org or if you want to become an INFORMS member
Member LoginApril 12, 2013 - April 13, 2026
April 12, 2013 - April 13, 2026
Yuichi Nagata
[email protected]Department of Computational Intelligence and Systems Science, Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology, Yokohama, Kanagawa 226-8503, Japan
Shigenobu Kobayashi
[email protected]Department of Computational Intelligence and Systems Science, Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology, Yokohama, Kanagawa 226-8503, Japan
Yuichi Nagata
[email protected]Department of Computational Intelligence and Systems Science, Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology, Yokohama, Kanagawa 226-8503, Japan
Shigenobu Kobayashi
[email protected]Department of Computational Intelligence and Systems Science, Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology, Yokohama, Kanagawa 226-8503, Japan
ijoc.1120.0506-sm-ec.pdf (144 KB)

Copyright © 2013, INFORMS
