汽車客運行前旅次規劃邏輯之建構

A HEURISTIC SEARCH FOR TRANSIT ITINERARY PLANNING

汽車客運行前旅次規劃由於營運路線之限制，必須納入路線轉乘銜接特性，故與一般私人運具使用者偏重行駛路線選擇之規劃重點有所差異。本研究所構建之汽車客運行前旅次規劃邏輯，為快速提供使用者起迄點至站牌及轉乘站牌間步行地圖之導引，乃整合地理資訊系統強大之空間分析能力，將旅次規劃邏輯區分為地理資訊前處理及客運路線規劃兩部分，經利用簡例及新竹市市區公車系統進行測試，確認本研究所構建之行前旅次規劃邏輯具正確性，未來將可作為發展先進旅行者資訊系統之基礎。

Unlike private vehicles whose travel route choice planning is particularly emphasized, bus itinerary planning requires a search algorithm considering the constraints imposed by line routes and stops. The purpose of this paper is to develop a heuristic search algorithm which is composed of pre-process for GIS data and itinerary planning for bus routes to generate alternatives and map guides of walking links for bus travelers. A case study using the bus system in Hsinchu City was conducted to demonstrate the algorithm and its potential applications. The results indicate that the algorithm can find all feasible alternatives in less than 2 minutes and can therefore provide a basis for future development of ATIS (Advanced Traveler Information Systems).