An effective tabu search algorithm for large- scale and real-time vehicle dispatching problems

A new mathematical model for large-scale and real-time vehicle dispatching problems (LRVDP) is established in this paper. Due to the high complexity of the problems, an effective tabu search algorithm for application to LRVDP is proposed. The new algorithm applies dynamic oscillation and candidate list strategies, which are controlled by the success of the search as the solution progresses, to make best use of infeasible verses feasible space and promising verses the most promising neighbors´ moves. The results show that the new algorithm can determine very good solutions in a quite-short computing time, thereby, solve LRVDP effectively.