A study in Tabu Search Algorithm to Solve a Special Vehicle Routing Problem

摘要

In this paper, a kind of special vehicle routing problem based on reality-- vehicle routing problem with facultative demands is presented. The attributes of the problem and the optimization target are described. The mathematical model of the problem is set up. To solve the problem, A meta-heuristic approach called tobu search (TS) is put forward. The neighborhood structure and the parameters of TS algorithm are designed respectively. The proposed algorithm is successfully applied to a case and the result indicates the TS algorithm is practicable and valid.