Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming

Authors:
Gerardo Berbeglia;Gilles Pesant;Louis-Martin Rousseau
Affiliations:
HEC Montréal, Montréal H3T 2A7, Canada;Département de Génie Informatique et Génie Logiciel, École Polytechnique de Montréal, Montréal H3C 3A7, Canada;Département de Mathématiques et de Génie Industriel, École Polytechnique de Montréal, Montréal H3C 3A7, Canada
Venue:
Transportation Science
Year:
2011

Citing 12
Cited 5

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Optimal speedup of Las Vegas algorithms

Information Processing Letters
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics

Journal of Heuristics
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows

Journal of Heuristics
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 Framework for Constraint Programming Based Column Generation

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows

Transportation Science
A Hybrid Exact Algorithm for the TSPTW

INFORMS Journal on Computing
Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem

Operations Research
Models and branch-and-cut algorithms for pickup and delivery problems with time windows

Networks
Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis

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
Simple temporal problems in route scheduling for the dial---a---ride problem with transfers

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem

INFORMS Journal on Computing
Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis

Transportation Science
Reoptimizing the rural postman problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the dial-a-ride problem (DARP), a fleet of vehicles must serve transportation requests made by users that need to be transported from an origin to a destination. In this paper we develop the first exact algorithm which is able to either efficiently prove the infeasibility or to provide a feasible solution. Such an algorithm could be used in a dynamic setting for determining whether it is possible or not to accept an incoming request. The algorithm includes solution space reduction procedures, and filtering algorithms for some DARP relaxations. Computational results show that the filtering algorithms are effective and that the resulting algorithm is advantageous on the more constrained instances.