The discrete time window assignment vehicle routing problem

DOI10.1016/J.EJOR.2015.01.020MaRDI QIDQ319363zbMATH OpenOpenAlexFDO

Authors Remy Spliet, Guy Desaulniers

Publication date 6 October 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2015.01.020

zbMATH Keywords

column generationvehicle routinguncertain demandtime window assignment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)

Recommendations

• A branch-and-cut algorithm for the time window assignment vehicle routing problem
• A synthesis of assignment and heuristic solutions for vehicle routing with time windows
• An assignment-based heuristic for vehicle routing with time windows
• A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times
• On solving the time window assignment vehicle routing problem via iterated local search

Cites work

• 2-path cuts for the vehicle routing problem with time windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A branch-price-and-cut algorithm for the workover rig routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A reoptimization algorithm for the shortest path problem with time windows
• A suggested computation for maximal multi-commodity network flows
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Column generation based primal heuristics
• Decomposition Principle for Linear Programs
• Introduction to Stochastic Programming
• New route relaxation and pricing strategies for the vehicle routing problem
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
• Vehicle Routing Problem with Time Windows

Cited in

(32)

• Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach
• An assignment-based heuristic for vehicle routing with time windows
• Time window optimization for attended home service delivery under multiple sources of uncertainties
• Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
• Product-oriented time window assignment for a multi-compartment vehicle routing problem
• Self-imposed time windows in vehicle routing problems
• Adaptive appointment scheduling with periodic updates
• Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector
• Consistent routing for local same-day delivery via micro-hubs
• A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system
• Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration
• A branch-and-cut algorithm for the time window assignment vehicle routing problem
• Solving the petroleum replenishment and routing problem with variable demands and time windows
• Primal Heuristics for Branch and Price: The Assets of Diving Methods
• Multi-period time window assignment for attended home delivery
• A survey of attended home delivery and service problems with a focus on applications
• On solving the time window assignment vehicle routing problem via iterated local search
• The vehicle routing problem with coupled time windows
• Efficient formulation for transportation scheduling of single refinery multiproduct pipelines
• Route-based approximate dynamic programming for dynamic pricing in attended home delivery
• Vehicle routing and appointment scheduling with team assignment for home services
• Column generation based primal heuristics for routing and loading problems
• Home service routing and appointment scheduling with stochastic service times
• Vehicle routing with heterogeneous time windows
• A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times
• The time‐consistent dial‐a‐ride problem
• Addressing orientation symmetry in the time window assignment vehicle routing problem
• A triple bottom line optimization model for assignment and routing of on-demand home services
• Demand management for attended home delivery -- a literature review
• A synthesis of assignment and heuristic solutions for vehicle routing with time windows
• Modeling Distribution Problems with Time Windows. Part II: Two Customer Types

Describes a project that uses

Uses Software

• CVRPSEP
• CVRPSP

This page was built for publication: The discrete time window assignment vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319363)