Variable neighborhood search for vehicle routing problem with multiple time windows

DOI10.1016/j.endm.2018.03.027zbMath1408.90344OpenAlexW2797774162MaRDI QIDQ1791961

Eduardo Theodoro Bogue, Slim Belhaiza, Christian Prins, Huggo Silva Ferreira, Thiago F. Noronha

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.027

zbMATH Keywords

vehicle routing problemvariable neighborhood searchmultiple time windows

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (4)

A stochastic approach for planning airport ground support resources ⋮ Solving a pickup and delivery routing problem for fourth‐party logistics providers ⋮ A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows ⋮ An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints

Cites Work

• A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
• The Truck Dispatching Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Ant colony system for a VRP with multiple time windows and multiple visits

This page was built for publication: Variable neighborhood search for vehicle routing problem with multiple time windows