Self-imposed time windows in vehicle routing problems
From MaRDI portal
Publication:2018105
Recommendations
- Vehicle routing with soft time windows and Erlang travel times
- The vehicle routing problem with flexible time windows and traveling times
- A bi-criteria heuristic for the vehicle routing problem with time windows
- The discrete time window assignment vehicle routing problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Cites work
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
- A hybrid method based on linear programming and tabu search for routing of logging trucks
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- An Exchange Heuristic for Routeing Problems with Time Windows
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Meta-heuristics for stable scheduling on a single machine
- Multiple machine JIT scheduling: a tabu search approach
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Robust discrete optimization and its applications
- Scheduling for stability in single-machine production systems
- Separating capacity constraints in the CVRP using tabu search
- Single-Vehicle Routing and Scheduling to Minimize the Number of Delays
- The Vehicle Routing Problem with Stochastic Travel Times
- The complexity of machine scheduling for stability with a single disrupted job
- The construction of stable project baseline schedules
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
Cited in
(12)- Product-oriented time window assignment for a multi-compartment vehicle routing problem
- A survey of attended home delivery and service problems with a focus on applications
- A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows
- Vehicle routing and appointment scheduling with team assignment for home services
- Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
- Time window optimization for attended home service delivery under multiple sources of uncertainties
- A concise guide to existing and emerging vehicle routing problem variants
- The vehicle routing problem with arrival time diversification on a multigraph
- A vehicle routing problem with multiple service agreements
- Statistical arbitrage: factor investing approach
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- A branch-and-cut algorithm for the time window assignment vehicle routing problem
This page was built for publication: Self-imposed time windows in vehicle routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018105)
