The multiple TSP with time windows: vehicle bounds based on precedence graphs

DOI10.1016/j.orl.2005.01.009zbMath1080.90066OpenAlexW2041485345MaRDI QIDQ2583718

Ramesh Krishnamurti, Snežana Mitrović-Minić

Publication date: 18 January 2006

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2005.01.009

zbMATH Keywords

bounds for the minimum number of vehiclesmultiple traveling salesman problem with time windows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (max. 100)

An optimization approach for communal home meal delivery service: A case study ⋮ Shortest path problems with left-side time windows ⋮ Integrated planning of loaded and empty container movements ⋮ A post-improvement procedure for the mixed load school bus routing problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decomposition theorem for partially ordered sets
• The Vehicle Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
• A GRASP for the Vehicle Routing Problem with Time Windows
• Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search

This page was built for publication: The multiple TSP with time windows: vehicle bounds based on precedence graphs