Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
DOI10.1016/J.EJOR.2011.12.005zbMATH Open1244.90047OpenAlexW1993768751WikidataQ57719471 ScholiaQ57719471MaRDI QIDQ439557FDOQ439557
Authors: Vitória Pureza, Reinaldo Morabito, Marc Reimann 
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.12.005
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
ant colony optimizationmixed integer programmingtabu searchbeverage distributionvehicle routing with multiple deliverymenvehicle routing with time windows
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Ant colony optimization.
- Title not available (Why is that?)
- Title not available (Why is that?)
- The vehicle routing problem: An overview of exact and approximate algorithms
- The vehicle routing problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Handbooks in operations Research \& management science: Transportation
- Title not available (Why is that?)
- Exact algorithms for routing problems under vehicle capacity constraints
- 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)
- Comparing backhauling strategies in vehicle routing using ant colony optimization
- Title not available (Why is that?)
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Title not available (Why is that?)
- 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
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- Title not available (Why is that?)
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries
- ACO algorithms with guaranteed convergence to the optimal solution
- The Plant Location Problem: New Models and Research Prospects
- Title not available (Why is that?)
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
- Variable neighborhood descent for solving the vehicle routing problem with time windows
- A multi-shift vehicle routing problem with windows and cycle times
- 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
Uses Software
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)
