Branch and Cut Algorithm for a Dial-a-Ride Problem

This is the implementation of the paper "A Branch-and-Cut Algorithm for the Dial-a-Ride Problem" from Jean-Francois Cordeau. The paper can be found here.

The algorithm is implemented using the CPLEX JAVA API.

The main part of the implementation is in located in model.java. This file contains all the constraints. The classes Truck.java contains the code for a vehicle and Node.java contains the code for a node in the graph.

The code is fully commented and works.

How to use

1. Download the src/logic folder.
2. Open Eclipse IDE and then open the project via 'File' -> 'Open Projects From File System' and select the downloaded folder.
3. Add the cplex.jar to the referenced libraries. You need Cplex being installed on your PC. How you add cplex.jar to the project you can read in the official documentation of IBM on how to add cplex.jar to Eclipse IDE.
4. Simply run model.java via 'right click on the file' and 'Run As' -> '1 Java Application'. The model can be solved with the default settings.