Time-Dependent Dial-a-Ride Problems: Formulation Development and Numerical Experiments

スポンサーリンク

概要

• 論文の詳細を見る

• In order to satisfy the transportation demand for elderly and disabled people, providing efficient dial-a-ride systems is an important issue. Appropriate vehicle routes for dial-a-ride systems can increase transportation efficiency and reduce the operation cost. Most literatures focus on improving the vehicle routing and scheduling and assume that the travel time is a constant value. However, the travel time can fluctuate dramatically due to traffic congestion or incident. Using the constant travel time to solve dial-a-ride problems (DARP) cannot obtain the efficient vehicle routes. To consider the variation of the travel time, this paper formulates a mixed integer programming formulation for the time-dependent DARP with time window. In the formulation, the travel time variations are treated as step functions. The simulation-assignment model, DynaTAIWAN is applied to generate time-dependent travel time matrices and simulate traffic flows in the real network. Numerical experiments are conducted in a Kaohsiung network.

著者

• HU Ta-Yin

  Department of Transportation and Communication Management Science National Chen Kung University

• CHANG Chin-Ping

  Department of Transportation and Communication Management Science National Chen Kung University

関連論文

• Time-Dependent Dial-a-Ride Problems: Formulation Development and Numerical Experiments
• DYNAMIC FLEET MANAGEMENT UNDER REAL-TIME INFORMATION
• IMPACT OF REAL-TIME INFORMATION ON DYNAMIC VEHICULAR FLOWS UNDER MIXED TRAFFIC CONDITIONS
• Exact Algorithm for Dial-A-Ride Problems with Time-Dependent Travel Cost
• CALIBRATION AND ESTIMATION OF DYNAMIC TRAFFIC ASSIGNMENT PROCEDURES

スポンサーリンク