The multiple TSP with time windows: vehicle bounds based on precedence graphs
From MaRDI portal
Publication:2583718
Recommendations
- The Multiple Vehicle TSP with Time Windows and Equity Constraints over a Multiple Day Horizon
- Multi-trip time-dependent vehicle routing problem with time windows
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows
- An exact solution framework for multitrip vehicle-routing problems with time windows
- scientific article; zbMATH DE number 5944664
- Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
- A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows
- A GRASP for the Vehicle Routing Problem with Time Windows
- Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows
Cites work
- A decomposition theorem for partially ordered sets
- A GRASP for the Vehicle Routing Problem with Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- scientific article; zbMATH DE number 3760195 (Why is no real title available?)
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 758742 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- Network flows. Theory, algorithms, and applications.
- On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
- Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search
- The vehicle routing problem
Cited in
(4)
This page was built for publication: The multiple TSP with time windows: vehicle bounds based on precedence graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583718)