A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times
DOI10.1007/S11067-021-09553-6OpenAlexW4206948124MaRDI QIDQ2148147FDOQ2148147
Vinicius Amaral Armentano, Ramon Faganello Fachini, Franklina M. B. 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
vehicle routing problemmatheuristicheterogeneous fleetstochastic travel timesflexible time windowsgranular local search
Operations research and management science (90Bxx) Mathematical programming (90Cxx) Operations research, mathematical programming (90-XX)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cumulative Frequency Functions
- The effect of ignoring routes when locating depots
- Logic-based Benders decomposition
- Local branching
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
- The truck dispatching problem
- Introduction to Stochastic Programming
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Vehicle routing with soft time windows and Erlang travel times
- Travel time reliability in vehicle routing and scheduling with time windows
- The vehicle routing problem. Latest advances and new challenges.
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- The value of the stochastic solution in stochastic linear programs with fixed recourse
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- Routing a Heterogeneous Fleet of Vehicles
- Proximity search for 0--1 mixed-integer convex programming
- Industrial aspects and literature survey: fleet composition and routing
- Vehicle Routing
- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
- The granular tabu search and its application to the vehicle-routing problem
- 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
- 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 heuristic column generation method for the heterogeneous fleet VRP
- A vehicle routing problem with flexible time windows
- A Look at the Burr and Related Distributions
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- A MIP based local search heuristic for a stochastic maritime inventory routing problem
- Designing granular solution methods for routing problems with time windows
- An adjustable sample average approximation algorithm for the stochastic production‐inventory‐routing problem
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
Cited In (2)
Uses Software
This page was built for publication: A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148147)
