Tabu search for a multi-objective routing problem

Abstract

Multi-objective optimization problems deal with the presence of different conflicting objectives. Given that it is not possible to obtain a single solution by optimizing all the objectives simultaneously, a common way to face these problems is to obtain a set of efficient solutions called the non-dominated frontier. In this paper, we address the problem of routing school buses with two objectives: minimize the number of buses, and minimize the longest time a student would have to stay in the bus. The trade-off in this problem is between service level, which is represented by the maximum route length, and operational cost, which is represented by the number of buses in the solution. We present different constructive solution methods and a tabu search procedure to obtain non-dominated solutions. The procedure is coupled with an intensification phase based on the path relinking methodology: a strategy proposed several years ago, which has been rarely used in actual implementations. Computational experiments with real data, in the context of routing school buses in a rural area, establish the effectiveness of our procedure in relation to the approach previously identified to be the best.