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 and node.java contain the code for representing a vehicle transporting persons and a the code representing a node.