A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
From MaRDI portal
Publication:1617109
DOI10.1007/S11750-018-0481-8zbMath1402.90214OpenAlexW2803443944WikidataQ57719334 ScholiaQ57719334MaRDI QIDQ1617109
Reinaldo Morabito, Pedro Augusto Munari
Publication date: 7 November 2018
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-018-0481-8
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (3)
Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen ⋮ Fleet management for autonomous vehicles using flows in time-expanded networks ⋮ Robust optimization for the vehicle routing problem with multiple deliverymen
Uses Software
Cites Work
- Unnamed Item
- Large-scale optimization with the primal-dual column generation method
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
- The discrete time window assignment vehicle routing problem
- A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- A hybrid algorithm for a class of vehicle routing problems
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Interior point methods 25 years later
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- Routing problems with loading constraints
- The vehicle routing problem. Latest advances and new challenges.
- On the choice of explicit stabilizing terms in column generation
- On the capacitated vehicle routing problem
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- Branching rules revisited
- New developments in the primal-dual column generation technique
- Improved branch-cut-and-price for capacitated vehicle routing
- Interior point stabilization for column generation
- Comparison of bundle and classical column generation
- Vehicle routing problem with elementary shortest path based column generation
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A survey on matheuristics for routing problems
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- Vehicle Routing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- On constrained optimization by adjoint based quasi-Newton methods
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- A Computational Study of Search Strategies for Mixed Integer Programming
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Generalized Bundle Methods
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints
- Implementing Mixed Integer Column Generation
- Solving large airline crew scheduling problems: Random pairing generation and strong branching
This page was built for publication: A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
