Self-imposed time windows in vehicle routing problems

DOI10.1007/S00291-013-0348-1zbMATH Open1311.90030OpenAlexW2143046423MaRDI QIDQ2018105FDOQ2018105

Authors: Ola Jabali, Roel Leus, Ton de Kok, 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

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

zbMATH Keywords

linear programmingtabu searchvehicle routing problemvehicle schedulingdisruptions in travel times

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Cites Work

• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• Robust discrete optimization and its applications
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• The Vehicle Routing Problem with Stochastic Travel Times
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• An Exchange Heuristic for Routeing Problems with Time Windows
• Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
• 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
• 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
• Separating capacity constraints in the CVRP using tabu search
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• 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
• Meta-heuristics for stable scheduling on a single machine
• The complexity of machine scheduling for stability with a single disrupted job
• Scheduling for stability in single-machine production systems
• Multiple machine JIT scheduling: a tabu search approach
• Single-Vehicle Routing and Scheduling to Minimize the Number of Delays

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)