A branch-and-cut algorithm for the time window assignment vehicle routing problem
From MaRDI portal
Recommendations
- The discrete time window assignment vehicle routing problem
- 2-path cuts for the vehicle routing problem with time windows
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- Addressing orientation symmetry in the time window assignment vehicle routing problem
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
Cites work
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- Integer Programming Formulation of Traveling Salesman Problems
- Optimal Routing under Capacity and Distance Restrictions
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Self-imposed time windows in vehicle routing problems
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- Stochastic vehicle routing
- The discrete time window assignment vehicle routing problem
- The Euclidean traveling salesman problem is NP-complete
- Topological sorting of large networks
Cited in
(18)- Route-based approximate dynamic programming for dynamic pricing in attended home delivery
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
- On solving the time window assignment vehicle routing problem via iterated local search
- Time window optimization for attended home service delivery under multiple sources of uncertainties
- The discrete time window assignment vehicle routing problem
- Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
- Addressing orientation symmetry in the time window assignment vehicle routing problem
- Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times
- A survey of attended home delivery and service problems with a focus on applications
- Delay-resistant robust vehicle routing with heterogeneous time windows
- Mathematical formulations for consistent travelling salesman problems
- General VNS for asymmetric vehicle routing problem with time and capacity constraints
- Consistent routing for local same-day delivery via micro-hubs
- Multi-period time window assignment for attended home delivery
- Models and algorithms for the time window assignment traveling salesperson problem with stochastic travel times
- A queueing-based approach for integrated routing and appointment scheduling
- An updated survey of attended home delivery and service problems with a focus on applications
- An attention-enhanced \textit{meta}-heuristic algorithm for multi-drone assisted humanitarian delivery problem
This page was built for publication: A branch-and-cut algorithm for the time window assignment vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652456)
