Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
From MaRDI portal
(Redirected from Publication:5322013)
Recommendations
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- Partially dynamic vehicle routing—models and algorithms
- Dynamic vehicle routing with priority classes of stochastic demands
- Vehicle routing problem with stochastic demand
- A Vehicle Routing Problem with Stochastic Demand
- Stochastic vehicle routing with recourse
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- Stochastic vehicle routing
Cited in
(only showing first 100 items - show all)- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- Dynamic pickup and delivery problems
- Modeling methods and a branch and cut algorithm for pharmaceutical clinical trial planning using stochastic programming
- Real-time control of freight forwarder transportation networks by integrating multimodal transport chains
- Online spatio-temporal matching in stochastic and dynamic domains
- Multi-period technician scheduling with experience-based service times and stochastic customers
- A monarch butterfly optimization for the dynamic vehicle routing problem
- Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search
- Value function approximation for dynamic multi-period vehicle routing
- Comments on: ``Disruption management in vehicle routing and scheduling for road freight transport: a review
- A probabilistic approach to pickup and delivery problems with time window uncertainty
- A dynamic vehicle routing problem with multiple delivery routes
- An improved LNS algorithm for real-time vehicle routing problem with time windows
- Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
- Online stochastic optimization under time constraints
- Same-day delivery with pickup stations and autonomous vehicles
- Route-based approximate dynamic programming for dynamic pricing in attended home delivery
- The online vehicle routing problem with occasional drivers
- A multi-period analysis of the integrated item-sharing and crowdshipping problem
- Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
- Deep Q-learning for same-day delivery with vehicles and drones
- Time window optimization for attended home service delivery under multiple sources of uncertainties
- Opportunities for reinforcement learning in stochastic dynamic vehicle routing
- Learning surrogate functions for the short-horizon planning in same-day delivery problems
- Comparison of anticipatory algorithms for a dial-a-ride problem
- A review of revenue management: recent generalizations and advances in industry applications
- An online stochastic algorithm for a dynamic nurse scheduling problem
- Decision making on post-disaster rescue routing problems from the rescue efficiency perspective
- Column generation-based stochastic school bell time and bus scheduling optimization
- Scenario tree construction driven by heuristic solutions of the optimization problem
- A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority
- Optimization for dynamic ride-sharing: a review
- Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing
- Operations research at container terminals: a literature update
- Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
- A dynamic and probabilistic orienteering problem
- A Markov decision process model on dynamic routing for target surveillance
- Dynamic service area sizing in urban delivery
- A scalable anticipatory policy for the dynamic pickup and delivery problem
- Distributed stochastic multi-vehicle routing in the Euclidean plane with no communications
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- Online traveling salesman problems with service flexibility
- The stochastic customer vehicle routing problem and its algorithm analysis
- The post-disaster debris clearance problem under incomplete information
- Effective truckload dispatch decision methods with incomplete advance load information
- Pro-active real-time routing in applications with multiple request patterns
- Heuristics for dynamic and stochastic routing in industrial shipping
- Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives
- Recent developments in dynamic vehicle routing systems
- Challenges and opportunities in attended home delivery
- Vehicle Routing Problems and Container Terminal Operations – An Update of Research
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
- Robust multiperiod vehicle routing under customer order uncertainty
- Vehicle routing with space- and time-correlated stochastic travel times: evaluating the objective function
- Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
- Transportation planning in dynamic environments
- New policies for the dynamic traveling salesman problem
- An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Minimising average passenger waiting time in personal rapid transit systems
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem
- Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery
- Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems
- Solving large-scale dynamic vehicle routing problems with stochastic requests
- A two-stage stochastic location-routing problem for electric vehicles fast charging
- Recent advances in integrating demand management and vehicle routing: a methodological review
- A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows
- Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach
- Dynamic demand management and online tour planning for same-day delivery
- Demand management in time-slotted last-mile delivery via dynamic routing with forecast orders
- Dynamic priority rules for combining on-demand passenger transportation and transportation of goods
- Dynamic scheduling of patients in emergency departments
- Robotized sorting systems: large-scale scheduling under real-time conditions with limited lookahead
- A survey of attended home delivery and service problems with a focus on applications
- An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem
- Sharing in construction projects -- on determining optimal container assignments for the on-site accommodation of trades
- Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions
- Data-driven customer acceptance for attended home delivery
- Balancing resources for dynamic vehicle routing with stochastic customer requests
- A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations
- The dynamic rail-road dial-a-ride problem
- The stochastic and dynamic inventory routing problem with fine time granularity: a reinforcement learning approach
- Multiple plan approach for a dynamic dial-a-ride problem
- Scenario consensus algorithms for solving stochastic and dynamic problems
- Emerging optimization problems for distribution in same-day delivery
- Adaptive forecast-driven repositioning for dynamic ride-sharing
- A dynamic and stochastic cumulative capacitated vehicle routing problem
- Assigning multi-skill configurations to multiple servers with a scenario-based planning and recombination approach
- The dynamic team orienteering problem
- Adaptive stochastic lookahead policies for dynamic multi-period purchasing and inventory routing
- Problem-based scenario generation by decomposing output distributions
- An updated survey of attended home delivery and service problems with a focus on applications
- Distributed or integrated stochastic ALNS? -- Two-stage stochastic team orienteering problem
- Mixed-integer programming dispatch with courier drop-out risk: balancing cost and delay in hybrid food delivery fleets
- The dynamic dispatch waves problem for same-day delivery
- Shaping decision models for stochastic dynamic optimization problems via reinforcement learning
- Sorting goods with an industrial robot arm: robot scheduling, destination assignment, and layout design
- The flexible and real-time commute trip sharing problems
- Online stochastic reservation systems
- Dynamic VRP in pharmaceutical distribution -- a case study
This page was built for publication: Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322013)
