Proposal of an effective computation environment for the traveling salesman problem using cloud computing

Journal of Advanced Mechanical Design, Systems and Manufacturing

Volumn 6, Issue 5, 2012, Pages 703-714

  Mizuno, Shinya ^a   Iwamoto, Shogo ^b   Yamaki, Naokazu ^c  

^a Shizuoka Professional Training College of Industrial Technology   (Japan)

^b Rexius Corporation   (Japan)

^c SHIZUOKA UNIVERSITY   (Japan)

Author keywords

Cloud computing; GA; MTSP; Optimization; TSP

Indexed keywords

COMPUTING TECHNOLOGY; COST METRICS; GOOGLE MAPS; MTSP; MULTIPLE PEOPLE; NUMERICAL RESULTS; TSP;

CLOUD COMPUTING; COSTS; GALLIUM; OPTIMIZATION; PRODUCTION ENGINEERING; WEBSITES;

TRAVELING SALESMAN PROBLEM;

EID: 84865224397     PISSN: None     EISSN: 18813054     Source Type: Journal    
DOI: 10.1299/jamdsm.6.703     Document Type: Conference Paper

References (20)

1. Y.Inoue, T.Sekine, T.Hasegawa, H.Asai: Fast Circuit Simulation Based on Parallel-Distributed LIM using Cloud Computing System, Journal of semiconductor technology and science, Vol.10, NO.1, MARCH, (2010) pp.49-54.
2. C.Bazgan, R.Hassin and J.Monnot: Approximation algorithms for some vehicle routing problems, Discrete Applied Mathematics, 146, (2005) pp.27-42. (Pubitemid 40142464)
3. H.Hiyane, M.Matayoshi: Search for solution of TSP in GA that builds in improvement 2- opt method, SangyoSougouKenkyuusya, Vol.12, (2004) Mar. pp.125-133.
4. Gilbert Laporte: The Traveling Salesman Problem:An overview of exact and approximate algorithms, European Journal of Operational Research, 59, (1992) pp.231-247.
5. T.Nakamura, H.Tanaka: Mounting on parallel computer of division of labor travelling salesman problem, Information Processing Society of Japan, (1994) pp.277-278.
6. R.Nallusamy, K.Duraiswamy, R.Dhanalaksmi and P.Parthiban: Optimization of Non-Linear Multiple Traveling Salesman Problem Using K-Means Clustering, Shrink Wrap Algorithm and Meta-Heuristics, International Journal of Nonlinear Science, 9, pp.171-177.
7. RV. Kulkarni, PR. Bhave: Integer programming formulations of vehicle routing problems. European Journal of Operational Research, 20, (1985) pp.58-67. (Pubitemid 15480455)
8. B. Gavish, K. Srikanth: An optimal solution method for large-scale multiple traveling salesman problems. Operations Research 1986;34(5), (1986) pp.698-717. (Pubitemid 17590502)
9. T. Zhang, WA. Gruver, MH. Smith: Team scheduling by genetic search. Proceedings of the second international conference on intelligent processing and manufacturing of materials, vol. 2, (1999) pp. 839-844.
10. DB. Fogel: A parallel processing approach to a multiple traveling salesman problem using evolutionary programming. In: Proceedings of the fourth annual symposium on parallel processing. Fullerton, CA, (1990) pp. 318-326.
11. H.Watanabe, T.Ono, A.Matsunaga, A.Kanagawa and H.Takahashi: Multiple Traveling Salesman Problems Using the Fuzzy c-means Clustering, Japanese fuzzy journal, 13(1), pp.119-126. (in Japanese)
12. P.M. Franca, M. Gendreau, G. Laporte, and F.M.Miiller: The m-traveling salesman problem with minmax objective, Transportation Science 29(3), (1995) pp.267-275.
13. B.L. GOLDEN, G. Laporte, and E.D. Taillard: An adaptive memory heuristic for class of vehicle routing with minmax objective, Computers and Operations Research 24, (1997) pp.445-452.
14. J. Renaud, G.. Laporte, and F.F. Boctor: A tabu search heuristic for the multi-depot vehicle routing problem, Computers & Ops. Res., 23-3, (1996
15. Erick Cantú-Paz: A Survey of Parallel Genetic Algorithms, Calculateurs Paralleles 10(2)
16. T.Bektas: The multiple traveling salesman problem: An overview of formulations and solution procedures, Omega, 34, (2006) pp.209-219. (Pubitemid 41600559)
17. Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim: Approximation Algorithms for Some Routing Problems, SIAM J. Comput., (1978), pp.178-193.
18. N.Nakaya, T.Yoshida, M.Miura: Inherited approach to dynamic problem salesman problem, The 187th time of measurement automatic control society northeast branch research meeting, (2000), Material number 187-2.
19. M.Shiozaki, K.Ogino, S.Mizuno, S.Iwamoto: Making of TSP that uses Google maps and visible operation on Cloud, Japan Industrial Management Association research meeting in spring, (2010), pp.48-49. (in Japanese)
20. T.Ueda, K.Okamoto: Research of community bus best route that considers population, Meeting for reading research papers in Japanese operations research society spring of 2005, (2005), pp.10-11. (in Japanese)