An approximation algorithm for the pickup and delivery vehicle routing problem on trees

DOI10.1016/j.dam.2006.04.028zbMath1130.90009OpenAlexW1996516197MaRDI QIDQ860395

Taihei Yano, Naoki Katoh

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

zbMATH Keywords

vehicle routingapproximation algorithm

Mathematics Subject Classification ID

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

Related Items (3)

Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ Approximation algorithms for the load-balanced capacitated vehicle routing problem ⋮ The preemptive swapping problem on a tree

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A classification scheme for vehicle routing and scheduling problems
• Heuristics for the traveling salesman problem with pickup and delivery
• The travelling salesman problem with pick-up and delivery
• The traveling salesman problem with delivery and backhauls
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Capacitated Vehicle Routing on Trees
• The General Pickup and Delivery Problem
• A new approximation algorithm for the capacitated vehicle routing problem on a tree

This page was built for publication: An approximation algorithm for the pickup and delivery vehicle routing problem on trees