| Summary: | 碩士 === 中原大學 === 工業與系統工程研究所 === 102 === Social services in Taiwan already become an integral part of a complete society, especially service of disablement. With the promulgation of the bill and noticing about importance of equal rights of life, in the aspect of transporting disabled persons, Dial-a-Ride service is the best way to satisfy a long-distance request for disabilities and let them to reach the destination from door to door.
Fu-kang Bus are classified to Dial-a-Ride Problem(DARP), in the definition of the problem, more than one vehicles from a certain station to pick a group of passengers, each demand has a time window constrain. DARP is similar to the Vehicle Routing Problem with Time Windows, all of the services need to be hell within the time window. Through this study, we want to understand the characteristics of the DARP, and then propose a vehicle routing heuristic algorithm. Using this algorithm to analyse three parameters concluding service time, speed of vehicle and time window period under uncertainty condition. And then we discuss the effect of solution results. The results showed that the total waiting time of vehicles showing a upward trend when service time is increasing, showing a downward trend when the vehicle speed is increasing, showing a downward trend when the time window length increments; on the other part, the total traveling time of vehicles have no significant change while increasing the service time and length of time windows, however, when the vehicle speed is increasing it showing a downward trend; Finally, when the service time in increments , the number of vehicles using have no significant change, when the vehicle speed is increasing, it showing a downward trend, when the time window length increments it showing dropped.
|
|---|
