A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times
From MaRDI portal
(Redirected from Publication:2148147)
Recommendations
- The Vehicle Routing Problem with Stochastic Travel Times
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- The vehicle routing problem with flexible time windows and traveling times
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
- The capacitated vehicle routing problem with stochastic demands and time windows
Cites work
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 956787 (Why is no real title available?)
- A Look at the Burr and Related Distributions
- A MIP based local search heuristic for a stochastic maritime inventory routing problem
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- A heuristic column generation method for the heterogeneous fleet VRP
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
- A vehicle routing problem with flexible time windows
- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem
- Cumulative Frequency Functions
- 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
- Industrial aspects and literature survey: fleet composition and routing
- Introduction to stochastic programming.
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- Local branching
- Logic-based Benders decomposition
- 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
- Progressive hedging-based metaheuristics for stochastic network design
- Proximity search for 0--1 mixed-integer convex programming
- Routing a heterogeneous fleet of vehicles
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- The effect of ignoring routes when locating depots
- The fleet size and mix vehicle routing problem with time windows
- The granular tabu search and its application to the vehicle-routing problem
- The truck dispatching problem
- The value of the stochastic solution in stochastic linear programs with fixed recourse
- The vehicle routing problem. Latest advances and new challenges.
- Thirty years of heterogeneous vehicle routing
- Travel time reliability in vehicle routing and scheduling with time windows
- Vehicle Routing
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- Vehicle routing with soft time windows and Erlang travel times
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
Cited in
(3)
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)
