A Tour Planning System Based on Solving the Traveling Salesman Problem Using the Taiwan Map
碩士 === 淡江大學 === 資訊管理學系碩士班 === 95 === A tour planning system based on solving the traveling salesman problem is proposed. Given the per-day traveling times, categories of interest, and the range of scenic spots, the system can recommend a suitable tour plan for the user. The research divides into 3 p...
Main Authors: | Yu-Cheng Chen, 陳囿成 |
---|---|
Other Authors: | Shih-Chieh Wei |
Format: | Others |
Language: | zh-TW |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/81204406195555349889 |
Similar Items
-
Compatible tours for the asymmetric traveling salesman problem
by: Patil, Geetha
Published: (2013) -
A Tour Construction Framework for the Travelling Salesman Problem
by: Ahrens, Barry
Published: (2012) -
Solving open travelling salesman subset-tour problem through a hybrid genetic algorithm
by: Singamsetty, Purusotham, et al.
Published: (2021-01-01) -
Estimating the Tour Length for the Close Enough Traveling Salesman Problem
by: Debdatta Sinha Roy, et al.
Published: (2021-04-01) -
Optimizing the Logistic Route Planning by Solving the Traveling Salesman Problem using Particle Swarm Algorithm
by: Cheng-Chieh Chen, et al.
Published: (2012)