Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
From MaRDI portal
(Redirected from Publication:439557)
Recommendations
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
- Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen
- Tabu search algorithm for the vehicle routing problem with time windows and multiple delivery men
- The delivery man problem with time windows
Cites work
- scientific article; zbMATH DE number 192876 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1961999 (Why is no real title available?)
- scientific article; zbMATH DE number 1488089 (Why is no real title available?)
- scientific article; zbMATH DE number 1749226 (Why is no real title available?)
- scientific article; zbMATH DE number 1749229 (Why is no real title available?)
- scientific article; zbMATH DE number 956786 (Why is no real title available?)
- scientific article; zbMATH DE number 956787 (Why is no real title available?)
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- ACO algorithms with guaranteed convergence to the optimal solution
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Ant colony optimization.
- Comparing backhauling strategies in vehicle routing using ant colony optimization
- Exact algorithms for routing problems under vehicle capacity constraints
- Handbooks in operations Research \& management science: Transportation
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- The Plant Location Problem: New Models and Research Prospects
- The vehicle routing problem
- The vehicle routing problem: An overview of exact and approximate algorithms
Cited in
(23)- Modelization of time-dependent urban freight problems by using a multiple number of distribution centers
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- An optimization approach for communal home meal delivery service: A case study
- An exact method for a last-mile delivery routing problem with multiple deliverymen
- Modeling Distribution Problems with Time Windows. Part II: Two Customer Types
- Models and algorithms for the delivery and installation routing problem
- The effects of the tractor and semitrailer routing problem on mitigation of carbon dioxide emissions
- The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
- Small and large neighborhood search for the park-and-loop routing problem with parking selection
- A matheuristic for the truck and trailer routing problem
- Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows
- An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands
- How to choose ``last mile delivery modes for E-fulfillment
- Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen
- A multi-shift vehicle routing problem with windows and cycle times
- Variable neighborhood descent for solving the vehicle routing problem with time windows
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
- Robust optimization for the vehicle routing problem with multiple deliverymen
- The paired mail carrier problem
- Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
- Vehicle routing with arrival time diversification
This page was built for publication: Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439557)
