Two exact algorithms for the distance-constrained vehicle routing problem
From MaRDI portal
Recommendations
- A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem
- On the Distance Constrained Vehicle Routing Problem
- A new subtour elimination constraint for the vehicle routing problem
- Optimal Routing under Capacity and Distance Restrictions
- A branch-and-cut algorithm for vehicle routing problems
Cites work
Cited in
(34)- A cutting plane procedure for the travelling salesman problem on road networks
- Polyhedral results for a vehicle routing problem
- A new subtour elimination constraint for the vehicle routing problem
- \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
- Layered graph approaches for combinatorial optimization problems
- Probabilistic time-dependent vehicle routing problem
- The close-open mixed vehicle routing problem
- A truck and drones model for last-mile delivery: a mathematical model and heuristic approach
- A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation
- An overview of graph covering and partitioning
- The median routing problem for simultaneous planning of emergency response and non-emergency jobs
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Distance constrained vehicle routing problem to minimize the total cost
- Approximation algorithms for distance constraint sweep coverage with base stations
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation
- Routing and scheduling field service operation by P-graph
- The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach
- Approximation algorithms for distance constrained vehicle routing problems
- Exact algorithms for the double vehicle routing problem with multiple stacks
- Optimal Routing under Capacity and Distance Restrictions
- The school bus problem on trees
- On the Distance Constrained Vehicle Routing Problem
- Two exact algorithms for the vehicle routing problem on trees
- Exact hybrid algorithms for solving a bi-objective vehicle routing problem
- Green hybrid fleets using electric vehicles: solving the heterogeneous vehicle routing problem with multiple driving ranges and loading capacities
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- A branch and bound algorithm for the capacitated vehicle routing problem
- Branch and cut methods for network optimization
- Heuristic and exact algorithms for a min-max selective vehicle routing problem
- A mixed constrained (identical) vehicle routing problem for time minimisation
This page was built for publication: Two exact algorithms for the distance-constrained vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3325496)
