A tabu search algorithm for the open vehicle routing problem

Enhanced mixed integer programming techniques and routing problems

“…Considering capacity constraints only (i.e., taking D = ∞), Sariklis and Powell [154] propose a two-phase heuristic which first assigns customers to clusters and then builds a Hamiltonian path for each cluster, Tarantilis et al [163] describe a population-based heuristic, while Tarantilis et al [164,165] present threshold accepting metaheuristics. Taking into account both capacity and distance constraints, Brandão [40], Fu et al [90,91] and Derigs and Reuter [69] propose tabu search heuristics, Li et al [115] describe a record-to-record travel heuristic, Pisinger and Ropke [141] present an adaptive large neighborhood search heuristic which follows a destroy-and-repair paradigm, while Fleszar et al [88] propose a variable neighborhood search heuristic.…”

A unified tabu search algorithm for vehicle routing problems with soft time windows

“…With respect to the TS metaheuristic for the VRP, some researchers, such as Van Breedam (2001) and Brandão (2004), claimed that the performance of the TS heuristic was highly dependent on the quality of the initial solutions. However, in our previous work (Fu et al, 2005), it was shown that the initial solution did not have a large influence on the final solutions in the proposed TS heuristic.…”

“…Some discussion of different neighbourhood structures for VRP was presented in Fu et al (2005), including proposals from Pureza and França (1991), Osman (1993), Gendreau et al (1994), Duhamel et al (1997), Cordeau et al (2001), Brandão (2004) and Taillard et al (1997).…”

Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application

“…propose a single parameter simulated annealing-based algorithm for the same problem. Brandão (2004) proposes a tabu search algorithm (TS) for OVRP with maximum route length constraint. Another TS algorithm is due Fu et al (2005) again subject to maximum route length constraint.…”