英文摘要 |
Recently, more attention has been paid on the disabled and the elderly for their transportation demands. This makes the dial-a-ride system, 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 of DARP is to plan a set of minimum-cost vehicle routes capable of accommodating as many users as possible, under a set of practical constraints. The purpose of this paper is to examine the main features of the specific routing concerns associated with Fu-kang Bus and to develop an efficient solution procedure. One drawback of the existing Fu-kang Bus operation is the manual arrangement of vehicle routes and services. When operators had enough experience, this method worked fairly well. But it took more time and didn’t match ride-sharing needs on-line. The heuristic algorithm designed for the realistic DARP problem could reduce operating costs and save more manpower by organizing routes to minimize the number of direct trips, thereby reduce the number of vehicles required. |