碩士 / 國立成功大學 / 交通管理學系碩博士班 / 93 / Recently, more attention is being focused on the disabilities and elders to their transportation demand. This makes the dial-a-ride system which is provided with high accessibility and mobility an important issue in Taiwan.
The Dial-a-Ride Problem (DARP) consists of designing vehicle routes for many users who specify diversified pick-up and drop-off requests between various origins and destinations. The aim is to plan a set of minimum cost vehicle routes capable of accommodating as many users as possible, under a set of practical constraints. One purpose of this article is to find the main features of the problem associated with Fu-kang Bus’s specific routing concerns.
One drawback of the Taipei Fu-kang Bus is the route planners sequenced the stops on the routes themselves. When they had enough experience, this method worked fairly well, but it took more time and didn’t ride-sharing matching immediately. Another purpose of this article is to improve the operational inefficiencies when the customers are online.
The heuristic algorithm designed for the realistic problem could reduce operating costs, and save more manpower by organizing routes to minimize the number of direct trips and thereby reduce the number of vehicles.
| Identifer | oai:union.ndltd.org:TW/093NCKU5119022 |
| Date | January 2005 |
| Creators | Meng-Hsin Hsin, 辛孟鑫 |
| Contributors | Chien-Hung Wei, 魏健宏 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 74 |
Page generated in 0.0189 seconds