Real-time vehicle rerouting problems with time windows
From MaRDI portal
Publication:958553
DOI10.1016/j.ejor.2007.12.037zbMath1168.90362OpenAlexW1970224963MaRDI QIDQ958553
Denis Borenstein, Jing-Quan Li, Pitu B. Mirchandani
Publication date: 5 December 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.12.037
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
Single vehicle routing with predefined client sequence and multiple warehouse returns: the case of two warehouses, Optimal routing for electric vehicle service systems, Disrupted capacitated vehicle routing problem with order release delay, Real-time freight locomotive rescheduling and uncovered train detection during disruption, Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand, Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery, Solving Dynamic Vehicle Routing Problem with Soft Time Window by iLNS and hPSO, Optimization models for assessing the peak capacity utilization of intelligent transportation systems, Optimization of blood sample collection with timing and quality constraints, Cyber-physical logistics system-based vehicle routing optimization, Disruption management in vehicle routing and scheduling for road freight transport: a review, An improved LNS algorithm for real-time vehicle routing problem with time windows, An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A decision support system for the single-depot vehicle rescheduling problem
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- The pickup and delivery problem with time windows
- Stochastic vehicle routing
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- A dynamic vehicle routing problem with time-dependent travel times
- Dynamic vehicle routing: Status and prospects
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Exploiting the Opportunities of Collaborative Decision Making: A Model and Efficient Solution Algorithm for Airline Use
- Diversion Issues in Real-Time Vehicle Dispatching
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
- Parallel Auction Algorithm for Bus Rescheduling
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- A Heuristic Method for the Set Covering Problem
- The vehicle rescheduling problem: Model and algorithms
- The traveling-salesman problem and minimum spanning trees: Part II
- 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
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
