Abstract
The Dial---A---Ride Problem (DARP) consists in defining a set of routes that satisfy transportation requests between a set of pickup points and a set of delivery This paper addresses a variant of the DARP where requests can change of vehicle during their trip. This transshipment is made on specific locations called transfer points. The corresponding problem is called the Dial---A---Ride Problem with Transfers (DARPT). Solving the DARPT yields modeling and algorithmic difficulties. In this paper, we focus on efficiently checking the feasibility of routes with regards to the problem temporal constraints in a Large Neighborhood Search. This feasibility problem is a Simple Temporal Problem, well studied in particular in Artificial Intelligence [8]. We propose necessary and sufficient conditions to fasten the detection of unfeasible or feasible routes.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
