Advertisement
Published in:
2012 | OriginalPaper | Chapter
Simple Temporal Problems in Route Scheduling for the Dial–a–Ride Problem with Transfers
Authors : Renaud Masson, Fabien Lehuédé, Olivier Péton
Published in: Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 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.