Multi-population parallel genetic algorithm using a new genetic representation for the euclidean traveling salesman problem

Proceedings of the 35th International Conference on Computers and Industrial Engineering, ICC and IE 2005

Volumn , Issue , 2005, Pages 1047-1052

  Kapanoglu, Muzaffer ^a   Koç, Ilker Ozan ^a   Kara, Imdat ^b   Selim Akturk M ^c  

^a ESKISEHIR OSMANGAZI UNIVERSITY   (Turkey)

^b BASKENT UNIVERSITY   (Turkey)

^c BILKENT UNIVERSITY   (Turkey)

Author keywords

Kth nearest neighbor representation; Multi population genetic algorithm; Traveling salesman problem

Indexed keywords

BUILDING BLOCKES; GENETIC REPRESENTATIONS; MULTI POPULATION; MULTI-POPULATION GENETIC ALGORITHM; NEAR-OPTIMAL SOLUTIONS; NEAREST NEIGHBORS; PARALLEL GENETIC ALGORITHMS; SOLUTION QUALITY;

COMMUNICATION; GENETIC ALGORITHMS; INDUSTRIAL ENGINEERING; OPTIMAL SYSTEMS; REPAIR;

TRAVELING SALESMAN PROBLEM;

EID: 33750072072     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Aoyama, E., Hirogaki, T., Katayama, T., & Hashimoto, N. (2004). Optimizing drilling conditions in printed circuit board by considering hole quality: Optimization from viewpoint of drill-movement time. Journal of Materials Processing Technology, 155-156, 1544-1550.
2. Bean, J.C. (1994). Genetic algorithms and random keys for sequencing and optimization, ORSA Journal on Computing, 6, 154-160.
3. Dantzig, G., Fulkerson, R., & Johnson, S. (1954). Solution of a Large-Scale Traveling-Salesman Problem. Operations Research, 2, 393-410.
4. Fagerholt, K., & Christiansen, M. (2000). A traveling salesman problem with allocation, time window and precedence constraints - An application to ship scheduling. International Transactions in Operational Research, 7, 231-244.
5. Fox, M.S., & McMahon, M.B. (1987). In: G. Rawlings, Foundations of Genetic Algorithms: First Workshop on the Foundations of Genetic Algorithms and Classifier Systems (pp. 284-300), Morgan Kaufmann Publishers, Los Altos.
6. Goldberg, D.E., & Lingle, R. (1985). In: J.J. Grefenstette, Proceedings of the First International Conference on Genetic Algorithms and Their Applications (pp. 154-159), Lawrence Erlbaum Associates.
7. Grefenstette, J.J., Gopal, R., Rosmaita, B., & Van Gucht, D. (1985). In: J.J. Grefenstette, Proceedings of the First International Conference on Genetic Algorithms and Their Applications (pp. 160-165), Lawrence Erlbaum Associates.
8. Julstrom, B.A. (1999). In: Proceedings of the 1999 ACM Symposium on Applied Computing (pp. 297 - 301), San Antonio, Texas.
9. Koc, I.O., and Kapanoglu, M. (2005). A benchmark problem: Turkey81. Technical Report: KOC05D001E, available from http://enformatik.ogu.edu.tr/or/ tsp/KOC05D001E.html.
10. Moon, C., Kim, J., & Hur, S. (2002). Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain. Computers and Industrial Engineering, 43, 331-349.
11. Ozcan, E., & Erenturk, M. (2004). In: Proc. of the 13th Turkish Symposium on Artificial Intelligence and Neural Networks (pp. 99-108).
12. Petiot, J.F., Chedmail, P., & Hascoet, J.Y. (1997). Contribution to the scheduling of trajectories in robotics. Robotics and Computer-Integrated Manufacturing, 14, 237-251.
13. Reinelt, G. (1994). The Traveling Salesman: Computational Solutions for TSP Applications. Springer Verlag, Berlin.
14. Soylu, M., Ozdemirel, N.E., & Kayaligil, S. (2000). A self-organizing neural network approach for the single AGV routing problem. European Journal of Operational Research, 121, 124-137.
15. Tang, L., Liu, J., Rong, A., & Yang, Z. (2000). A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex. European Journal of Operational Research, 124, 267-282.
16. th 2005 from http://www.iwr.uni- heidelberg.de/groups/comopt/software/TSPLIB95/.
17. Zacharia, P.Th., & Aspragathos, N.A. (2005). Optimal robot task scheduling based on genetic algorithms. Robotics and Computer-Integrated Manufacturing, 21, 67-79.