The vehicle rescheduling problem
DOI10.1016/J.COR.2013.09.009zbMATH Open1348.90131OpenAlexW2023381984MaRDI QIDQ336901FDOQ336901
Rommert Dekker, Adriana F. Gabor, Remy Spliet
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://repub.eur.nl/pub/17350
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A library of local search heuristics for the vehicle routing problem
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- The vehicle routing problem: An overview of exact and approximate algorithms
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Vehicle Routing Problem with Stochastic Demand
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- What you should know about the vehicle routing problem
- A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- The vehicle rescheduling problem: Model and algorithms
Cited In (7)
- Disruption management in vehicle routing and scheduling for road freight transport: a review
- Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery
- Scheduling taxi services for a team of car relocators
- A dynamic scheduling process and methodology using route deviations and synchronized passenger transfers for flexible feeder transit services
- A convoy scheduling problem
- The basic problem of vehicle scheduling can be solved by maximum bipartite matching
- Title not available (Why is that?)
Uses Software
This page was built for publication: The vehicle rescheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336901)