Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2011: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2010: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2009: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
Research Abstract |
The Traveling Salesman Problem is one of the most famous NP-hard problems. In this work, we studied polynomial time solvable cases for the problem and its extended problems ; the Vehicle Routing Problem and the Multi-Depot VRP. Especially, we focused on "crossings" for those cases. Also, we studied a problem to obtain a non-crossing Hamiltonian cycle by repeating "flip" operations and analogous problems.
|