A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times

DOI10.1007/s11067-021-09553-6OpenAlexW4206948124MaRDI QIDQ2148147

Vinicius Amaral Armentano, Ramon Faganello Fachini, Franklina Maria Bragion Toledo

Publication date: 21 June 2022

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-021-09553-6

zbMATH Keywords

vehicle routing problemmatheuristicheterogeneous fleetstochastic travel timesflexible time windowsgranular local search

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Operations research and management science (90Bxx) Operations research, mathematical programming (90-XX)

Uses Software

• VRP
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
• Thirty years of heterogeneous vehicle routing
• Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic
• Progressive hedging applied as a metaheuristic to schedule production in open-pit mines accounting for reserve uncertainty
• A vehicle routing problem with flexible time windows
• Vehicle routing problem with stochastic travel times including soft time windows and service costs
• Proximity search for 0--1 mixed-integer convex programming
• Travel time reliability in vehicle routing and scheduling with time windows
• The vehicle routing problem. Latest advances and new challenges.
• Industrial aspects and literature survey: fleet composition and routing
• Adaptive granular local search heuristic for a dynamic vehicle routing problem
• The effect of ignoring routes when locating depots
• Logic-based Benders decomposition
• Local branching
• A MIP based local search heuristic for a stochastic maritime inventory routing problem
• Designing granular solution methods for routing problems with time windows
• Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
• Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
• The Truck Dispatching Problem
• Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• Vehicle Routing
• Introduction to Stochastic Programming
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
• Progressive hedging-based metaheuristics for stochastic network design
• The fleet size and mix vehicle routing problem with time windows
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Vehicle routing with soft time windows and Erlang travel times
• Routing a Heterogeneous Fleet of Vehicles
• A Look at the Burr and Related Distributions
• The value of the stochastic solution in stochastic linear programs with fixed recourse
• A heuristic column generation method for the heterogeneous fleet VRP
• An adjustable sample average approximation algorithm for the stochastic production‐inventory‐routing problem
• Cumulative Frequency Functions

This page was built for publication: A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times