A nested decomposition approach for solving the paratransit vehicle scheduling problem

作者：Karabuk Suleyman^*

来源：Transportation Research Part B: Methodological , 2009, 43(4): 448-465.

DOI：10.1016/j.trb.2008.08.002

• Paratransit
• Vehicle routing
• Dial-a-ride
• Column generation
• Mathematical decomposition
• Pickup and delivery problem with time windows

The paratransit vehicle scheduling problem involves scheduling a fleet of specially equipped vehicles for serving transportation needs of disabled and elderly people. It is also referred to as a dial-a-ride problem, and it can be classified as a multi-depot pickup and delivery problem with time windows and side constraints. The column generation approach constitutes one of the effective methodologies to solve this problem. However, in order to cope with the complexity of the problem, it is commonly applied in two consecutive stages: clustering and routing. First, clusters of customers are formed who will receive service together; next, vehicle routing decisions are made subject to the clustering decisions. This paper develops a nested column generation method, which integrates clustering and routing decisions, thus extending the applicability of the column generation approach in the context of the subject problem. The proposed method is implemented and applied to solve a problem faced by the transit authority of a mid size Us city. A detailed account of implementation experience is provided. The computational results, based on actual data, indicate that problem instances with up to 680 requests and 48 vehicles can be solved within 2% of optimality under mild assumptions, and a 12% performance improvement over a well-established manual planning system can be achieved. Published by Elsevier Ltd.

• 出版日期2009-5