Practical Route Planning for Multiple Destinations on the Smartphones

• Main Authors: Cheng Hung Lin, 林政宏
• Other Authors: Gene Eu Jan
• Format: Others
• Language: zh-TW
• Published: 2013
• Online Access: http://ndltd.ncl.edu.tw/handle/90916274078922104787

碩士 === 國立臺北大學 === 電機工程學系 === 101 === As the e-business becomes very popular in the world, the rise of the home- delivery commerce has changed the business model of transportation industry since the traditional transportation service can’t meet demand of modern life. The logistics planning on the smartphones is presented in this article based on the concept of Traveling Salesman Problem and our recent works regarding to the fastest practical and the most economical path-planning to balance the path length, traffic congestion, gradient, turns, green wave section, Stop signs, bands of roads, viaduct, fuel, road width, toll fee etc on the streets of metropolitan. Meanwhile, we implemented the route-planning algorithms of Traveling Salesman Problem with and without the constrains of rush hours and traffic jams on the smartphones under Android operating system with the time complexity of O(M2√("NlogC" )), where M is the number of destinations, N is the number of raster cells on the streets of metropolitan and C is the maximum weight of links.