Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
From MaRDI portal
Publication:439557
DOI10.1016/j.ejor.2011.12.005zbMath1244.90047OpenAlexW1993768751WikidataQ57719471 ScholiaQ57719471MaRDI QIDQ439557
Marc Reimann, Vitória Pureza, Reinaldo Morabito
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
tabu searchmixed integer programmingant colony optimizationbeverage distributionvehicle routing with multiple deliverymenvehicle routing with time windows
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A branch-price-and-cut algorithm 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 ⋮ Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP ⋮ Using the primal-dual interior point algorithm within the branch-price-and-cut method ⋮ An exact hybrid method 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 ⋮ Variable neighborhood descent for solving the vehicle routing problem with time windows ⋮ The paired mail carrier problem ⋮ Small and large neighborhood search for the park-and-loop routing problem with parking selection ⋮ 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 ⋮ The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches ⋮ 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 ⋮ Robust optimization for the vehicle routing problem with multiple deliverymen ⋮ A matheuristic for the truck and trailer routing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparing backhauling strategies in vehicle routing using ant colony optimization
- Exact algorithms for routing problems under vehicle capacity constraints
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries
- The vehicle routing problem: An overview of exact and approximate algorithms
- ACO algorithms with guaranteed convergence to the optimal solution
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- The Vehicle Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The Plant Location Problem: New Models and Research Prospects
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows