H. K. Tsai, J. M. Yang, Y. F. Tsai, and C. Y. Kao, "An evolutionary algorithm for large traveling salesman problem," IEEE Trans. Syst. Man Cybern. 34, 1718-1729 (2004).

[CrossRef]

N. Mansour, H. Tabbara, and T. Dana, "A genetic algorithm approach for regrouping service sites," Comput. Oper. Res. 31, 1318-1333 (2004).

[CrossRef]

H. Tsai, "Heterogeneous selection genetic algorithms for traveling salesman problems," Eng. Optimiz. 35, 297-311 (2003).

[CrossRef]

S. Jung and B. R. Moon, "Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP," IEEE Trans. Evol. Comput. 6, 557-564 (2002).

[CrossRef]

J. M. Huntley, "Three-dimensional noise-immune phase unwrapping algorithm," Appl. Opt. 40, 3901-3908 (2001).

[CrossRef]

R. Baraglia, J. I. Hidalgo, and R. Perego, "A hybrid heuristic for the traveling salesman problem," IEEE Trans. Evol. Comput. 5, 613-622 (2001).

[CrossRef]

G. A. Jayalakshmi, S. Sathiamoorthy, and R. Rajaram, "A hybrid genetic algorithm--a new approach to solve traveling salesman problem," Int. J. Comput. Eng. Sci. 2, 339-355 (2001).

[CrossRef]

R. Cusack, J. M. Huntley, and H. T. Goldrein, "Improved noise-immune phase-unwrapping algorithm," Appl. Opt. 24, 781-789 (1995).

[CrossRef]

J. R. Buckland, J. M. Huntley, and J. M. Turner, "Unwrapping noisy phase maps by use of a minimum-cost-matching algorithm," Appl. Opt. 34, 5100-5108 (1995).

[CrossRef]
[PubMed]

R. Baraglia, J. I. Hidalgo, and R. Perego, "A hybrid heuristic for the traveling salesman problem," IEEE Trans. Evol. Comput. 5, 613-622 (2001).

[CrossRef]

R. Cusack, J. M. Huntley, and H. T. Goldrein, "Improved noise-immune phase-unwrapping algorithm," Appl. Opt. 24, 781-789 (1995).

[CrossRef]

N. Mansour, H. Tabbara, and T. Dana, "A genetic algorithm approach for regrouping service sites," Comput. Oper. Res. 31, 1318-1333 (2004).

[CrossRef]

D. C. Ghiglia and M. D. Pritt, Two-Dimensional Phase Unwrapping: Theory, Algorithms and Software (Wiley, 1998).

D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley, 1989).

R. Cusack, J. M. Huntley, and H. T. Goldrein, "Improved noise-immune phase-unwrapping algorithm," Appl. Opt. 24, 781-789 (1995).

[CrossRef]

R. Baraglia, J. I. Hidalgo, and R. Perego, "A hybrid heuristic for the traveling salesman problem," IEEE Trans. Evol. Comput. 5, 613-622 (2001).

[CrossRef]

J. M. Huntley, "Three-dimensional noise-immune phase unwrapping algorithm," Appl. Opt. 40, 3901-3908 (2001).

[CrossRef]

R. Cusack, J. M. Huntley, and H. T. Goldrein, "Improved noise-immune phase-unwrapping algorithm," Appl. Opt. 24, 781-789 (1995).

[CrossRef]

J. R. Buckland, J. M. Huntley, and J. M. Turner, "Unwrapping noisy phase maps by use of a minimum-cost-matching algorithm," Appl. Opt. 34, 5100-5108 (1995).

[CrossRef]
[PubMed]

G. A. Jayalakshmi, S. Sathiamoorthy, and R. Rajaram, "A hybrid genetic algorithm--a new approach to solve traveling salesman problem," Int. J. Comput. Eng. Sci. 2, 339-355 (2001).

[CrossRef]

S. Jung and B. R. Moon, "Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP," IEEE Trans. Evol. Comput. 6, 557-564 (2002).

[CrossRef]

H. K. Tsai, J. M. Yang, Y. F. Tsai, and C. Y. Kao, "An evolutionary algorithm for large traveling salesman problem," IEEE Trans. Syst. Man Cybern. 34, 1718-1729 (2004).

[CrossRef]

Y. Nagata and S. Kobayashi, "An analysis of edge assembly crossover for the traveling salesman problem," in Proceedings of IEEE International Conference on Systems, Man, and Cybernetics (IEEE, 1999), pp. 628-633.

N. Mansour, H. Tabbara, and T. Dana, "A genetic algorithm approach for regrouping service sites," Comput. Oper. Res. 31, 1318-1333 (2004).

[CrossRef]

S. Jung and B. R. Moon, "Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP," IEEE Trans. Evol. Comput. 6, 557-564 (2002).

[CrossRef]

Y. Nagata and S. Kobayashi, "An analysis of edge assembly crossover for the traveling salesman problem," in Proceedings of IEEE International Conference on Systems, Man, and Cybernetics (IEEE, 1999), pp. 628-633.

R. Baraglia, J. I. Hidalgo, and R. Perego, "A hybrid heuristic for the traveling salesman problem," IEEE Trans. Evol. Comput. 5, 613-622 (2001).

[CrossRef]

D. C. Ghiglia and M. D. Pritt, Two-Dimensional Phase Unwrapping: Theory, Algorithms and Software (Wiley, 1998).

G. A. Jayalakshmi, S. Sathiamoorthy, and R. Rajaram, "A hybrid genetic algorithm--a new approach to solve traveling salesman problem," Int. J. Comput. Eng. Sci. 2, 339-355 (2001).

[CrossRef]

G. A. Jayalakshmi, S. Sathiamoorthy, and R. Rajaram, "A hybrid genetic algorithm--a new approach to solve traveling salesman problem," Int. J. Comput. Eng. Sci. 2, 339-355 (2001).

[CrossRef]

W. H. Steeb, The Nonlinear Workbook (World Scientific, 2002).

N. Mansour, H. Tabbara, and T. Dana, "A genetic algorithm approach for regrouping service sites," Comput. Oper. Res. 31, 1318-1333 (2004).

[CrossRef]

H. Tsai, "Heterogeneous selection genetic algorithms for traveling salesman problems," Eng. Optimiz. 35, 297-311 (2003).

[CrossRef]

H. K. Tsai, J. M. Yang, Y. F. Tsai, and C. Y. Kao, "An evolutionary algorithm for large traveling salesman problem," IEEE Trans. Syst. Man Cybern. 34, 1718-1729 (2004).

[CrossRef]

H. K. Tsai, J. M. Yang, Y. F. Tsai, and C. Y. Kao, "An evolutionary algorithm for large traveling salesman problem," IEEE Trans. Syst. Man Cybern. 34, 1718-1729 (2004).

[CrossRef]

H. K. Tsai, J. M. Yang, Y. F. Tsai, and C. Y. Kao, "An evolutionary algorithm for large traveling salesman problem," IEEE Trans. Syst. Man Cybern. 34, 1718-1729 (2004).

[CrossRef]

J. M. Huntley, "Three-dimensional noise-immune phase unwrapping algorithm," Appl. Opt. 40, 3901-3908 (2001).

[CrossRef]

R. Cusack, J. M. Huntley, and H. T. Goldrein, "Improved noise-immune phase-unwrapping algorithm," Appl. Opt. 24, 781-789 (1995).

[CrossRef]

J. R. Buckland, J. M. Huntley, and J. M. Turner, "Unwrapping noisy phase maps by use of a minimum-cost-matching algorithm," Appl. Opt. 34, 5100-5108 (1995).

[CrossRef]
[PubMed]

B. Gutmann, "Phase unwrapping with the branch-cut method: clustering of discontinuity sources and reverse simulated annealing," Appl. Opt. 38, 5577-5793 (1999).

[CrossRef]

N. Mansour, H. Tabbara, and T. Dana, "A genetic algorithm approach for regrouping service sites," Comput. Oper. Res. 31, 1318-1333 (2004).

[CrossRef]

H. Tsai, "Heterogeneous selection genetic algorithms for traveling salesman problems," Eng. Optimiz. 35, 297-311 (2003).

[CrossRef]

R. Baraglia, J. I. Hidalgo, and R. Perego, "A hybrid heuristic for the traveling salesman problem," IEEE Trans. Evol. Comput. 5, 613-622 (2001).

[CrossRef]

S. Jung and B. R. Moon, "Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP," IEEE Trans. Evol. Comput. 6, 557-564 (2002).

[CrossRef]

H. K. Tsai, J. M. Yang, Y. F. Tsai, and C. Y. Kao, "An evolutionary algorithm for large traveling salesman problem," IEEE Trans. Syst. Man Cybern. 34, 1718-1729 (2004).

[CrossRef]

G. A. Jayalakshmi, S. Sathiamoorthy, and R. Rajaram, "A hybrid genetic algorithm--a new approach to solve traveling salesman problem," Int. J. Comput. Eng. Sci. 2, 339-355 (2001).

[CrossRef]

Y. Nagata and S. Kobayashi, "An analysis of edge assembly crossover for the traveling salesman problem," in Proceedings of IEEE International Conference on Systems, Man, and Cybernetics (IEEE, 1999), pp. 628-633.

D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley, 1989).

W. H. Steeb, The Nonlinear Workbook (World Scientific, 2002).

D. C. Ghiglia and M. D. Pritt, Two-Dimensional Phase Unwrapping: Theory, Algorithms and Software (Wiley, 1998).