This paper is addressing a new class of on-demand transport problems oriented toward customers. A mixed-integer linear programming model is proposed with new effective constraints that contribute to enhancing the quality of service. An exact resolution has been achieved, leading to lower bounds of the solution space of real cases of on-demand transport problems. To overcome the exponential computational time of the exact resolution, an evolutionary descent method is developed. It relies on a new operator for perturbing the search. The comparative results between the new method and the branch and bound show low gaps for almost all the instances tested with lower execution times. The results of the evolutionary descent method are also compared with the results of two different heuristics, namely a Tabu Search and an Evolutionary Local Search. Our evolutionary method demonstrates its effectiveness through competitive and promising results.
As customers’ expectations continue to rise, advanced on-demand transport services face the challenge of meeting new requirements. This study addresses a specific transportation issue belonging to dial-a-ride problems, including constraints aimed at fulfilling customer needs. In order to provide more efficient on-demand transportation solutions, we propose a new hybrid evolutionary computation method. This method combines customized heuristics including two exchanged mutation operators, a crossover, and a tabu search. These optimization techniques have been empirically proven to support advanced designs and reduce operational costs, while significantly enhancing service quality. A comparative analysis with an evolutionary local search method from the literature has demonstrated the effectiveness of our approach across small-to-large-scale problems. The main results show that service providers can optimize their scheduling operations, reduce travel costs, and ensure a high level of service quality from the customer’s perspective.