Simple temporal problems in route scheduling for the dial---a---ride problem with transfers

Authors:
Renaud Masson;Fabien Lehuédé;Olivier Péton
Affiliations:
IRCCyN, Ecole des Mines de Nantes, Nantes, France;IRCCyN, Ecole des Mines de Nantes, Nantes, France;IRCCyN, Ecole des Mines de Nantes, Nantes, France
Venue:
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2012

Citing 10
Cited 0

Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Deciding Linear Inequalities by Computing Loop Residues

Journal of the ACM (JACM)
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A general heuristic for vehicle routing problems

Computers and Operations Research
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
Survey: Quality of service in dial-a-ride operations

Computers and Industrial Engineering
Variable neighborhood search for the dial-a-ride problem

Computers and Operations Research
Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming

Transportation Science
Large neighborhood search for dial-a-ride problems

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

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 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.