Proposal of an Effective Computation Environment for the Traveling Salesman Problem Using Cloud Computing

スポンサーリンク

概要

• 論文の詳細を見る

• Various methods have been proposed to solve the traveling salesman problem, referred to as the TSP. In order to solve the TSP, the cost metric (e.g., the travel time and distance) between nodes is needed. As we do not always have specific criterion for the cost metric we are proposing using a new computation environment that is used all over the world—Google Maps. We think a cost metric obtained from Google maps is a good, impartial value with little room for variation, making it easier and more efficient to make map information visible. Moreover, a scalable computation environment can be prepared by using cloud computing technology. We can even expand the TSP and calculate routes taken by multiple people. The numerical results show this computation environment to be effective.

著者

• Yamaki Naokazu

  Shizuoka University

• MIZUNO Shinya

  Shizuoka Professional Training College of Industrial Technology

• IWAMOTO Shogo

  Rexius Corporation

関連論文

• 8B2 PROPOSED METHOD FOR RECOMMENDING GOODS USING A MATHEMATICAL PLANNING MODEL(Technical session 8B: Customer orientation)
• A logical interpretation for the eigenvalue method in AHP : Why is a weight vector in AHP calculated by the eigenvalue method?
• A BOUNDED DETERIORATION PROPERTY OF A SYMMETRIC POSITIVE DEFINITE CLASS OF NEWTON-LIKE METHODS AND ITS APPLICATION
• A LOGICAL INTERPRETATION FOR THE EIGENVALUE METHOD IN AHP
• Proposal of an Effective Computation Environment for the Traveling Salesman Problem Using Cloud Computing
• 5C2 Proposal of effective computation environment for TSP using Cloud Computing(Technical session 5C: OS3: Service engineering(2))

スポンサーリンク