Approximation schemes for Euclidean vehicle routing problems with time windows

DOI10.1007/S10878-015-9931-5zbMath1355.90009OpenAlexW2186930354MaRDI QIDQ346518

Liang Song, Hejiao Huang, Hongwei David Du

Publication date: 29 November 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9931-5

zbMATH Keywords

approximation algorithmmodern logisticsVRPTW

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces ⋮ Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows ⋮ Randomized approximation scheme for Steiner multi cycle in the Euclidean plane ⋮ Model and algorithm of routes planning for emergency relief distribution in disaster management with disaster information update

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
• Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
• Competitive memetic algorithms for arc routing problems
• Bin packing can be solved within 1+epsilon in linear time
• Approximation schemes for NP-hard geometric optimization problems: a survey
• An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
• A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority
• Approximating a vehicle scheduling problem with time windows and handling times
• The Truck Dispatching Problem
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Bounds and Heuristics for Capacitated Routing Problems
• `` Strong NP-Completeness Results
• An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
• Multi-depot vehicle routing problem with time windows under shared depot resources

This page was built for publication: Approximation schemes for Euclidean vehicle routing problems with time windows