Self-imposed time windows in vehicle routing problems
From MaRDI portal
Publication:2018105
DOI10.1007/s00291-013-0348-1zbMath1311.90030OpenAlexW2143046423MaRDI QIDQ2018105
Roel Leus, Ton G. de Kok, Ola Jabali, Tom Van Woensel
Publication date: 10 April 2015
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/416012
Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items
A branch-and-cut algorithm for the time window assignment vehicle routing problem ⋮ 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 ⋮ Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location ⋮ A survey of attended home delivery and service problems with a focus on applications ⋮ Statistical arbitrage: factor investing approach ⋮ A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows ⋮ Product-oriented time window assignment for a multi-compartment vehicle routing problem ⋮ An adaptive large neighborhood search heuristic for the pollution-routing problem ⋮ Vehicle routing and appointment scheduling with team assignment for home services ⋮ Time window optimization for attended home service delivery under multiple sources of uncertainties
Cites Work
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- Scheduling for stability in single-machine production systems
- 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
- Robust discrete optimization and its applications
- Separating capacity constraints in the CVRP using tabu search
- The construction of stable project baseline schedules
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Meta-heuristics for stable scheduling on a single machine
- The complexity of machine scheduling for stability with a single disrupted job
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- The Vehicle Routing Problem with Stochastic Travel Times
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Single-Vehicle Routing and Scheduling to Minimize the Number of Delays
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- An Exchange Heuristic for Routeing Problems with Time Windows
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- Multiple machine JIT scheduling: a tabu search approach
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
