Robust vehicle routing problem with hard time windows under demand and travel time uncertainty
From MaRDI portal
Publication:1652619
DOI10.1016/J.COR.2018.02.006zbMath1391.90064OpenAlexW2791449870MaRDI QIDQ1652619
C. Hu, Jie Lu, Guang-Quan Zhang, Xiao Liu
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10453/132022
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06)
Related Items (9)
The vehicle routing problem with time windows and evidential service and travel times: a recourse model ⋮ The traveling salesman problem with job-times (\textit{TSPJ}) ⋮ Two server dynamic coverage location model under stochastic travel time ⋮ Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times ⋮ A general variable neighborhood search for the traveling salesman problem with time windows under various objectives ⋮ Optimizing distribution route of convenience vegetable stores considering transit nodes ⋮ Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics ⋮ Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios ⋮ Managing rail-truck intermodal transportation for hazardous materials with random yard disruptions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- The robust vehicle routing problem with time windows
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- The capacitated vehicle routing problem with stochastic demands and time windows
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- Travel time reliability in vehicle routing and scheduling with time windows
- A general heuristic for vehicle routing problems
- Variable neighborhood search
- Robust discrete optimization and network flows
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- Robust optimization-methodology and applications
- A variable neighborhood search heuristic for periodic routing problems
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
- Ensuring service levels in routing problems with time windows and stochastic travel times
- The Truck Dispatching Problem
- Routing Optimization Under Uncertainty
- The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Vehicle Routing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Theory and Applications of Robust Optimization
- Layered Formulation for the Robust Vehicle Routing Problem with Time Windows
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Vehicle routing with soft time windows and Erlang travel times
- The Price of Robustness
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- A unified tabu search heuristic for vehicle routing problems with time windows
This page was built for publication: Robust vehicle routing problem with hard time windows under demand and travel time uncertainty
