An exact method for the multi-vehicle static demand responsive transport problem based on service quality: The case of one-to-one

Abstract

Over the last years, various extensions of Vehicle Routing Problem, Considering the pick -up and delivery vehicle routing problem have been studied. In this work we tackle the pickup and delivery of passengers namely Demand Responsive Transport. Its idea is to group a number of passengers in the same vehicle with the respecting of the capacity of each vehicle in order to reduce operational cost with the maintaining of high quality service. This paper presents an exact Method which is the Branch and Bound Algorithm to solve a new variant of Demand Responsive Transport which is based on service quality but not as an option it is an obligation. The Multi-Vehicle Demand Responsive Transport Problem Based on Service Quality in the case of Oneto-One(MVSDRTPBSQ1-t-1) under study presented the following characteristics: Users specify transportation requests between origins and destinations, each customer have his own origin and own destination, they may provide a time window on their desired departure or arrival time. All demands are knows before the pacification of vehicles tours and the transportation is supplied by a fleet of vehicle based at a common depot. The aim of this paper is to find the best routing scheduled of all receipt requests with the respecting of hard Time Windows of each customer, its mean that the most important is the service quality of each customer. The novelty of our paper is presented in the new manner of algorithm application. However, we will trying to take the general architecture of Branch & Bound algorithm and using valuation rules in a different way which can adapted for such problem to find an optimal solution.