Solution approaches for the vehicle routing problem with occasional drivers and time windows

DOI10.1080/10556788.2021.2022142OpenAlexW4213332151MaRDI QIDQ5058379

Luigi Di Puglia Pugliese, Daniele Ferone, Giusy Macrina, Paola Festa, Francesca Guerriero

Publication date: 20 December 2022

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2021.2022142

zbMATH Keywords

metaheuristicsvehicle routingoccasional driverscrowd-shipping

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• GRASP
• irace

Cites Work

• Unnamed Item
• The vehicle routing problem with occasional drivers
• The constrained shortest path tour problem
• Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• A probabilistic heuristic for a computationally difficult set covering problem
• GRASP with a new local search scheme for vehicle routing problems with time windows
• Heuristics for the constrained incremental graph drawing problem
• The vehicle routing problem with dynamic occasional drivers
• The pickup and delivery problem with time windows and occasional drivers
• The online vehicle routing problem with occasional drivers
• Crowd-shipping with time windows and transshipment nodes
• Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
• Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An annotated bibliography of GRASP-Part II: Applications
• Solving the single-container loading problem by a fast heuristic method
• An annotated bibliography of GRASP – Part I: Algorithms
• Randomized heuristics for the Max-Cut problem
• Extending time‐to‐target plots to multiple instances
• Iterated local search and simulated annealing algorithms for the inventory routing problem
• An efficient exact approach for the constrained shortest path tour problem