Simple Temporal Problems in Route Scheduling for the Dial-a-Ride Problem with Transfers
نویسندگان
چکیده
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 points. 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 di culties. In this paper, we focus on e ciently 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 su cient conditions to fasten the detection of unfeasible or feasible routes.
منابع مشابه
Transfers in the on-demand transportation: the DARPT Dial-a-Ride Problem with transfers allowed
Today, the on-demand transportation is used for elderly and disabled people for short distances. Each user provides a specific demand: a particular ride from an origin to a destination with hard time constraints like time windows, maximum user ride time, maximum route duration limits and precedence. This paper deals with the resolution of these problems (Dial-a-Ride Problems – DARP), including ...
متن کاملOnline multi-server dial-a-ride problems
In an online dial-a-ride problem, a crew of servers has to process transportation requests as they arrive in real time. Possible objective functions include minimizing the makespan and minimizing the sum of completion times. We give competitive algorithms and negative results for several online dial-a-ride problems with multiple servers. Surprisingly, in some cases the competitive ratio is dram...
متن کاملEfficient feasibility testing for dial-a-ride problems
Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specific location and delivered to a specific destination. Dial-a-ride problems differ from other routing and scheduling problems in that they typically involve service related constraints. It is common to have maximum wait ...
متن کاملHybrid scheduling methods for paratransit operations
We study an extension to the general routing problem, which deals with integrating fixed route service with the general pickup and delivery problem to create a hybrid routing problem. The primary application for such a service is a dial-a-ride system used by transit agencies to transport disabled or elderly individuals. The main aim of the integration is to reduce the vehicle miles of the on-de...
متن کاملVariable neighborhood search for the dial-a-ride problem
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant considered in this paper aims at minimizing total routing costs while respecting maximum route duration limits, time windows, and maximum user ride time limits. We propose a competitive variable neighborhood search-based heuri...
متن کامل