scientific article
From MaRDI portal
Publication:2741611
zbMath0976.90017MaRDI QIDQ2741611
Publication date: 20 September 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (8)
Routing relatively few customers per route ⋮ A multi-start local search algorithm for the vehicle routing problem with time windows ⋮ A hybrid search method for the vehicle routing problem with time windows ⋮ Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics ⋮ A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows ⋮ A memetic algorithm for the vehicle routing problem with time windows ⋮ Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance ⋮ Tabu search heuristics for the vehicle routing problem with time windows.
This page was built for publication: