An approximation algorithm for the pickup and delivery vehicle routing problem on trees
DOI10.1016/J.DAM.2006.04.028zbMATH Open1130.90009OpenAlexW1996516197MaRDI QIDQ860395FDOQ860395
Authors: Naoki Katoh, Taihei Yano 
Publication date: 9 January 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.028
Recommendations
- A framework for vehicle routing approximation schemes in trees
- An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree
- A new approximation algorithm for the capacitated vehicle routing problem on a tree
- scientific article; zbMATH DE number 1522939
- Two exact algorithms for the vehicle routing problem on trees
- Approximation algorithms for some vehicle routing problems
- A PTAS for Capacitated Vehicle Routing on Trees
- The vehicle routing problem with pickups and deliveries on some special graphs
- scientific article; zbMATH DE number 1303035
- A branch-and-cut approach to the vehicle routing problem with simultaneous delivery and pick-up
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cites Work
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Title not available (Why is that?)
- A classification scheme for vehicle routing and scheduling problems
- The General Pickup and Delivery Problem
- Title not available (Why is that?)
- The travelling salesman problem with pick-up and delivery
- Capacitated Vehicle Routing on Trees
- A new approximation algorithm for the capacitated vehicle routing problem on a tree
- Title not available (Why is that?)
- Heuristics for the traveling salesman problem with pickup and delivery
- The traveling salesman problem with delivery and backhauls
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- The vehicle routing problem with pickups and deliveries on some special graphs
- \(k\)-delivery traveling salesman problem on tree networks
- An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree
- Approximation algorithms for the load-balanced capacitated vehicle routing problem
- A new approximation algorithm for the capacitated vehicle routing problem on a tree
- The preemptive swapping problem on a tree
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Two exact algorithms for the vehicle routing problem on trees
Uses Software
This page was built for publication: An approximation algorithm for the pickup and delivery vehicle routing problem on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860395)
