A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions

Assessing and improving management practices when planning packaging waste collection systems

“…Mourgaya and Vanderbeck (2007) presented a column generation procedure followed by a rounding heuristic to solve a PVRP with two objectives: minimizing total distance travelled and balance workload among vehicles. Other heuristic applications to PVRP can be found in Christofides and Beasley (1984), Gaudioso and Paletta (1992), Chao et al (1995), Cordeau et al (1997) and Alonso et al (2008), to name a few.…”

Exact algorithms for different classes of vehicle routing problems

“…Olivera and Viera [2007] described an adaptive memory heuristic algorithm. Different tabu search algorithms were proposed by Alonso et al [2008], Mercer [1997, 1998]. A real life application of the MTVRP is described in Gribkovskaia et al [2006].…”

A planning model and solution algorithm for multi-trip split-delivery vehicle routing and scheduling problems with time windows

“…Although the MTVRP clearly has practical importance, the problem has not received much attention in the literature (Azi, Gendreau, & Potvin, 2007). Among the related studies, Alonso, Alvarez, and Beasley (2008), Mingozzi, Roberti, and Toth (2013), Olivera and Viera (2007), Petch and Salhi (2003), Salhi and Petch (2007), and Taillard, Laporte, and Gendreau (1996) simply examined a multi-trip extension of the original VRP. Azi et al (2007), Azi, Gendreau, and Potvin (2010), Brandão and Mercer (1997, 1998), and Tang, Yu, and Li (2015 incorporated multiple vehicle uses into the VRPTW to formulate a multi-trip VRPTW (MTVRPTW).…”