The discrete time window assignment vehicle routing problem
From MaRDI portal
Publication:319363
DOI10.1016/j.ejor.2015.01.020zbMath1346.90180OpenAlexW2023470442MaRDI QIDQ319363
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
Programming involving graphs or networks (90C35) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)
Related Items (20)
A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen ⋮ Solving the petroleum replenishment and routing problem with variable demands and time windows ⋮ A branch-and-cut algorithm for the time window assignment vehicle routing problem ⋮ Adaptive appointment scheduling with periodic updates ⋮ The time‐consistent dial‐a‐ride problem ⋮ Demand management for attended home delivery -- a literature review ⋮ Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times ⋮ A survey of attended home delivery and service problems with a focus on applications ⋮ Primal Heuristics for Branch and Price: The Assets of Diving Methods ⋮ Product-oriented time window assignment for a multi-compartment vehicle routing problem ⋮ Column generation based primal heuristics for routing and loading problems ⋮ Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector ⋮ Route-based approximate dynamic programming for dynamic pricing in attended home delivery ⋮ Vehicle routing and appointment scheduling with team assignment for home services ⋮ Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration ⋮ Home service routing and appointment scheduling with stochastic service times ⋮ Efficient formulation for transportation scheduling of single refinery multiproduct pipelines ⋮ On solving the time window assignment vehicle routing problem via iterated local search ⋮ Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem ⋮ Time window optimization for attended home service delivery under multiple sources of uncertainties
Uses Software
Cites Work
- A branch-price-and-cut algorithm for the workover rig routing problem
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- A reoptimization algorithm for the shortest path problem with time windows
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Column Generation based Primal Heuristics
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- Decomposition Principle for Linear Programs
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Introduction to Stochastic Programming
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Vehicle Routing Problem with Time Windows
This page was built for publication: The discrete time window assignment vehicle routing problem
