The Electric Autonomous Dial-A-Ride Problem (E-ADARP) consists in scheduling a fleet of Electric Autonomous Vehicles (EAVs) to provide ride-sharing services for users specifying their origins and destinations. In this work, we emphasize the conflicting interests of service providers and users in the objective function of the E-ADARP and investigate the Bi-objective E-ADARP (BO-EADARP). The two objectives of the BO-EADARP are the total travel time of all vehicles and the total excess user ride time of all users. We first embed a column generation approach into the Dichotomic method to calculate all extreme supported solutions. To obtain non-supported solutions, we apply an epsilon-constraint-based approach. Our preliminary results show that the total excess user ride time can be reduced significantly with only a slight increase in total travel time. This finding offers practical interest for service providers to largely improve the service quality at a slight operational cost increase.